60 search results - page 7 / 12 » Query point visibility computation in polygons with holes |
133
Voted
TOG
2008
15 years 10 days ago
2008
We present a method for interactive computation of indirect illumination in large and fully dynamic scenes based on approximate visibility queries. While the high-frequency nature...
JCDCG
2004
Springer
15 years 5 months ago
2004
Springer
In this paper we discuss farthest-point problems in which a set or sequence S of n points in the plane is given in advance and can be preprocessed to answer various queries efficie...
90
Voted
ICRA
2003
IEEE
15 years 5 months ago
2003
IEEE
— We present an O(n log1+ε n)-time algorithm for computing the optimal robot motion that maintains lineof-sight visibility between a target moving inside a polygon with n vertic...
148
Voted
COMGEO
2002
ACM
15 years 8 days ago
2002
ACM
We present a quadtree-based decomposition of the interior of a polygon with holes. The complete decomposition yields a constant factor approximation of the minimum weight Steiner ...
85
Voted
CGF
2000
15 years 8 days ago
2000
We present a technique for accelerating the rendering of high depth-complexity scenes. In a preprocessing stage, we approximate the input model with a hierarchical data structure ...