Delaunay triangulations of imprecise pointsin linear time after preprocessing

DOI10.1145/1377676.1377727MaRDI QIDQ3602931zbMATH OpenOpenAlexWikidataFDO

Authors Maarten Löffler, Jack Snoeyink

Publication date 12 February 2009

Published in Proceedings of the twenty-fourth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1377676.1377727

zbMATH Keywords

Delaunay triangulationEuclidean minimum spanning treeGabriel graph

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Delaunay triangulation of imprecise points in linear time after preprocessing
• scientific article; zbMATH DE number 6693709
• Preprocessing imprecise points for Delaunay triangulation: simplified and extended
• Delaunay Triangulation of Imprecise Points Simplified and Extended
• Delaunay triangulation and the convex hull of n points in expected linear time
• Linear-time reconstruction of Delaunay triangulations with applications
• Preprocessing Imprecise Points and Splitting Triangulations
• Preprocessing Imprecise Points and Splitting Triangulations
• A linear bound on the complexity of the Delaunay triangulation of points on polyhedral surfaces
• Convex hull of imprecise points in o(n n) time after preprocessing

Cited in

(13)

• Delaunay triangulation of imprecise points in linear time after preprocessing
• On the power of the semi-separated pair decomposition
• Unions of onions: preprocessing imprecise points for fast onion layer decomposition
• scientific article; zbMATH DE number 6693709 (Why is no real title available?)
• Unions of onions: preprocessing imprecise points for fast onion decomposition
• On the Power of the Semi-Separated Pair Decomposition
• Delaunay Triangulation of Imprecise Points Simplified and Extended
• Preprocessing Imprecise Points and Splitting Triangulations
• (Approximate) uncertain skylines
• Voronoi Diagram and Delaunay Triangulation with Independent and Dependent Geometric Uncertainties
• A time-optimal delaunay refinement algorithm in two dimensions
• Preprocessing Imprecise Points and Splitting Triangulations
• Preprocessing imprecise points for Delaunay triangulation: simplified and extended

This page was built for publication: Delaunay triangulations of imprecise pointsin linear time after preprocessing

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