60 search results - page 3 / 12 » Query point visibility computation in polygons with holes |
AAAI
2007
13 years 9 months ago
2007
We consider problems of geometric exploration and selfdeployment for simple robots that can only sense the combinatorial (non-metric) features of their surroundings. Even with suc...
SIGGRAPH
1997
ACM
13 years 11 months ago
1997
ACM
Many problems in computer graphics and computer vision require accurate global visibility information. Previous approaches have typically been complicated to implement and numeric...
RT
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. Methods for exact computation of irradiance and form factors associated with polygonal objects have ultimately relied on a formula for a differential area to polygon form...
SODA
2004
ACM
13 years 9 months ago
2004
ACM
We present a near-quadratic time algorithm that computes a point inside a simple polygon P having approximately the largest visibility polygon inside P, and a nearlinear time algo...
CCCG
2007
13 years 9 months ago
2007
In this paper, we introduce a generalized version of the Watchman Route Problem (WRP) where the objective is to plan a continuous closed route in a polygon (possibly with holes) a...