Keywords
Delaunay triangulationTravelling salesman problemPolygon (computer graphics)TriangulationBowyer–Watson algorithmVoronoi diagramComputer scienceDimension (graph theory)Sample (material)Constrained Delaunay triangulationSet (abstract data type)Computational geometryAlgorithmMathematicsMathematical optimizationCombinatoricsGeometry
Affiliated Institutions
Related Publications
Computing the n-dimensional Delaunay tessellation with application to Voronoi polytopes
The Delaunay tessellation in n-dimensional space is a space-filling aggregate of n-simplices. These n-simplices are the dual forms of the vertices in the commonly used Voronoi t...
The integrity of geometrical boundaries in the two‐dimensional delaunay triangulation
Abstract The Delaunay triangulation has recently received attention as a viable method for construction computational meshes. However, an arbitrary boundary definition which mus...
A computational geometric approach to feasible region division in constrained global optimization
Proposes the use of the Delaunay triangulation for feasible region division in constrained global optimization. The mathematical foundations for its use, along with the practica...
Publication Info
- Year
- 1999
- Type
- book-chapter
- Pages
- 164-176
- Citations
- 18
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
18
OpenAlex
Cite This
Joachim Giesen
(1999).
Curve Reconstruction in Arbitrary Dimension and the Traveling Salesman Problem.
Lecture notes in computer science
, 164-176.
https://doi.org/10.1007/3-540-49126-0_13
Identifiers
- DOI
- 10.1007/3-540-49126-0_13