Sciweavers

3 search results - page 1 / 1
» Locating Guards for Visibility Coverage of Polygons
Sort
View
ALENEX
2007
130views Algorithms» more  ALENEX 2007»
13 years 8 months ago
Locating Guards for Visibility Coverage of Polygons
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 ...
Yoav Amit, Joseph S. B. Mitchell, Eli Packer
IJCGA
2010
99views more  IJCGA 2010»
13 years 5 months ago
Finding All Door Locations that Make a Room Searchable
—A room is a simple polygon with a prespecified point, called the door, on its boundary. Search may be conducted by two guards on the boundary who keep mutual visibility at all ...
Tsunehiko Kameda, John Z. Zhang
PG
1999
IEEE
13 years 11 months ago
Automatic Camera Placement for Image-Based Modeling
We present an automatic camera placement method for generating image-based models from scenes with known geometry. Our method first approximately determines the set of surfaces vi...
Shachar Fleishman, Daniel Cohen-Or, Dani Lischinsk...