Delaunay Triangulation of Imprecise Points Simplified and Extended

DOI10.1007/978-3-642-03367-4_12MaRDI QIDQ3183447zbMATHOpenAlexFDO

Authors Kevin Buchin, Maarten Löffler, Pat Morin, Wolfgang Mulzer

Publication date 20 October 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-03367-4_12

Mathematics Subject Classification ID

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

Recommendations

• Preprocessing imprecise points for Delaunay triangulation: simplified and extended
• scientific article; zbMATH DE number 6693709
• Delaunay triangulation of imprecise points in linear time after preprocessing
• Delaunay triangulations of imprecise pointsin linear time after preprocessing
• Preprocessing Imprecise Points and Splitting Triangulations

Cites work

• A CONVEX HULL ALGORITHM FOR POINTS WITH APPROXIMATELY KNOWN POSITIONS
• Almost-Delaunay simplices, nearest neighbor relations for imprecise points
• Computational geometry. Algorithms and applications.
• Computing hereditary convex structures
• Constructing strongly convex approximate hulls with inaccurate primitives
• Delaunay triangulations of imprecise pointsin linear time after preprocessing
• Efficient update strategies for geometric computing with uncertainty
• Guarding scenes against invasive hypercubes.
• Linear size binary space partitions for uncluttered scenes
• ON COMPUTING VORONOI DIAGRAMS FOR SORTED POINT SETS
• On Approximating the Depth and Related Problems
• Optimality of the Delaunay triangulation in \(\mathbb{R}^ d\)
• PARALLEL CONSTRUCTION OF QUADTREES AND QUALITY TRIANGULATIONS
• Preprocessing Imprecise Points and Splitting Triangulations
• Provably good mesh generation
• Realistic input models for geometric algorithms
• Self-improving algorithms for delaunay triangulations
• Splitting a Delaunay triangulation in linear time
• Triangulating a simple polygon in linear time
• Triangulating input-constrained planar point sets

Cited in

(11)

• Computability of partial Delaunay triangulation and Voronoi diagram (extended abstract)
• Preprocessing imprecise points for Delaunay triangulation: simplified and extended
• Minimal roughness property of the Delaunay triangulation: A shorter approach
• Algorithm 1012
• Preprocessing Imprecise Points and Splitting Triangulations
• Delaunay triangulation of imprecise points in linear time after preprocessing
• Interior improvement of piecewise linear interpolants defined over Delaunay triangulations
• Nice point sets can have nasty Delaunay triangulations
• scientific article; zbMATH DE number 6693709 (Why is no real title available?)
• Delaunay triangulations of imprecise pointsin linear time after preprocessing
• Almost-Delaunay simplices, nearest neighbor relations for imprecise points

This page was built for publication: Delaunay Triangulation of Imprecise Points Simplified and Extended

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3183447)