Recover from non-flippable configurations in parallel approaches to three dimensional kinetic regular triangulations

Authors:
Tilo Beyer;Michael Meyer-Hermann
Affiliations:
Frankfurt Institute for Advanced Studies, Johann Wolfgang Goethe-University, Frankfurt Main, Germany;Frankfurt Institute for Advanced Studies, Johann Wolfgang Goethe-University, Frankfurt Main, Germany
Venue:
ACMOS'06 Proceedings of the 8th WSEAS international conference on Automatic control, modeling & simulation
Year:
2006

Citing 10
Cited 1

Power diagrams: properties, algorithms and applications

SIAM Journal on Computing
Three-dimensional triangulations from local transformations

SIAM Journal on Scientific and Statistical Computing
Construction of three-dimensional Delaunay triangulations using local transformations

Computer Aided Geometric Design
Voronoi diagrams—a survey of a fundamental geometric data structure

ACM Computing Surveys (CSUR)
Spatial tessellations: concepts and applications of Voronoi diagrams

Spatial tessellations: concepts and applications of Voronoi diagrams
A data-parallel algorithm for three-dimensional Delaunay triangulation and its implementation

Proceedings of the 1993 ACM/IEEE conference on Supercomputing
Regular triangulations of dynamic sets of points

Computer Aided Geometric Design
Task Parallel Implementation of the Bowyer-Watson Algorithm

Task Parallel Implementation of the Bowyer-Watson Algorithm
MPI: A Message-Passing Interface Standard

MPI: A Message-Passing Interface Standard
An empirical comparison of techniques for updating Delaunay triangulations

SCG '04 Proceedings of the twentieth annual symposium on Computational geometry

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

The Lawson flip algorithm for three dimensional regular triangulations can lead to non-flippable configurations. Up to now incremental changes to the triangulation are the only way to solve this problem. This enforces a serial algorithm which can not be generalized to a parallel algorithm. A practical solution to this problem suitable for a parallel implementation of the Lawson flip algorithm is presented. Instead of avoiding the generation of non-flippable configurations a method to correct a non-regular triangulation is introduced which reconstructs regular triangulations when the flip algorithm has failed. This enables an efficient parallel simulation of three dimensional particle dynamics based on regular triangulations.