Sciweavers

28 search results - page 6 / 6
» Query-Sensitive Ray Shooting
Sort
View
COMPGEOM
2010
ACM
13 years 11 months ago
Optimal partition trees
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
Timothy M. Chan
COMPGEOM
1994
ACM
13 years 10 months ago
Computing Envelopes in Four Dimensions with Applications
Let F be a collection of n d-variate, possibly partially defined, functions, all algebraic of some constant maximum degree. We present a randomized algorithm that computes the vert...
Pankaj K. Agarwal, Boris Aronov, Micha Sharir
CGF
2000
174views more  CGF 2000»
13 years 5 months ago
Multiresolution shape deformations for meshes with dynamic vertex connectivity
Multiresolution shape representation is a very effective way to decompose surface geometry into several levels of detail. Geometric modeling with such representations enables flex...
Leif Kobbelt, Thilo Bareuther, Hans-Peter Seidel