60 search results - page 9 / 12 » Query point visibility computation in polygons with holes |
COMGEO
2006
ACM
13 years 7 months ago
2006
ACM
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
SWAT
2000
Springer
13 years 11 months ago
2000
Springer
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...
CGF
2010
13 years 7 months ago
2010
Area lights add tremendous realism, but rendering them interactively proves challenging. Integrating visibility is costly, even with current shadowing techniques, and existing met...
ICRA
2000
IEEE
13 years 12 months ago
2000
IEEE
We present techniques for fast motion planning by using discrete approximations of generalized Voronoi diagrams, computed with graphics hardware. Approaches based on this diagram ...
RT
2001
Springer
13 years 12 months ago
2001
Springer
We present a new conservative image-based occlusion culling method to increase the speed of hardware accelerated rendering of very complex general scenes which may consist of mill...