Sciweavers

PAAPP
1998
149views more  PAAPP 1998»
13 years 6 months ago
Optimal Mesh Algorithms for Proximity and Visibility Problems in Simple Polygons*
We present optimal parallel algorithms that run in O( pn) time on a pn pn meshconnected computer for a number of fundamental problems concerning proximity and visibility in a simp...
Sumanta Guha
ISAAC
1998
Springer
81views Algorithms» more  ISAAC 1998»
13 years 11 months ago
Visibility Queries in Simple Polygons and Applications
Abstract. In this paper we explore some novel aspects of visibility for stationary and moving points inside a simple polygon
Boris Aronov, Leonidas J. Guibas, Marek Teichmann,...