Triangulating input-constrained planar point sets
From MaRDI portal
Publication:975526
DOI10.1016/J.IPL.2008.09.016zbMATH Open1191.68763OpenAlexW2065568351MaRDI QIDQ975526FDOQ975526
Authors: M. 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
Recommendations
- Triangulation sous contraintes en dimension quelconque
- Triangulating point sets in space
- Constrained independence system and triangulations of planar point sets
- Constrained Delaunay triangulations
- OUTPUT SENSITIVE CONSTRUCTION OF THE DELAUNAY TRIANGULATION OF POINTS LYING IN TWO PLANES
- An optimal parallel algorithm for triangulating a set of points in the plane
- A time-space trade-off for triangulations of points in the plane
- A triangulation algorithm from arbitrary shaped multiple planar contours
Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Triangulating Simple Polygons and Equivalent Problems
- Largest Bounding Box, Smallest Diameter, and Related Problems on Imprecise Points
- Almost-Delaunay simplices: Robust neighbor relations for imprecise 3D points using CGAL
- On-line construction of the convex hull of a simple polyline
- Largest and Smallest Tours and Convex Hulls for Imprecise Points
Cited In (16)
- MINIMAL SET OF CONSTRAINTS FOR 2D CONSTRAINED DELAUNAY RECONSTRUCTION
- Delaunay triangulation of imprecise points in linear time after preprocessing
- Constrained independence system and triangulations of planar point sets
- Algorithms – ESA 2005
- Structural improvement of planar triangulations: Some constraints and practical issues
- A model to simplify 2D triangle meshes with irregular shapes
- Title not available (Why is that?)
- Delaunay Triangulation of Imprecise Points Simplified and Extended
- Title not available (Why is that?)
- A fully polynomial time approximation scheme for the smallest diameter of imprecise points
- The Most Likely Object to be Seen Through a Window
- Reducing urban concentration using a neural network model
- On algorithmic complexity of imprecise spanners
- Title not available (Why is that?)
- Preprocessing imprecise points for Delaunay triangulation: simplified and extended
- Preprocessing Ambiguous Imprecise Points
This page was built for publication: Triangulating input-constrained planar point sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q975526)
