A time efficient Delaunay refinement algorithm

MaRDI QIDQ5501286zbMATH OpenFDO

Authors Gary L. Miller

Publication date 3 August 2015

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• A time-optimal delaunay refinement algorithm in two dimensions
• A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation
• A 2D advancing-front Delaunay mesh refinement algorithm
• scientific article; zbMATH DE number 437532
• Quality Triangulations with Locally Optimal Steiner Points

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)