Triangulating input-constrained planar point sets
From MaRDI portal
Publication:975526
DOI10.1016/j.ipl.2008.09.016zbMath1191.68763MaRDI QIDQ975526
Martin Held, Joseph S. B. Mitchell
Publication date: 9 June 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2008.09.016
68W05: Nonnumerical algorithms
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Related Items
Preprocessing imprecise points for Delaunay triangulation: simplified and extended, A model to simplify 2D triangle meshes with irregular shapes, Delaunay triangulation of imprecise points in linear time after preprocessing, Delaunay Triangulation of Imprecise Points Simplified and Extended, Reducing Urban Concentration Using a Neural Network Model
Cites Work
- On-line construction of the convex hull of a simple polyline
- Almost-Delaunay simplices: Robust neighbor relations for imprecise 3D points using CGAL
- Largest Bounding Box, Smallest Diameter, and Related Problems on Imprecise Points
- Triangulating Simple Polygons and Equivalent Problems
- Largest and Smallest Tours and Convex Hulls for Imprecise Points