Scalable algorithms for bichromatic line segment intersection problems on Coarse Grained Multicomputers

DOI10.1007/3-540-57155-8_255zbMath1504.68281OpenAlexW1479896559MaRDI QIDQ5060120

Olivier Devillers, Andreas Fabri

Publication date: 18 January 2023

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

Full work available at URL: https://doi.org/10.1007/3-540-57155-8_255

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parallel methods for visibility and shortest-path problems in simple polygons

This page was built for publication: Scalable algorithms for bichromatic line segment intersection problems on Coarse Grained Multicomputers