Two simple algorithms for constructing a two-dimensional constrained Delaunay triangulation (Q1208536)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Two simple algorithms for constructing a two-dimensional constrained Delaunay triangulation |
scientific article; zbMATH DE number 166550
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two simple algorithms for constructing a two-dimensional constrained Delaunay triangulation |
scientific article; zbMATH DE number 166550 |
Statements
Two simple algorithms for constructing a two-dimensional constrained Delaunay triangulation (English)
0 references
16 May 1993
0 references
This paper develops two simple algorithms for constructing two- dimensional constrained Delaunay triangulations. It is shown that these algorithms can be used in building constrained polygons within a convex hull. Simple examples are presented.
0 references
iterative triangulation algorithm
0 references
algorithms
0 references
Delaunay triangulations
0 references
polygons
0 references
convex hull
0 references
0 references
0.9156084
0 references
0 references
0.8970864
0 references
0.89676654
0 references
0.8917992
0 references
0.88882166
0 references
0.88642704
0 references
