OPTIMAL MESH ALGORITHMS FOR PROXIMITY AND VISIBILITY PROBLEMS IN SIMPLE POLYGONS*

DOI10.1080/01495739808947366zbMATH Open0915.68163OpenAlexW2082318545MaRDI QIDQ4226503FDOQ4226503

Authors: Sumanta Guha 

Publication date: 28 June 1999

Published in: Parallel Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01495739808947366

Recommendations

• Solving visibility and separability problems on a mesh-of-processors
• Parallel methods for visibility and shortest-path problems in simple polygons
• Parallel algorithms for shortest path problems in polygons
• An optimal parallel algorithm for the visibility of a simple polygon from a point

zbMATH Keywords

optimal parallel algorithms

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distributed algorithms (68W15)

Cited In (6)

• Visibility in proximal Delaunay meshes and strongly near Wallman proximity
• Parallel methods for visibility and shortest-path problems in simple polygons
• Efficient visibility criterion for discontinuities discretised by triangular surface meshes
• Constant-time convexity problems on reconfigurable meshes
• Optimal parallel algorithms for proximate points, with applications (extended abstract)
• Convexity problems on meshes with multiple broadcasting

This page was built for publication: OPTIMAL MESH ALGORITHMS FOR PROXIMITY AND VISIBILITY PROBLEMS IN SIMPLE POLYGONS*

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