A time efficient Delaunay refinement algorithm

Authors:
Gary L. Miller
Affiliations:
Carnegie Mellon University, Pittsburgh, Pennsylvania
Venue:
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Year:
2004

Citing 9
Cited 9

Constrained Delaunay triangulations

SCG '87 Proceedings of the third annual symposium on Computational geometry
An optimal algorithm for constructing the Delaunay triangulation of a set of line segments

SCG '87 Proceedings of the third annual symposium on Computational geometry
Provably good mesh generation

Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
A Delaunay refinement algorithm for quality 2-dimensional mesh generation

SODA '93 Selected papers from the fourth annual ACM SIAM symposium on Discrete algorithms
Mesh generation for domains with small angles

Proceedings of the sixteenth annual symposium on Computational geometry
Introduction to Algorithms

Introduction to Algorithms
Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator

FCRC '96/WACG '96 Selected papers from the Workshop on Applied Computational Geormetry, Towards Geometric Engineering
Delaunay refinement mesh generation

Delaunay refinement mesh generation
Delaunay refinement algorithms for triangular mesh generation

Computational Geometry: Theory and Applications

A time-optimal delaunay refinement algorithm in two dimensions

SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Triangulations with locally optimal Steiner points

SGP '07 Proceedings of the fifth Eurographics symposium on Geometry processing
Off-centers: A new type of Steiner points for computing size-optimal quality-guaranteed Delaunay triangulations

Computational Geometry: Theory and Applications
Algorithm, software, and hardware optimizations for Delaunay mesh generation on simultaneous multithreaded architectures

Journal of Parallel and Distributed Computing
Eliminating contour line artefacts by using constrained edges

Computers & Geosciences
A template for developing next generation parallel Delaunay refinement methods

Finite Elements in Analysis and Design
Computational geometry I

Algorithms and theory of computation handbook
Synthesizing concurrent schedulers for irregular algorithms

Proceedings of the sixteenth international conference on Architectural support for programming languages and operating systems
Fully Generalized Two-Dimensional Constrained Delaunay Mesh Refinement

SIAM Journal on Scientific Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present a Delaunay refinement algorithm for generating good aspect ratio and optimal size triangulations. This is the first algorithm known to have sub-quadratic running time. The algorithm is based on the extremely popular Delaunay refinement algorithm of Ruppert. We know of no prior refinement algorithm with an analyzed subquadratic time bound. For many natural classes of meshing problems, our time bounds are comparable to know bounds for quadtree methods.