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...
In this paper, we propose a new method that can consistently orient all normals of any mesh (if at all possible), while ensuring that most polygons are seen with their front-faces...
Many problems in computer graphics and computer vision require accurate global visibility information. Previous approaches have typically been complicated to implement and numeric...
We study the problem of computing the visibility graph defined by a set P of n points inside a polygon Q: two points p, q ∈ P are joined by an edge if the segment pq ⊂ Q. Ef...
Boaz Ben-Moshe, Olaf Hall-Holt, Matthew J. Katz, J...
A room is a simple polygon with a prespecified point, called the door, on its boundary. A search starts at the door and must detect any intruder that may be in the room, while maki...
Binay K. Bhattacharya, John Z. Zhang, Qiaosheng Sh...