Results 1 - 10
of
18
A search engine for 3d models
- ACM Transactions on Graphics
, 2003
"... As the number of 3D models available on the Web grows, there is an increasing need for a search engine to help people find them. Unfortunately, traditional text-based search techniques are not always effective for 3D data. In this paper, we investigate new shape-based search methods. The key challen ..."
Abstract
-
Cited by 164 (20 self)
- Add to MetaCart
As the number of 3D models available on the Web grows, there is an increasing need for a search engine to help people find them. Unfortunately, traditional text-based search techniques are not always effective for 3D data. In this paper, we investigate new shape-based search methods. The key challenges are to develop query methods simple enough for novice users and matching algorithms robust enough to work for arbitrary polygonal models. We present a web-based search engine system that supports queries based on 3D sketches, 2D sketches, 3D
Shape Distributions
- ACM Transactions on Graphics
, 2002
"... this paper, we propose and analyze a method for computing shape signatures for arbitrary (possibly degenerate) 3D polygonal models. The key idea is to represent the signature of an object as a shape distribution sampled from a shape function measuring global geometric properties of an object. The pr ..."
Abstract
-
Cited by 117 (0 self)
- Add to MetaCart
this paper, we propose and analyze a method for computing shape signatures for arbitrary (possibly degenerate) 3D polygonal models. The key idea is to represent the signature of an object as a shape distribution sampled from a shape function measuring global geometric properties of an object. The primary motivation for this approach is to reduce the shape matching problem to the comparison of probability distributions, which is simpler than traditional shape matching methods that require pose registration, feature correspondence, or model fitting
Morse-Smale Complexes for Piecewise Linear 3-Manifolds
, 2003
"... We define the Morse-Smale complex of a Morse function over a 3-manifold as the overlay of the descending and ascending manifolds of all critical points. In the generic case, its 3-dimensional cells are shaped like crystals and are separated by quadrangular faces. In this paper, we give a combinatori ..."
Abstract
-
Cited by 75 (25 self)
- Add to MetaCart
We define the Morse-Smale complex of a Morse function over a 3-manifold as the overlay of the descending and ascending manifolds of all critical points. In the generic case, its 3-dimensional cells are shaped like crystals and are separated by quadrangular faces. In this paper, we give a combinatorial algorithm for constructing such complexes for piecewise linear data.
Multiscale deformable model segmentation and statistical shape analysis using medial descriptions
- TRANSACTIONS ON MEDICAL IMAGING
, 2002
"... This paper presents a multiscale framework based on a medial representation for the segmentation and shape characterization of anatomical objects in medical imagery. The segmentation procedure is based on a Bayesian deformable templates methodology in which the prior information about the geometry a ..."
Abstract
-
Cited by 33 (12 self)
- Add to MetaCart
This paper presents a multiscale framework based on a medial representation for the segmentation and shape characterization of anatomical objects in medical imagery. The segmentation procedure is based on a Bayesian deformable templates methodology in which the prior information about the geometry and shape of anatomical objects is incorporated via the construction of exemplary templates. The anatomical variability is accommodated in the Bayesian framework by defining probabilistic transformations on these templates. The transformations, thus, defined are parameterized directly in terms of natural shape operations, such as growth and bending, and their locations. A preliminary validation study of the segmentation procedure is presented. We also present a novel statistical shape analysis approach based on the medial descriptions that examines shape via separate intuitive categories, such as global variability at the coarse scale and localized variability at the fine scale. We show that the method can be used to statistically describe shape variability in intuitive terms such as growing and bending.
A Reflective Symmetry Descriptor
- European Conference on Computer Vision (ECCV
, 2002
"... Computing reflective symmetries of 2D and 3D shapes is a classical problem in computer vision and computational geometry. Most prior work has focused on finding the main axes of symmetry, or determining that none exists. ..."
Abstract
-
Cited by 28 (6 self)
- Add to MetaCart
Computing reflective symmetries of 2D and 3D shapes is a classical problem in computer vision and computational geometry. Most prior work has focused on finding the main axes of symmetry, or determining that none exists.
Approximating the Medial Axis from the Voronoi Diagram with a Convergence Guarantee
- Algorithmica
, 2004
"... The medial axis of a surface in 3D is the closure of all points that have two or more closest points on the surface. It is an essential geometric structure in a number of applications involving 3D geometric shapes. Since exact computation of the medial axis is difficult in general, efforts continue ..."
Abstract
-
Cited by 26 (6 self)
- Add to MetaCart
The medial axis of a surface in 3D is the closure of all points that have two or more closest points on the surface. It is an essential geometric structure in a number of applications involving 3D geometric shapes. Since exact computation of the medial axis is difficult in general, efforts continue to improve their approximations. Voronoi diagrams turn out to be useful for this approximation. Although it is known that Voronoi vertices for a sample of points from a curve in 2D approximate its medial axis, similar result does not hold in 3D. Recently, it has been discovered that only a subset of Voronoi vertices converge to the medial axis as sample density approaches infinity. However, most applications need a non-discrete approximation as opposed to a discrete one. To date no known algorithm can compute this approximation straight from the Voronoi diagram with a guarantee of convergence. We present such an algorithm and its convergence analysis in this paper. One salient feature of the algorithm is that it is scale and density independent. Experimental results corroborate our theoretical claims.
Computing Voronoi skeletons of a 3-D polyhedron by space subdivision
- COMPUTATIONAL GEOMETRY: THEORY AND APPLICATIONS
, 2002
"... ..."
Free-form Skeleton-driven Mesh Deformations
, 2003
"... In this paper, we propose a new scheme for free-form skeleton-driven global mesh deformations. First a Voronoi-based skeletal mesh is extracted from a given original mesh. Next the skeletal mesh is modified by free-form deformations. Then a desired global shape deformation is obtained by reconstruct ..."
Abstract
-
Cited by 15 (1 self)
- Add to MetaCart
In this paper, we propose a new scheme for free-form skeleton-driven global mesh deformations. First a Voronoi-based skeletal mesh is extracted from a given original mesh. Next the skeletal mesh is modified by free-form deformations. Then a desired global shape deformation is obtained by reconstructing the shape corresponding to the deformed skeletal mesh. We develop a mesh fairing procedure allowing us to avoid possible global and local self-intersections of the reconstructed mesh. Finally, using DSS [16] shape representation improves the speed and robustness of our approach.
Continuous medial representations for geometric object modeling
- in 2D and 3D”, Image and Vision Computing
, 2003
"... We describe a novel continuous medial representation for object geometry and a deformable templates method for fitting the representation to images. Our representation simultaneously describes the boundary and medial loci of geometrical objects, always maintaining Blum’s symmetric axis transform (SA ..."
Abstract
-
Cited by 10 (5 self)
- Add to MetaCart
We describe a novel continuous medial representation for object geometry and a deformable templates method for fitting the representation to images. Our representation simultaneously describes the boundary and medial loci of geometrical objects, always maintaining Blum’s symmetric axis transform (SAT) relationship. Cubic b-splines define the continuous medial locus and the associated thickness field, which in turn generate the object boundary. We present geometrical properties of the representation and derive a set of constraints on the b-spline parameters. The 2D representation encompasses branching medial loci; the 3D version can model objects with a single medial surface, and the extension to branching medial surfaces is a subject of ongoing research. We present preliminary results of segmenting 2D and 3D medical images. The representation is ultimately intended for use in statistical shape analysis.
Polygonal Approximation of Voronoi Diagrams of a Set of Triangles in Three Dimensions
- Tech Rep 766, Lab of Comp. Sci., MIT
, 1997
"... We describe a robust adaptive marching tetrahedra type algorithm for constructing a polygonal approximation of the Voronoi Diagram of an arbitrary set of triangles in three dimensions. ..."
Abstract
-
Cited by 10 (0 self)
- Add to MetaCart
We describe a robust adaptive marching tetrahedra type algorithm for constructing a polygonal approximation of the Voronoi Diagram of an arbitrary set of triangles in three dimensions.

