Preprocessing imprecise points for Delaunay triangulation: simplified and extended
type: Item
instance of: scholarly article
title: Preprocessing imprecise points for Delaunay triangulation: simplified and extended
zbMATH Open document ID: 1225.68263
author: Kevin Buchin
author: Maarten Löffler
author: Pat Morin
author: Wolfgang Mulzer
published in: Algorithmica
publication date: 2011-11-07T00:00:00Z
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 5968724
zbMATH Keywords: Delaunay triangulation
zbMATH Keywords: data imprecision
zbMATH Keywords: quadtree
MaRDI profile type: Publication
full work available at URL: s00453-010-9430-0
OpenAlex ID: W2147026670
cites work: On Approximating the Depth and Related Problems
cites work: Q5501287
cites work: Linear size binary space partitions for uncluttered scenes
cites work: Q5452284
cites work: Guarding scenes against invasive hypercubes.
cites work: Sharp quantum versus classical query complexity separations
cites work: Provably good mesh generation
cites work: PARALLEL CONSTRUCTION OF QUADTREES AND QUALITY TRIANGULATIONS
cites work: Efficient update strategies for geometric computing with uncertainty
cites work: Delaunay Triangulations in O(sort(n)) Time and More
cites work: A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
cites work: Well-separated pair decomposition in linear time?
cites work: Triangulating a simple polygon in linear time
cites work: Splitting a Delaunay triangulation in linear time
cites work: Computing hereditary convex structures
cites work: Self-improving algorithms for delaunay triangulations
cites work: ON COMPUTING VORONOI DIAGRAMS FOR SORTED POINT SETS
cites work: Approximating the minimum weight Steiner triangulation
cites work: A CONVEX HULL ALGORITHM FOR POINTS WITH APPROXIMATELY KNOWN POSITIONS
cites work: Constructing strongly convex approximate hulls with inaccurate primitives
cites work: Triangulating input-constrained planar point sets
cites work: Largest bounding box, smallest diameter, and related problems on imprecise points
cites work: Preprocessing Imprecise Points and Splitting Triangulations
cites work: Delaunay triangulation of imprecise points in linear time after preprocessing
cites work: Q4547814
cites work: The complexity of the free space for motion planning amidst fat obstacles
DOI: 10.1007/S00453-010-9430-0
Recommended article: Delaunay Triangulation of Imprecise Points Simplified and Extended
Recommended article: Delaunay triangulation of imprecise points in linear time after preprocessing
Recommended article: Delaunay triangulations of imprecise pointsin linear time after preprocessing
Recommended article: Q2968075
Recommended article: Preprocessing Imprecise Points and Splitting Triangulations
Recommended article: Q5501287
Recommended article: Correct Delaunay triangulation in the presence of inexact inputs and arithmetic
Recommended article: Almost-Delaunay simplices: Robust neighbor relations for imprecise 3D points using CGAL
Recommended article: Delaunay triangulation of non-uniform point distributions by means of multi-grid insertion
description: scientific article; zbMATH DE number 5968724