Parallel Delaunay triangulation in E2 and E3 for computers with shared memory

Authors:
Josef Kohout;Ivana Kolingerová;Jiří ára
Affiliations:
Department of Computer Science and Engineering, Centre of Computer Graphics and Data Visualization, University of West Bohemia, Univerzitní 8, 306 14 Plzeň, Czech Republic;Department of Computer Science and Engineering, Centre of Computer Graphics and Data Visualization, University of West Bohemia, Univerzitní 8, 306 14 Plzeň, Czech Republic;Department of Computer Science and Engineering, Czech Technical University, Karlovo nám. 13, 121 35 Praha 2, Czech Republic
Venue:
Parallel Computing
Year:
2005

Citing 9
Cited 7

A simple divide-and-conquer algorithm for computing Delaunay triangulations in O(n log log n) expected time

SCG '86 Proceedings of the second annual symposium on Computational geometry
Construction of three-dimensional Delaunay triangulations using local transformations

Computer Aided Geometric Design
Implementation and evaluation of an efficient parallel Delaunay triangulation algorithm

Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Computational geometry: algorithms and applications

Computational geometry: algorithms and applications
Handbook of discrete and computational geometry

Handbook of discrete and computational geometry
Constructing the constrained Delaunay triangulation on the Intel paragon

SAC '97 Proceedings of the 1997 ACM symposium on Applied computing
A parallel dynamic-mesh Lagrangian method for simulation of flows with dynamic interfaces

Proceedings of the 2000 ACM/IEEE conference on Supercomputing
A remeshing algorithm based on bubble packing method and its application to large deformation problems

Finite Elements in Analysis and Design
Parallel Delaunay triangulation based on circum-circle criterion

SCCG '03 Proceedings of the 19th spring conference on Computer graphics

Algorithm 872: Parallel 2D constrained Delaunay mesh generation

ACM Transactions on Mathematical Software (TOMS)
Computing two-dimensional Delaunay triangulation using graphics hardware

Proceedings of the 2008 symposium on Interactive 3D graphics and games
Parallel geometric algorithms for multi-core computers

Proceedings of the twenty-fifth annual symposium on Computational geometry
Parallel geometric algorithms for multi-core computers

Computational Geometry: Theory and Applications
Parallel Delaunay triangulation-Application to two dimensions

Finite Elements in Analysis and Design
A distributed-memory parallel technique for two-dimensional mesh generation for arbitrary domains

Advances in Engineering Software
A GPU accelerated algorithm for 3D Delaunay triangulation

Proceedings of the 18th meeting of the ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents several parallel algorithms for the construction of the Delaunay triangulation in E^2 and E^3-one of the fundamental problems in computer graphics. The proposed algorithms are designed for parallel systems with shared memory and several processors. Such a hardware configuration (especially the case with two-processors) became widely spread in the last few years in the computer graphics area. Some of the proposed algorithms are easy to be implemented but not very efficient, while some of them prove opposite characteristics. Some of them are usable in E^2 only, other work in E^3 as well. The algorithms themselves were already published in computer graphics where the computer graphics criteria were highlighted. This paper concentrates on parallel and systematic point of view and gives detailed information about the parallelization of a computational geometry application to parallel and distributed computation oriented community.