60 search results - page 5 / 12 » Query point visibility computation in polygons with holes |
103
Voted
CCCG
2009
15 years 1 months ago
2009
We study a maximum flow problem in a polygonal domain P: Determine the maximum number of disjoint "thick" paths (of specified width w) through P from a source edge to a ...
112
Voted
SSD
2001
Springer
15 years 4 months ago
2001
Springer
Recently there is much interest in moving objects databases, and data models and query languages have been proposed offering data types such as moving point and moving region toge...
87
Voted
ALENEX
2004
15 years 1 months ago
2004
Given a terrain T and a point p on or above it, we wish to compute the region Rp that is visible from p. We present a generic radar-like algorithm for computing an approximation o...
119
Voted
SIGGRAPH
1993
ACM
15 years 4 months ago
1993
ACM
The most expensive geometric operation in image synthesis is visibility determination. Classically this is solved with hidden surface removal algorithms that render only the parts...
113
click to vote
FOCS
2000
IEEE
15 years 4 months ago
2000
IEEE
We consider the planar point location problem from the perspective of expected search time. We are given a planar polygonal subdivision S and for each polygon of the subdivision t...