Triangulating input-constrained planar point sets (Q975526): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Almost-Delaunay simplices: Robust neighbor relations for imprecise 3D points using CGAL / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Largest and Smallest Tours and Convex Hulls for Imprecise Points / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Largest Bounding Box, Smallest Diameter, and Related Problems on Imprecise Points / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On-line construction of the convex hull of a simple polyline / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Triangulating Simple Polygons and Equivalent Problems / rank | |||
Normal rank | |||
Latest revision as of 22:26, 2 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Triangulating input-constrained planar point sets |
scientific article |
Statements
Triangulating input-constrained planar point sets (English)
0 references
9 June 2010
0 references
computational geometry
0 references
triangulation
0 references
points
0 references
constrained
0 references
imprecision
0 references
0 references
