Triangulating Simple Polygons and Equivalent Problems (Q3721847)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3952050
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Triangulating Simple Polygons and Equivalent Problems |
scientific article; zbMATH DE number 3952050 |
Statements
Triangulating Simple Polygons and Equivalent Problems (English)
0 references
1984
0 references
computer graphics
0 references
geometric algorithm
0 references
computational geometry
0 references
decomposition
0 references
scan conversion
0 references
triangulation
0 references
trapezoidization
0 references
polygons with holes
0 references
edge-vertex visibility
0 references
0.871310293674469
0 references
0.8569781184196472
0 references
0.8542612195014954
0 references
0.8537973761558533
0 references
