Sciweavers

42 search results - page 3 / 9
» Computing the visibility map of fat objects
Sort
View
COMGEO
2006
ACM
13 years 6 months ago
Computing homotopic shortest paths efficiently
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...
Alon Efrat, Stephen G. Kobourov, Anna Lubiw
SIGGRAPH
1993
ACM
13 years 10 months ago
Smooth transitions between bump rendering algorithms
A method is describedfor switching smoothly between rendering algorithms as required by the amount of visible surface detail. The result will be more realism with less computation...
Barry G. Becker, Nelson L. Max
SIGGRAPH
2000
ACM
13 years 10 months ago
Deep shadow maps
We introduce deep shadow maps, a technique that produces fast, high-quality shadows for primitives such as hair, fur, and smoke. Unlike traditional shadow maps, which store a sing...
Tom Lokovic, Eric Veach
ICPR
2002
IEEE
14 years 7 months ago
Robust Appearance-Based Object Recognition Using a Fully Connected Markov Random Field
This paper presents a new kernel method for appearance-based object recognition, highly robust to noise and occlusion. It consists of a fully connected Markov Random Field that in...
Barbara Caputo, Sahla Bouattour, Heinrich Niemann
RT
2004
Springer
13 years 11 months ago
Generalized Displacement Maps
In this paper, we introduce a real-time algorithm to render the rich visual effects of general non-height-field geometric details, known as mesostructure. Our method is based on ...
Xi Wang, Xin Tong, Stephen Lin, Shi-Min Hu, Bainin...