scientific article; zbMATH DE number 1256697

MaRDI QIDQ4228433zbMATH OpenFDO

Authors Hubert Wagener

Publication date 20 January 2002

zbMATH Keywords

optimal parallel algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distributed algorithms (68W15)

Recommendations

• A sublogarithmic convex hull algorithm
• Optimal, output-sensitive algorithms for constructing planar hulls in parallel
• A FAST PARALLEL ALGORITHM FOR FINDING THE CONVEX HULL OF A SORTED POINT SET
• scientific article; zbMATH DE number 4050997

Cited in

(11)

• Optimal, output-sensitive algorithms for constructing planar hulls in parallel
• \(O(\log \log n)\)-time integer geometry on the CRCW PRAM
• Sweep methods for parallel computational geometry
• scientific article; zbMATH DE number 4050997 (Why is no real title available?)
• An optimal parallel algorithm for the visibility of a simple polygon from a point
• Optimal parallel hypercube algorithms for polygon problems
• scientific article; zbMATH DE number 753970 (Why is no real title available?)
• A FAST PARALLEL ALGORITHM FOR FINDING THE CONVEX HULL OF A SORTED POINT SET
• An O(log log n) algorithm to compute the kernel of a polygon
• Algorithms for subpath convex hull queries and ray-shooting among segments
• Testing a simple polygon for monotonicity optimally in parallel

This page was built for publication:

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