Robust algorithms for constructing strongly convex hulls in parallel.

DOI10.1016/S0304-3975(01)00274-2MaRDI QIDQ1853528zbMATH OpenFDO

Authors Wei Chen, Koichi Wada, Kimio Kawaguchi

Publication date 21 January 2003

Published in Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

Computational geometryConvex hullRobust algorithmsPRAM computational model

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Parallel algorithms in computer science (68W10)

Recommendations

• Finding the Convex Hull of Discs in Parallel
• Constructing strongly convex hulls using exact or rounded arithmetic
• Efficient parallel convex hull algorithms
• Fast randomized parallel methods for planar convex hull construction
• A sublogarithmic convex hull algorithm

Cites work

• scientific article; zbMATH DE number 4078610 (Why is no real title available?)
• scientific article; zbMATH DE number 43583 (Why is no real title available?)
• Constructing strongly convex approximate hulls with inaccurate primitives
• Constructing strongly convex hulls using exact or rounded arithmetic
• Parallel computational geometry
• Verifiable implementations of geometric algorithms using finite precision arithmetic

Cited in

(3)

• Constructing strongly convex hulls using exact or rounded arithmetic
• CONSTRUCTING A STRONGLY CONVEX SUPERHULL OF POINTS
• Convex hull properties and algorithms

This page was built for publication: Robust algorithms for constructing strongly convex hulls in parallel.

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