Multi-core Implementations of Geometric Algorithms

DOI10.1007/978-3-642-03456-5_18MaRDI QIDQ3644727zbMATH OpenOpenAlexFDO

Authors Daniel Schmitt, S. Näher

Publication date 12 November 2009

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

Full work available at URL https://doi.org/10.1007/978-3-642-03456-5_18

Mathematics Subject Classification ID

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

Recommendations

• Parallel geometric algorithms for multi-core computers
• Parallel geometric algorithms for multi-core computers
• scientific article; zbMATH DE number 1424306
• Optimal randomized parallel algorithms for computational geometry
• Parallelism in randomized incremental algorithms

Cites work

• scientific article; zbMATH DE number 177830 (Why is no real title available?)
• scientific article; zbMATH DE number 1368469 (Why is no real title available?)
• A New Convex Hull Algorithm for Planar Sets
• Applications of random sampling in computational geometry. II
• Convex hull of a finite set of points in two dimensions
• The complexity of incremental convex hull algorithms in \(R^ d\)
• The quickhull algorithm for convex hulls

Cited in

(6)

• Parallel geometric algorithms for multi-core computers
• Parallel geometric algorithms for multi-core computers
• Multi-pass geometric algorithms
• Practical Mixed-Integer Optimization for Geometry Processing
• Empirical evaluation of the parallel distribution sweeping framework on multicore architectures
• The Design of Core 2: A Library for Exact Numeric Computation in Geometry and Algebra

Describes a project that uses

Uses Software

• MCSTL
• Qhull
• LEDA
• CGAL

This page was built for publication: Multi-core Implementations of Geometric Algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3644727)