60 search results - page 4 / 12 » Query point visibility computation in polygons with holes |
ALENEX
2007
13 years 9 months ago
2007
We propose heuristics for visibility coverage of a polygon with the fewest point guards. This optimal coverage problem, often called the “art gallery problem”, is known to be ...
CG
2005
Springer
13 years 7 months ago
2005
Springer
A new algorithm for Boolean operations on general planar polygons is presented. It is available for general planar polygons (manifold or non-manifold, with or without holes). Edge...
VISUALIZATION
2000
IEEE
13 years 11 months ago
2000
IEEE
We present an algorithm for automatically classifying the interior and exterior parts of a polygonal model. The need for visualizing the interiors of objects frequently arises in ...
WALCOM
2007
IEEE
13 years 8 months ago
2007
IEEE
Abstract. Computing visible information, such as a visible surface determination, is a significant problem and has been mainly studied in the fields of computational geometry and...
COMPGEOM
1999
ACM
13 years 12 months ago
1999
ACM
We show a remarkable fact about folding paper: From a single rectangular sheet of paper, one can fold it into a flat origami that takes the (scaled) shape of any connected polygo...