Optimal parallel algorithms for proximate points, with applications

DOI10.1007/3-540-63307-3_62zbMath1497.68531OpenAlexW1568987073MaRDI QIDQ5096941

Koji Nakano, Stephan Olariu, Tatsuya Hayashi

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

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

Cites Work

• Unnamed Item
• An optimal parallel algorithm for the Euclidean distance maps of 2-D binary images
• Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
• Parallelism in Comparison Problems
• A FAST PARALLEL ALGORITHM FOR FINDING THE CONVEX HULL OF A SORTED POINT SET

This page was built for publication: Optimal parallel algorithms for proximate points, with applications