Sciweavers

361 search results - page 69 / 73
» Progressive geometry compression
Sort
View
SIGGRAPH
1993
ACM
14 years 1 months ago
Global visibility algorithms for illumination computations
The most expensive geometric operation in image synthesis is visibility determination. Classically this is solved with hidden surface removal algorithms that render only the parts...
Seth J. Teller, Pat Hanrahan
SIGMOD
1994
ACM
106views Database» more  SIGMOD 1994»
14 years 1 months ago
Multi-Step Processing of Spatial Joins
Spatial joins are one of the most important operations for combining spatial objects of several relations. In this paper, spatial join processing is studied in detail for extended...
Thomas Brinkhoff, Hans-Peter Kriegel, Ralf Schneid...
BCS
2008
13 years 11 months ago
Beatbox - A Computer Simulation Environment for Computational Biology of the Heart
Despite over a century's study, the trigger mechanisms of cardiac arrhythmias are poorly understood. Even modern experimental methods do not provide sufficient temporal and s...
Ross McFarlane, Irina V. Biktasheva
SGP
2003
13 years 11 months ago
Provably Good Surface Sampling and Approximation
We present an algorithm for meshing surfaces that is a simple adaptation of a greedy “farthest point” technique proposed by Chew. Given a surface S, it progressively adds poin...
Steve Oudot, Jean-Daniel Boissonnat
NIPS
2000
13 years 11 months ago
The Use of MDL to Select among Computational Models of Cognition
How should we decide among competing explanations of a cognitive process given limited observations? The problem of model selection is at the heart of progress in cognitive scienc...
In Jae Myung, Mark A. Pitt, Shaobo Zhang, Vijay Ba...