35 search results - page 4 / 7 » Computing contour trees in all dimensions |
WG
1995
Springer
14 years 1 months ago
1995
Springer
We propose an O(n4) algorithm to build the modular decomposition tree of hypergraphs of dimension 3 and show how this algorithm can be generalized to compute in O(n3k−5) time th...
COMPGEOM
2010
ACM
14 years 2 months ago
2010
ACM
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...
SCALESPACE
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. Concepts from elasticity are applied to analyze modes of variation on shapes in two and three dimensions. This approach represents a physically motivated alternative to s...
CVPR
1998
IEEE
14 years 11 months ago
1998
IEEE
A method is presented for e cient and reliable object recognition within noisy, cluttered, and occluded range images. The method is based on a strategy which hypothesizes the inte...
UAI
1997
13 years 11 months ago
1997
We consider probabilistic inference in general hybrid networks, which include continuous and discrete variables in an arbitrary topology. We reexamine the question of variable dis...