Sciweavers

25 search results - page 5 / 5
» Guarding galleries and terrains
Sort
View
ALENEX
2007
130views Algorithms» more  ALENEX 2007»
13 years 7 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
COMPGEOM
2007
ACM
13 years 9 months ago
Guard placement for efficient point-in-polygon proofs
We consider the problem of placing a small number of angle guards inside a simple polygon P so as to provide efficient proofs that any given point is inside P. Each angle guard vi...
David Eppstein, Michael T. Goodrich, Nodari Sitchi...
IROS
2008
IEEE
129views Robotics» more  IROS 2008»
14 years 5 days ago
Near-optimal navigation of high speed mobile robots on uneven terrain
—This paper proposes a method for near-optimal navigation of high speed mobile robots on uneven terrain. The method relies on a layered control strategy. A high-level planning la...
Karl Iagnemma, Shingo Shimoda, Zvi Shiller
FCT
2003
Springer
13 years 11 months ago
On Boundaries of Highly Visible Spaces and Applications
The purpose of this paper is to investigate the properties of a certain class of highly visible spaces. For a given geometric space C containing obstacles specified by disjoint s...
John H. Reif, Zheng Sun
PG
1999
IEEE
13 years 10 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...