Results 1  10
of
145
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 textbased search techniques are not always effective for 3D data. In this paper, we investigate new shapebased search methods. The key challen ..."
Abstract

Cited by 315 (22 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 textbased search techniques are not always effective for 3D data. In this paper, we investigate new shapebased 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 webbased 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 295 (2 self)
 Add to MetaCart
(Show Context)
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
Matching 3D Models with Shape Distributions
"... Measuring the similarity between 3D shapes is a fundamental problem, with applications in computer vision, molecular biology, computer graphics, and a variety of other fields. A challenging aspect of this problem is to find a suitable shape signature that can be constructed and compared quickly, whi ..."
Abstract

Cited by 218 (7 self)
 Add to MetaCart
Measuring the similarity between 3D shapes is a fundamental problem, with applications in computer vision, molecular biology, computer graphics, and a variety of other fields. A challenging aspect of this problem is to find a suitable shape signature that can be constructed and compared quickly, while still discriminating between similar and dissimilar shapes. In 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 a simpler problem than the comparison of 3D surfaces by traditional shape matching methods that require pose registration, feature correspondence, or model fitting. We find that the dissimilarities be...
On mapmatching vehicle tracking data
 In Proc. 31st VLDB Conference
, 2005
"... Vehicle tracking data is an essential “raw ” material for a broad range of applications such as traffic management and control, routing, and navigation. An important issue with this data is its accuracy. The method of sampling vehicular movement using GPS is affected by two error sources and consequ ..."
Abstract

Cited by 111 (14 self)
 Add to MetaCart
(Show Context)
Vehicle tracking data is an essential “raw ” material for a broad range of applications such as traffic management and control, routing, and navigation. An important issue with this data is its accuracy. The method of sampling vehicular movement using GPS is affected by two error sources and consequently produces inaccurate trajectory data. To become useful, the data has to be related to the underlying road network by means of map matching algorithms. We present three such algorithms that consider especially the trajectory nature of the data rather than simply the current position as in the typical mapmatching case. An incremental algorithm is proposed that matches consecutive portions of the trajectory to the road network, effectively trading accuracy for speed of computation. In contrast, the two global algorithms compare the entire trajectory to candidate paths in the road network. The algorithms are evaluated in terms of (i) their running time and (ii) the quality of their matching result. Two novel quality measures utilizing the Fréchet distance are introduced and subsequently used in an experimental evaluation to assess the quality of matching real tracking data to a road network. 1
A Reflective Symmetry Descriptor for 3D Models
 ALGORITHMICA
, 2004
"... 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. In this paper we introduce a new reflective symmetry descriptor that represent ..."
Abstract

Cited by 73 (8 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. In this paper we introduce a new reflective symmetry descriptor that represents a measure of reflective symmetry for an arbitrary 3D model for all planes through the model’s center of mass (even if they are not planes of symmetry). The main benefits of this new shape descriptor are that it is defined over a canonical parameterization (the sphere) and describes global properties of a 3D shape. We show how to obtain a voxel grid from arbitrary 3D shapes and, using Fourier methods, we present an algorithm that computes the symmetry descriptor in O(N 4 log N) time for an N × N × N voxel grid and computes a multiresolution approximation in O(N 3 log N) time. In our initial experiments, we have found that the symmetry descriptor is insensitive to noise and stable under point sampling. We have also found that it performs well in shape matching tasks, providing a measure of shape similarity that is orthogonal to existing methods.
Multiple structural alignment by secondary structures: Algorithm and applications
 PROTEIN SCI.
, 2003
"... ..."
(Show Context)
A survey of shape similarity assessment algorithms for product design and manufacturing applications
 Journal of Computing and Information Science in Engineering
, 2003
"... This document contains the draft version of the following paper: A. Cardone, S.K. Gupta, and M. Karnik. A survey of shape similarity assessment algorithms for product design and manufacturing applications. ASME Journal of ..."
Abstract

Cited by 59 (13 self)
 Add to MetaCart
(Show Context)
This document contains the draft version of the following paper: A. Cardone, S.K. Gupta, and M. Karnik. A survey of shape similarity assessment algorithms for product design and manufacturing applications. ASME Journal of
Geometric matching under noise: combinatorial bounds and algorithms
 ACMSIAM SYMPOSIUM ON DISCRETE ALGORITHMS
, 1999
"... In geometric pattern matching, we are given two sets of points P and Q in d dimensions, and the problem is to determine the rigid transformation that brings P closest to Q, under some distance measure. More generally, each point can be modelled as a ball of small radius, and we may wish to nd a tran ..."
Abstract

Cited by 43 (9 self)
 Add to MetaCart
(Show Context)
In geometric pattern matching, we are given two sets of points P and Q in d dimensions, and the problem is to determine the rigid transformation that brings P closest to Q, under some distance measure. More generally, each point can be modelled as a ball of small radius, and we may wish to nd a transformation approximating the closest distance between P and Q. This problem has many applications in domains such as computer vision and computational chemistry In this paper we present improved algorithms for this problem, by allowing the running time of our algorithms to depend not only on n, (the number of points in the sets), but also on, the diameter of the point set. The dependence on also allows us to e ectively process point sets that occur in practice, where diameters tend to be small ([EVW94]). Our algorithms are also simple to implement, in contrast to much of the earlier work. To obtain the abovementioned results, we introduce a novel discretization technique to reduce geometric pattern matching to combinatorial pattern matching. In addition, we address various generalizations of the classical problem rst posed by Erdos: \Given a set of n points in the plane, how many pairs of points can be exactly a unit distance apart?&quot;. The combinatorial bounds we prove enable us to obtain improved results for geometric pattern matching and may have other applications.
Approximate Nearest Neighbor Algorithms for Hausdorff Metrics via Embeddings
"... Hausdorff metrics are used in geometric settings for measuring the distance between sets of points. They ..."
Abstract

Cited by 33 (4 self)
 Add to MetaCart
Hausdorff metrics are used in geometric settings for measuring the distance between sets of points. They
Detecting Commuting Patterns by Clustering Subtrajectories
, 2008
"... In this paper we consider the problem of detecting commuting patterns in a trajectory. For this we search for similar subtrajectories. To measure spatial similarity we choose the Fréchet distance and the discrete Fréchet distance between subtrajectories, which are invariant under differences in spee ..."
Abstract

Cited by 31 (12 self)
 Add to MetaCart
In this paper we consider the problem of detecting commuting patterns in a trajectory. For this we search for similar subtrajectories. To measure spatial similarity we choose the Fréchet distance and the discrete Fréchet distance between subtrajectories, which are invariant under differences in speed. We give several approximation algorithms, and also show that the problem of finding the ‘longest’ subtrajectory cluster is as hard as MaxClique to compute and approximate.