Fast Polygon Mesh Querying By Example
- James Scott ,
- James Gain
ACM SIGGRAPH 99 Conference Abstracts and Applications |
Published by Association for Computing Machinery, Inc.
The reusability of three-dimensional models has lead to a proliferation in the number and size of 3D object repositories. These typically store objects in the some polygon mesh file format and allow selection by means of categories and keywords. While keyword searches are useful in many circumstances, they suffer from the subjectivity, ambiguity and resolution difficulties inherit in natural language. These problems become more acute sa database seizes increase and may force users to sift through large numbers of returned thumbnail images.
On solution is to query the object database by example. The user constructs a rough low-resolutions query model with the shape characteristics of the target object. This is then compared against entries in the database and the closest matches returned in order of similarity. The core of this method is the matching algorithm.
Copyright © 1999 by the Association for Computing Machinery, Inc. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept, ACM Inc., fax +1 (212) 869-0481, or permissions@acm.org. The definitive version of this paper can be found at ACM's Digital Library --http://www.acm.org/dl/.