Load-Balancing for Parallel Delaunay Triangulations

DOI10.1007/978-3-030-29400-7_12zbMath1437.68187arXiv1902.07554OpenAlexW2969763713MaRDI QIDQ3297568

Daniel Funke, Peter Sanders, Vincent Winkler

Publication date: 20 July 2020

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1902.07554

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10) Distributed algorithms (68W15)

Uses Software

• CGAL
• DeWall
• Triangle

Cites Work

• Unnamed Item
• Parallel geometric algorithms for multi-core computers
• Parallel computational geometry
• Adaptive precision floating-point arithmetic and fast robust geometric predicates
• DeWall: a fast divide and conquer Delaunay triangulation algorithm in \(E^d\).
• Simultaneous mesh generation and partitioning for Delaunay meshes
• THE DELAUNAY HIERARCHY
• An Efficient Heuristic Procedure for Partitioning Graphs
• Efficient Collision Detection of Complex Deformable Models using AABB Trees
• How Good is Recursive Bisection?
• Efficient Parallel Random Sampling—Vectorized, Cache-Efficient, and Online
• Parallel d-D Delaunay Triangulations in Shared and Distributed Memory

This page was built for publication: Load-Balancing for Parallel Delaunay Triangulations