Fast segment insertion and incremental construction of constrained Delaunay triangulations
From MaRDI portal
Publication:2354921
DOI10.1016/j.comgeo.2015.04.006zbMath1396.65062OpenAlexW2200785014MaRDI QIDQ2354921
Brielin C. Brown, Jonathan Richard Shewchuk
Publication date: 27 July 2015
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2015.04.006
computational geometryconstrained Delaunay triangulationrandomized incremental construction\(\epsilon\)-net
Related Items (2)
Shortcut hulls: vertex-restricted outer simplifications of polygons ⋮ Numerical simulation of gravity anomaly based on the unstructured element grid and finite element method
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generalized Delaunay triangulation for planar graphs
- Voronoi diagrams and arrangements
- \(\epsilon\)-nets and simplex range queries
- A sweepline algorithm for Voronoi diagrams
- Constrained Delaunay triangulations
- Voronoi diagrams from convex hulls
- Triangulating a simple polygon in linear time
- On the difficulty of triangulating three-dimensional nonconvex polyhedra
- Adaptive precision floating-point arithmetic and fast robust geometric predicates
- New applications of random sampling in computational geometry
- General-dimensional constrained Delaunay and constrained regular triangulations. I: Combinatorial properties
- COUPON COLLECTING
- Triangulation automatique d’un polyèdre en dimension $N$
- Primitives for the manipulation of general subdivisions and the computation of Voronoi
- Two algorithms for constructing a Delaunay triangulation
- Mean, Median and Mode in Binomial Distributions
- Finding the Constrained Delaunay Triangulation and Constrained Voronoi Diagram of a Simple Polygon in Linear Time
- Higher-Quality Tetrahedral Mesh Generation for Domains with Small Angles by Constrained Delaunay Refinement
- Updating and constructing constrained delaunay and constrained regular triangulations by flips
- Incremental constructions con BRIO
- Algorithms – ESA 2005
This page was built for publication: Fast segment insertion and incremental construction of constrained Delaunay triangulations
