Sciweavers

9 search results - page 1 / 2
» Cost-Optimal Trees for Ray Shooting
Sort
View
LATIN
2004
Springer
14 years 2 months ago
Cost-Optimal Trees for Ray Shooting
Predicting and optimizing the performance of ray shooting is a very important problem in computer graphics due to the severe computational demands of ray tracing and other applicat...
Hervé Brönnimann, Marc Glisse
COMPGEOM
2003
ACM
14 years 2 months ago
Cost-driven octree construction schemes: an experimental study
Given a scene consisting of objects, ray shooting queries answer with the first object encountered by a given ray, and are used in ray tracing and radiosity for rendering photo-r...
Boris Aronov, Hervé Brönnimann, Allen ...
COMGEO
2002
ACM
13 years 9 months ago
Quadtree, ray shooting and approximate minimum weight Steiner triangulation
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 ...
Siu-Wing Cheng, Kam-Hing Lee
COMGEO
2006
ACM
13 years 9 months ago
Octrees with near optimal cost for ray-shooting
Predicting and optimizing the performance of ray shooting is a very important problem in computer graphics due to the severe computational demands of ray tracing and other applica...
Hervé Brönnimann, Marc Glisse
PAAPP
1998
149views more  PAAPP 1998»
13 years 9 months ago
Optimal Mesh Algorithms for Proximity and Visibility Problems in Simple Polygons*
We present optimal parallel algorithms that run in O( pn) time on a pn pn meshconnected computer for a number of fundamental problems concerning proximity and visibility in a simp...
Sumanta Guha