Two simple algorithms for constructing a two-dimensional constrained Delaunay triangulation (Q1208536): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q587121 |
Changed an Item |
||
| Property / reviewed by | |||
| Property / reviewed by: Prabhat Kumar Mahanti / rank | |||
Normal rank | |||
Revision as of 18:33, 16 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two simple algorithms for constructing a two-dimensional constrained Delaunay triangulation |
scientific article |
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
