102291 search results - page 197 / 20459 » Computability in Computational Geometry |
137
click to vote
CGF
2002
15 years 6 months ago
2002
BSP trees and KD trees are fundamental data structures for collision detection in walkthrough environments. A basic issue in the construction of these hierarchical data structures...
200
click to vote
CGF
2011
14 years 9 months ago
2011
Recently, the problem of intrinsic shape matching has received a lot of attention. A number of algorithms have been proposed, among which random-sampling-based techniques have bee...
149
click to vote
ESA
2001
Springer
15 years 10 months ago
2001
Springer
Computing the Delaunay triangulation of n points requires usually a minimum of (n log n) operations, but in some special cases where some additional knowledge is provided, faster a...
212
click to vote
CGF
2010
15 years 3 months ago
2010
Mean shift is a popular approach for data clustering, however, the high computational complexity of the mean shift procedure limits its practical applications in high dimensional ...
125
click to vote
IMAMS
2003
15 years 7 months ago
2003
We define a parameterization for an n-holed tori based on the hyperbolic polygon. We model the domain using a manifold with 2n+ 2 charts, and linear fractional transformations for...