Author pages are created from data sourced from our academic publisher partnerships and public sources.
Share This Author
The quickhull algorithm for convex hulls
This article presents a practical convex hull algorithm that combines the two-dimensional Quickhull algorithm with the general-dimension Beneath-Beyond Algorithm, and provides empirical evidence that the algorithm runs faster when the input contains nonextreme points and that it used less memory.
The dissimilarities between sampled distributions of simple shape functions provide a robust method for discriminating between classes of objects in a moderately sized database, despite the presence of arbitrary translations, rotations, scales, mirrors, tessellations, simplifications, and model degeneracies.
A search engine for 3D models
A new matching algorithm is developed that uses spherical harmonics to compute discriminating similarity measures without requiring repair of model degeneracies or alignment of orientations and provides 46 to 245% better performance than related shape-matching methods during precision--recall experiments.
On sparse spanners of weighted graphs
- I. Althöfer, G. Das, D. Dobkin, D. Joseph, J. Soares
- Mathematics, Computer ScienceDiscret. Comput. Geom.
This paper gives a simple algorithm for constructing sparse spanners for arbitrary weighted graphs and applies this algorithm to obtain specific results for planar graphs and Euclidean graphs.
Matching 3D models with shape distributions
- R. Osada, T. Funkhouser, B. Chazelle, D. Dobkin
- Computer ScienceProceedings International Conference on Shape…
- 7 May 2001
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.
MAPS: multiresolution adaptive parameterization of surfaces
- Aaron W. F. Lee, W. Sweldens, P. Schröder, L. Cowsar, D. Dobkin
- Computer ScienceSIGGRAPH
- 24 July 1998
An irregular connectivity mesh representative of a surface having an arbitrary topology is processed to generate a parameterization which maps points in a coarse base domain to points in the mesh, such that the original mesh can be reconstructed from the base domain and the parameterization.
Modeling by example
This paper provides methods with which a user can search a large database of 3D meshes to find parts of interest, cut the desired parts out of the meshes with intelligent scissoring, and composite them together in different ways to form new objects.
Determining the Separation of Preprocessed Polyhedra - A Unified Approach
The emphasis is the uniform treatment of polyhedra separation problems, the use of hierarchical representations of primitive objects to provide implicit representations of composite or transformed objects, and applications to natural problems in graphics and robotics.
Fast Detection of Polyhedral Intersection
Delaunay graphs are almost as good as complete graphs
AbstractLetS be any set ofN points in the plane and let DT(S) be the graph of the Delaunay triangulation ofS. For all pointsa andb ofS, letd(a, b) be the Euclidean distance froma tob and let DT(a, b)…