Representation and automatic generation of contact state graphs between general solid objects
by Tang, Peng, Ph.D., THE UNIVERSITY OF NORTH CAROLINA AT CHARLOTTE, 2007, 150 pages; 3296788

Abstract:

Information of contact geometry is useful and sometimes even necessary for a wide range of applications, from robotic tasks involving compliant motion to virtual prototyping and simulation. It is often necessary to know not only the relative contact location between two objects but also the high-level, discrete, topological contact state that is more descriptive of the topological and physical characteristics of contact shared by two or more contact locations. However, enumerating contact states or building a contact state graph by hand is tedious for even tasks of simple geometry and is practically infeasible for complex objects especially when curved objects are involved. Existing work related to representing and automatically generating the information of topological contact states has been limited to contact states between polyhedral objects. There is a lack of systematic study to represent discrete topological contact states between general curved objects or articulated objects and a lack of efficient means of generating topological contact states between such objects automatically.

In this dissertation, first different models are introduced to represent contact states between a broad class of curved objects. Next, algorithms to automatically generate contact state graphs between curved objects are presented. Implementation and the experimental results are described. An application of the approach on generation of assembly contact state graph is also introduced. Moreover, a practical approach is presented to represent concisely and generate automatically graphs of contact states between a polygonal object and an articulated planar object, i.e., a planar kinematic chain. Our approach effectively exploits topological and geometrical constraints associated with contact states to ensure both correctness, completeness and efficiency.

 
AdviserJing Xiao
SchoolTHE UNIVERSITY OF NORTH CAROLINA AT CHARLOTTE
SourceDAI/B 69-01, p. , Apr 2008
Source TypeDissertation
SubjectsComputer science
Publication Number3296788
Adobe PDF Access the complete dissertation:
 

» Find an electronic copy at your library.
  Use the link below to access a full citation record of this graduate work:
  http://gateway.proquest.com/openurl%3furl_ver=Z39.88-2004%26res_dat=xri:pqdiss%26rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation%26rft_dat=xri:pqdiss:3296788
  If your library subscribes to the ProQuest Dissertations & Theses (PQDT) database, you may be entitled to a free electronic version of this graduate work. If not, you will have the option to purchase one, and access a 24 page preview for free (if available).

About ProQuest Dissertations & Theses
With over 2.3 million records, the ProQuest Dissertations & Theses (PQDT) database is the most comprehensive collection of dissertations and theses in the world. It is the database of record for graduate research.

The database includes citations of graduate works ranging from the first U.S. dissertation, accepted in 1861, to those accepted as recently as last semester. Of the 2.3 million graduate works included in the database, ProQuest offers more than 1.9 million in full text formats. Of those, over 860,000 are available in PDF format. More than 60,000 dissertations and theses are added to the database each year.

If you have questions, please feel free to visit the ProQuest Web site - http://www.proquest.com - or call ProQuest Hotline Customer Support at 1-800-521-3042.