Sciweavers

41 search results - page 1 / 9
» Efficient Approximate Visibility Query in Large Dynamic Envi...
Sort
View
DASFAA
2010
IEEE
129views Database» more  DASFAA 2010»
13 years 9 months ago
Efficient Approximate Visibility Query in Large Dynamic Environments
Abstract. Visibility query is fundamental to many analysis and decisionmaking tasks in virtual environments. Visibility computation is time complex and the complexity escalates in ...
Leyla Kazemi, Farnoush Banaei Kashani, Cyrus Shaha...
ICVGIP
2008
13 years 6 months ago
Visibility Cuts: A System for Rendering Dynamic Virtual Environments
In recent years, the subject of occlusion culling of large 3D environments has received substantial contribution. However the major amount of research into the area has focussed o...
Soumyajit Deb, Ankit Gupta
TOG
2008
163views more  TOG 2008»
13 years 4 months ago
Imperfect shadow maps for efficient computation of indirect illumination
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...
Tobias Ritschel, Thorsten Grosch, Min H. Kim, Hans...
ICDE
2008
IEEE
190views Database» more  ICDE 2008»
14 years 5 months ago
Efficient Query Processing in Large Traffic Networks
Abstract-- We present an original graph embedding to speedup distance-range and k-nearest neighbor queries on static and/or dynamic objects located on a (weighted) graph. Our metho...
Hans-Peter Kriegel, Matthias Renz, Peer Kröge...
ICDE
2006
IEEE
192views Database» more  ICDE 2006»
14 years 5 months ago
Approximating Aggregation Queries in Peer-to-Peer Networks
Peer-to-peer databases are becoming prevalent on the Internet for distribution and sharing of documents, applications, and other digital media. The problem of answering large scal...
Benjamin Arai, Gautam Das, Dimitrios Gunopulos, Va...