Triangulating input-constrained planar point sets

DOI10.1016/j.ipl.2008.09.016zbMath1191.68763OpenAlexW2065568351MaRDI QIDQ975526

Joseph S. B. Mitchell, Martin Held

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

zbMATH Keywords

triangulationcomputational geometryimprecisionpointsconstrained

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (9)

Delaunay Triangulation of Imprecise Points Simplified and Extended ⋮ On algorithmic complexity of imprecise spanners ⋮ Preprocessing imprecise points for Delaunay triangulation: simplified and extended ⋮ The Most Likely Object to be Seen Through a Window ⋮ A model to simplify 2D triangle meshes with irregular shapes ⋮ A fully polynomial time approximation scheme for the smallest diameter of imprecise points ⋮ Preprocessing Ambiguous Imprecise Points ⋮ Reducing Urban Concentration Using a Neural Network Model ⋮ Delaunay triangulation of imprecise points in linear time after preprocessing

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

This page was built for publication: Triangulating input-constrained planar point sets