Finding the Constrained Delaunay Triangulation and Constrained Voronoi Diagram of a Simple Polygon in Linear Time (Q4210159)
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: Finding the Constrained Delaunay Triangulation and Constrained Voronoi Diagram of a Simple Polygon in Linear Time |
scientific article; zbMATH DE number 1200799
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding the Constrained Delaunay Triangulation and Constrained Voronoi Diagram of a Simple Polygon in Linear Time |
scientific article; zbMATH DE number 1200799 |
Statements
Finding the Constrained Delaunay Triangulation and Constrained Voronoi Diagram of a Simple Polygon in Linear Time (English)
0 references
21 September 1998
0 references
algorithm
0 references
computational geometry
0 references
constrained Delaunay triangulation
0 references
polygon
0 references
Voronoi diagram
0 references
0.9951023459434508
0 references
0.8206455707550049
0 references
0.8146708011627197
0 references
0.8115061521530151
0 references
