Splitting a Delaunay triangulation in linear time
From MaRDI portal
Publication:1849762
DOI10.1007/S00453-002-0939-8zbMATH Open1016.68137OpenAlexW1972369894MaRDI QIDQ1849762FDOQ1849762
Authors: Bernard Chazelle, Olivier Devillers, Mercè Mora, Ferran Hurtado, Vera Sacristán 
Publication date: 1 December 2002
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-002-0939-8
Recommendations
- scientific article; zbMATH DE number 1875425
- scientific article; zbMATH DE number 934894
- Linear-time reconstruction of Delaunay triangulations with applications
- Delaunay triangulation and the convex hull of n points in expected linear time
- A faster divide-and-conquer algorithm for constructing Delaunay triangulations
- A time efficient Delaunay refinement algorithm
- Triangulating a simple polygon in linear time
- Finding the Constrained Delaunay Triangulation and Constrained Voronoi Diagram of a Simple Polygon in Linear Time
- Delaunay triangulation of imprecise points in linear time after preprocessing
Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cited In (9)
- Delaunay Triangulation of Imprecise Points Simplified and Extended
- Three problems about simple polygons
- Computing hereditary convex structures
- A tight lower bound for computing the diameter of a 3D convex polytope
- Title not available (Why is that?)
- Preprocessing imprecise points for Delaunay triangulation: simplified and extended
- The greedy triangulation can be computed from the Delaunay triangulation in linear time
- Interior boundary-aligned unstructured grid generation and cell-centered versus vertex-centered CVD-MPFA performance
- Spanning trees in multipartite geometric graphs
This page was built for publication: Splitting a Delaunay triangulation in linear time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1849762)
