Delaunay triangulation of imprecise points in linear time after preprocessing
From MaRDI portal
Publication:1037646
DOI10.1016/J.COMGEO.2008.12.007zbMATH Open1177.65037DBLPjournals/comgeo/LofflerS10OpenAlexW2041094480WikidataQ56970222 ScholiaQ56970222MaRDI QIDQ1037646FDOQ1037646
Authors: Maarten Löffler, Jack Snoeyink 
Publication date: 16 November 2009
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2008.12.007
Recommendations
- Delaunay triangulations of imprecise pointsin 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
- Preprocessing Imprecise Points and Splitting Triangulations
Cites Work
- Title not available (Why is that?)
- A linear-time algorithm for computing the Voronoi diagram of a convex polygon
- Triangulating a simple polygon in linear time
- Finding the medial axis of a simple polygon in linear time
- Constructing strongly convex approximate hulls with inaccurate primitives
- Delaunay refinement algorithms for triangular mesh generation
- Dense packings of congruent circles in a circle
- Two design principles of geometric algorithms in finite-precision arithmetic
- Computability of partial Delaunay triangulation and Voronoi diagram (extended abstract)
- Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
- Preprocessing Imprecise Points and Splitting Triangulations
- Title not available (Why is that?)
- Finding the Constrained Delaunay Triangulation and Constrained Voronoi Diagram of a Simple Polygon in Linear Time
- Structural tolerance and Delaunay triangulation
- Correct Delaunay triangulation in the presence of inexact inputs and arithmetic
- Almost-Delaunay simplices: Robust neighbor relations for imprecise 3D points using CGAL
- Almost-Delaunay simplices, nearest neighbor relations for imprecise points
- Triangulating input-constrained planar point sets
- Approximating Largest Convex Hulls for Imprecise Points
- Numerical Software with Result Verification
- NUMERICAL STABILITY OF ALGORITHMS FOR 2D DELAUNAY TRIANGULATIONS
Cited In (20)
- The maximal distance between imprecise point objects
- Delaunay Triangulation of Imprecise Points Simplified and Extended
- Fréchet Distance for Uncertain Curves
- Delaunay triangulations of imprecise pointsin linear time after preprocessing
- The Most Likely Object to be Seen Through a Window
- Computing the Fréchet distance between uncertain curves in one dimension
- Unions of onions: preprocessing imprecise points for fast onion layer decomposition
- Computing realistic terrains from imprecise elevations
- Computing the Fréchet distance between uncertain curves in one dimension
- Computing the discrete Fréchet distance with imprecise input
- Title not available (Why is that?)
- Preprocessing Imprecise Points and Splitting Triangulations
- Preprocessing imprecise points for Delaunay triangulation: simplified and extended
- Preprocessing Imprecise Points and Splitting Triangulations
- Splitting a Delaunay triangulation in linear time
- Minimizing the diameter of a spanning tree for imprecise points
- Preprocessing Ambiguous Imprecise Points
- Minimizing query frequency to bound congestion potential for moving entities at a fixed target time
- Unions of onions: preprocessing imprecise points for fast onion decomposition
- Data imprecision under \(\lambda\)-geometry model
Uses Software
This page was built for publication: Delaunay triangulation of imprecise points in linear time after preprocessing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1037646)
