An improved parallel algorithm for Delaunay triangulation on distributed memory parallel computers

Parallel Processing Letters

Volumn 11, Issue 2-3, 2001, Pages 341-352

  Lee, S ^a   Park, C I ^a   Park, C M ^a  

^a Pohang University of Science and Technology (POSTECH)   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; COMPUTATIONAL METHODS; DATA STRUCTURES; DISTRIBUTED COMPUTER SYSTEMS; SET THEORY;

DELAUNAY TRIANGULATION; DISTRIBUTED MEMORY PARALLEL COMPUTERS;

PARALLEL ALGORITHMS;

EID: 0035354673     PISSN: 01296264     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0129-6264(01)00063-4     Document Type: Article

References (13)

1. Geometric structures for three dimensional shape representation
2. Automatic triangulation of arbitrary planar domains for finite element method
3. An implementation of a flight path visualization system using optimization algorithms of the triangulated irregular networks
4. Efficient VLSI parallel algorithm for Delaunay triangulation on orthogonal tree network in two and three dimensions
5. Parallel 3D Delaunay triangulation
6. d triangulations
7. Developing a practical projection-based parallel Delaunay algorithm
8. An efficient parallel algorithm for Delaunay triangulation on distributed memory parallel computers
9. Two dimensional interpolation from random data
10. Geometric computing and uniform grid technique