A time efficient Delaunay refinement algorithm

zbMATH Open1317.68251MaRDI QIDQ5501286FDOQ5501286

Authors: Gary L. Miller 

Publication date: 3 August 2015

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

Mathematics Subject Classification ID

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

Cited In (10)

• Off-centers: A new type of Steiner points for computing size-optimal quality-guaranteed Delaunay triangulations
• DELAUNAY REFINEMENT ALGORITHMS FOR ESTIMATING LOCAL FEATURE SIZE IN 2D AND 3D
• An algorithm for dynamic Delaunay triangulation of simple polygon
• Fast and robust Delaunay tessellation in periodic domains
• A novel model of conforming Delaunay triangulation for sensor network configuration
• Title not available (Why is that?)
• A time-optimal delaunay refinement algorithm in two dimensions
• Beating the spread, time-optimal point meshing
• Splitting a Delaunay triangulation in linear time
• A simple algorithm for higher-order Delaunay mosaics and alpha shapes

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)