Sciweavers

28 search results - page 1 / 6
» Query-Sensitive Ray Shooting
Sort
View
78
Voted
COMPGEOM
1994
ACM
15 years 2 months ago
Query-Sensitive Ray Shooting
Ray (segment) shooting is the problem of determining the first intersection between a ray (directed line segment) and a collection of polygonal or polyhedral obstacles. In order t...
Joseph S. B. Mitchell, David M. Mount, Subhash Sur...
112
Voted
ESA
2011
Springer
252views Algorithms» more  ESA 2011»
13 years 10 months ago
Ray-Shooting Depth: Computing Statistical Data Depth of Point Sets in the Plane
Over the past several decades, many combinatorial measures have been devised for capturing the statistical data depth of a set of n points in R2 . These include Tukey depth [15], O...
Nabil H. Mustafa, Saurabh Ray, Mudassir Shabbir
87
Voted
WSCG
2004
142views more  WSCG 2004»
14 years 11 months ago
Metropolis Iteration for Global Illumination
This paper presents a stochastic iteration algorithm solving the global illumination problem, where the random sampling is governed by classical importance sampling and also by th...
László Szirmay-Kalos, Bálazs ...
104
Voted
COMPGEOM
2003
ACM
15 years 3 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 ...
86
Voted
CGF
2000
95views more  CGF 2000»
14 years 10 months ago
LCTS: Ray Shooting using Longest Common Traversal Sequences
We describe two new techniques of ray shooting acceleration that exploit the traversal coherence of a spatial hierarchy. The first technique determines a sequence of adjacent leaf
Vlastimil Havran, Jirí Bittner