A time efficient Delaunay refinement algorithm
From MaRDI portal
Publication:5501286
Recommendations
Cited in
(10)- scientific article; zbMATH DE number 177537 (Why is no real title available?)
- Beating the spread, time-optimal point meshing
- Off-centers: A new type of Steiner points for computing size-optimal quality-guaranteed Delaunay triangulations
- Splitting a Delaunay triangulation in linear time
- A simple algorithm for higher-order Delaunay mosaics and alpha shapes
- A time-optimal delaunay refinement algorithm in two dimensions
- Fast and robust Delaunay tessellation in periodic domains
- DELAUNAY REFINEMENT ALGORITHMS FOR ESTIMATING LOCAL FEATURE SIZE IN 2D AND 3D
- A novel model of conforming Delaunay triangulation for sensor network configuration
- An algorithm for dynamic Delaunay triangulation of simple polygon
This page was built for publication: A time efficient Delaunay refinement algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501286)