148
Voted
PAAPP
1998
15 years 3 months ago
1998
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...
120
click to vote
ISAAC
1998
Springer
15 years 7 months ago
1998
Springer
Abstract. In this paper we explore some novel aspects of visibility for stationary and moving points inside a simple polygon