Publication:4779120
From MaRDI portal
zbMath1005.68558MaRDI QIDQ4779120
Binay K. Bhattacharya, Giri Narasimhan, Asish Kumar Mukhopadhyay
Publication date: 24 November 2002
Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
A Linear-Time Algorithm for Finding All Door Locations That Make a Room Searchable, Optimum sweeps of simple polygons with two guards, Minimization of the maximum distance between the two guards patrolling a polygonal region, Characterizing and recognizing LR-visibility polygons, A unified and efficient solution to the room search problem, An efficient algorithm for the three-guard problem, Partially Walking a Polygon, Partially walking a polygon