Name
Abstract | ||
|---|---|---|
It is shown that any linear triangulation of a simple polygon can be realized as a (combinatorially equivalent) Delaunay triangulation. Simple examples are presented to show that neither complete triangulations of polygons nor triangulations without separating triangles are necessarily realizable as Delaunay triangulations. |
Year | DOI | Venue |
|---|---|---|
1990 | 10.1016/0020-0190(90)90210-O | Inf. Process. Lett. |
Keywords | Field | DocType |
computational geometry,delaunay triangulation,triangulation,voronoi diagram | Discrete mathematics,Combinatorics,Chew's second algorithm,Bowyer–Watson algorithm,Surface triangulation,Constrained Delaunay triangulation,Mathematics,Point set triangulation,Ruppert's algorithm,Pitteway triangulation,Delaunay triangulation | Journal |
Volume | Issue | ISSN |
33 | 6 | 0020-0190 |
Citations | PageRank | References |
28 | 1.82 | 4 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Michael B. Dillencourt | 1 | 498 | 57.58 |