Sciweavers

2880 search results - page 304 / 576
» Approximate Range Searching
Sort
View
142
Voted
SIGGRAPH
1992
ACM
15 years 7 months ago
Surface reconstruction from unorganized points
We describe and demonstrate an algorithm that takes as input an unorganized set of points fx1; : : : ; xng IR3 on or near an unknown manifold M, and produces as output a simplicia...
Hugues Hoppe, Tony DeRose, Tom Duchamp, John Alan ...
159
Voted
ESA
2006
Springer
139views Algorithms» more  ESA 2006»
15 years 7 months ago
Stochastic Shortest Paths Via Quasi-convex Maximization
Abstract. We consider the problem of finding shortest paths in a graph with independent randomly distributed edge lengths. Our goal is to maximize the probability that the path len...
Evdokia Nikolova, Jonathan A. Kelner, Matthew Bran...
131
Voted
VISUALIZATION
1995
IEEE
15 years 7 months ago
Interactive Maximum Projection Volume Rendering
Maximum projection is a volume rendering technique that, for each pixel, finds the maximum intensity along a projector. For certain important classes of data, this is an approxim...
Michael D. McCool, Wolfgang Heidrich, John Stevens
114
Voted
BMVC
2002
15 years 6 months ago
g-HDAF Multiresolution Deformable Models for Shape Modeling and Reconstruction
In this paper, we construct a new class of deformable models using new biorthogonal wavelets, named Generalized Hermite Distributed Approximating Functional (g-HDAF) Wavelets. The...
Ioannis A. Kakadiaris, Emmanuel Papadakis, Lixin S...
147
Voted
CCCG
2010
15 years 5 months ago
Connected dominating sets on dynamic geometric graphs
We propose algorithms for efficiently maintaining a constant-approximate minimum connected dominating set (MCDS) of a geometric graph under node insertions and deletions. Assuming...
Leonidas J. Guibas, Nikola Milosavljevic, Arik Mot...