Sciweavers

833 search results - page 106 / 167
» Geometric Optimization
Sort
View
SODA
1998
ACM
113views Algorithms» more  SODA 1998»
13 years 10 months ago
Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs
We develop data structures for dynamic closest pair problems with arbitrary (not necessarily geometric) distance functions, based on a technique previously used by the author for ...
David Eppstein
CGF
2008
118views more  CGF 2008»
13 years 9 months ago
Manifold-valued Thin-Plate Splines with Applications in Computer Graphics
We present a generalization of thin-plate splines for interpolation and approximation of manifold-valued data, and demonstrate its usefulness in computer graphics with several app...
Florian Steinke, Matthias Hein, Jan Peters, Bernha...
DM
2008
87views more  DM 2008»
13 years 9 months ago
More on pooling spaces
A pooling space is a ranked poset P such that the subposet w+ induced by the elements above w is atomic for each element w of P. Pooling spaces were introduced in [Discrete Mathem...
Hau-wen Huang, Yu-pei Huang, Chih-wen Weng
CG
2007
Springer
13 years 8 months ago
Multiresolution for curves and surfaces based on constraining wavelets
We present a novel method for determining local multiresolution filters for a broad range of subdivision schemes. Our approach is based on constraining the wavelet coefficients s...
Luke Olsen, Faramarz F. Samavati, Richard H. Barte...
JGTOOLS
2008
100views more  JGTOOLS 2008»
13 years 8 months ago
Proximity Cluster Trees
Hierarchical spatial data structures provide a means for organizing data for efficient processing. Most spatial data structures are optimized for performing queries, such as inters...
Elena Jakubiak Hutchinson, Sarah F. Frisken, Ronal...