Optimal parallel algorithms for proximate points, with applications (extended abstract)

DOI10.1007/3-540-63307-3_62MaRDI QIDQ5096941zbMATH OpenOpenAlexFDO

Authors Tatsuya Hayashi, Koji Nakano, Stephan Olariu

Publication date 19 August 2022

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

Full work available at URL https://doi.org/10.1007/3-540-63307-3_62

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10) Analysis of algorithms (68W40)

Recommendations

• Optimal parallel algorithms for point-set and polygon problems
• Publication:4828970
• Proximate point searching
• Parallel computational geometry
• OPTIMAL MESH ALGORITHMS FOR PROXIMITY AND VISIBILITY PROBLEMS IN SIMPLE POLYGONS*

Cites work

• A FAST PARALLEL ALGORITHM FOR FINDING THE CONVEX HULL OF A SORTED POINT SET
• An optimal parallel algorithm for the Euclidean distance maps of 2-D binary images
• scientific article; zbMATH DE number 107951 (Why is no real title available?)
• Parallelism in Comparison Problems
• Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes

Cited in

(3)

• A parallel algorithm for approximate regularity.
• Efficient Farthest-Point Queries in Two-terminal Series-parallel Networks
• scientific article; zbMATH DE number 1530366 (Why is no real title available?)

This page was built for publication: Optimal parallel algorithms for proximate points, with applications (extended abstract)

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