Time complexity of practical parallel steiner point insertion algorithms

Authors:
Daniel A. Spielman;Shang-Hua Teng;Alper Üngör
Affiliations:
Massachusets Instute of Tech.;Boston University;Duke University
Venue:
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Year:
2004

Citing 4
Cited 4

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 new and simple algorithm for quality 2-dimensional mesh generation

SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Sink-insertion for mesh improvement

SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Guaranteed: quality parallel delaunay refinement for restricted polyhedral domains

Proceedings of the eighteenth annual symposium on Computational geometry

A time-optimal delaunay refinement algorithm in two dimensions

SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Sparse parallel Delaunay mesh refinement

Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Algorithm 872: Parallel 2D constrained Delaunay mesh generation

ACM Transactions on Mathematical Software (TOMS)
A template for developing next generation parallel Delaunay refinement methods

Finite Elements in Analysis and Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

An effective method in practice to compute quality Delaunay triangulations is to apply parallel refinements that insert Steiner points whose prestars in the triangulation do not overlap. We show that these algorithms can be implemented in O(log m) time using m processors, where m is the output size. To our knowledge, this is the first such analysis.