Time complexity of practical parallel Steiner point insertion algorithms

Annual ACM Symposium on Parallel Algorithms and Architectures

Volumn 16, Issue , 2004, Pages 267-268

  Spielman, Daniel A ^a   Teng, Shang Hua ^b   Üngör, Alper ^c  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b BOSTON UNIVERSITY   (United States)

^c Duke University   (United States)

Author keywords

Delaunay triangulations; Parallelization; Steiner points

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING; QUALITY OF SERVICE;

DELAUNAY TRIANGULATIONS; PARALLELIZATION; STEINER POINTS;

COMPUTER SCIENCE;

EID: 8344235888     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1007912.1007953     Document Type: Conference Paper

References (8)

1. M. Bern, D. Eppstein, and J. Gilbert. Provably good mesh generation. J. Comp. System Sciences, 48:384-409, 1994.
2. M. Bern, D. Eppstein, and S.-H. Teng. Parallel construction of quadtrees and quality triangulations. Int. J. Comp. Geom. & Applications, 9(6):517-532, 1999.
3. P. Chew. Guaranteed-quality triangular meshes. Tech. Rep. TR-89-983, Cornell University, Ithaca, 1989.
4. H. Edelsbrunner and D. Guoy. Sink insertion for mesh improvement. Proc. ACM Symp. Comp. Geom., 115-123, 2001.
5. D. Nave, N. Chrisochoides, and P. Chew. Guaranteed-quality parallel Delaunay refinement for restricted polyhedral domains. Proc. ACM Symp. Comp. Geom., 135-144, 2002.
6. T. Okusanya and J. Peraire. Parallel unstructured mesh generation. Proc. Int. Conf. Numer. Grid Gen., 719-729, 1996.
7. J. Ruppert. A new and simple algorithm for quality 2D mesh generation. Proc. ACM Symp. on Disc. Alg., 83-92, 1993.
8. D. A. Spielman, S.-H. Teng, and A. Üngör. Parallel Delaunay refinement: Algorithms and analyses. Proc. Int. Meshing Roundtable, 205-217, 2002.