Minimum Weight Triangulations

Yin-Feng Xu ()
Additional contact information
Yin-Feng Xu: Xi’an Jiaotong University, School of Management

A chapter in Handbook of Combinatorial Optimization, 1998, pp 1363-1380 from Springer

Abstract: Abstract A triangulation of a given set S of n points in the plane is a maximal set of non-crossing line segments (called edges) which have both endpoints in S. A triangulation partitions the interior of the convex hull of the given point set into triangles. It is used in many areas of engineering and scientific applications such as finite element methods, approximation theory, numerical computation, computer-aided geometric design, and etc.

Keywords: Discrete Comput Geom; Computational Geometry; Delaunay Triangulation; Convex Polygon; Simple Polygon (search for similar items in EconPapers)
Date: 1998
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4613-0303-9_22

Ordering information: This item can be ordered from
http://www.springer.com/9781461303039

DOI: 10.1007/978-1-4613-0303-9_22

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().