Sciweavers

22 search results - page 2 / 5
» Reliable Algorithms for Ray Intersection in Computer Graphic...
Sort
View
COMPUTING
2006
102views more  COMPUTING 2006»
13 years 5 months ago
A Reliable Area Reduction Technique for Solving Circle Packing Problems
Abstract We are dealing with the optimal, i.e. densest packings of congruent circles into the unit square. In the recent years we have built a numerically reliable, verified method...
Mihály Csaba Markót, Tibor Csendes
CGI
2006
IEEE
13 years 11 months ago
Improving the Interval Ray Tracing of Implicit Surfaces
This paper presents a fast and reliable method to trim non-solution regions in an interval ray tracing process. The “trimming algorithm” uses interval analysis to perform rejec...
Jorge Flórez, Mateu Sbert, Miguel Án...
EUROGRAPHICS
2010
Eurographics
14 years 1 months ago
Fast Ray Sorting and Breadth-First Packet Traversal for GPU Ray Tracing
We present a novel approach to ray tracing execution on commodity graphics hardware using CUDA. We decompose a standard ray tracing algorithm into several data-parallel stages tha...
Kirill Garanzha and Charles Loop
JGTOOLS
2007
144views more  JGTOOLS 2007»
13 years 5 months ago
Faster Relief Mapping using the Secant Method
Relief mapping using the secant method offers an efficient method for adding per pixel height field based displacement to an arbitrary polygonal mesh in real time. The technique...
Eric Risser, Musawir Shah, Sumanta N. Pattanaik
SIGGRAPH
1992
ACM
13 years 9 months ago
Interval analysis for computer graphics
This paper discusses how interval analysis can be used to solve a wide variety of problems in computer graphics. These problems include ray tracing, interference detection, polygo...
John M. Snyder