| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6868418 | Computational Geometry | 2018 | 9 Pages |
Abstract
We discuss three different approaches to parallelizing ear clipping, and we present a parallel edge-flipping algorithm for converting a triangulation into a constrained Delaunay triangulation. All algorithms were implemented as part of Held's FIST framework. We report on our experimental findings, which show that the most promising method achieves an average speedup of 2-3 on a quad-core processor. In any case, our new triangulation code is faster than the sequential triangulation codes Triangle (by Shewchuk) and FIST.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Günther Eder, Martin Held, Peter Palfrader,