BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:A Graph-based Method for Understanding Interlocking Assemblies
DTSTART:20180629T140000
DTEND:20180629T160000
DTSTAMP:20260406T222316Z
UID:f4f9d8e0aee38f43ea90d1a127a410b52b4362ac0c9b1e0bb997b549
CATEGORIES:Conferences - Seminars
DESCRIPTION:Ziqi Wang\nEDIC candidacy exam\nExam president: Prof. Wenzel J
 akob\nThesis advisor: Prof. Mark Pauly\nCo-examiner: Prof. Pierre Dillenbo
 urg\n\nAbstract\nComputing a feasible disassembly sequence of parts for a 
 given 3D structure is a fundamental research topic in geometric reasoning.
  Its inverse problem\, which is to create the geometry of a 3D assembly ac
 cording to predefined constraints on the parts disassembly order\,  attra
 cts more and more attention from computer graphics community. This report 
 focuses on 3D interlocking assemblies where all component parts can be dis
 assembled after removing a single key part. Though several computational m
 ethods for designing interlocking assemblies such as puzzle and furniture 
 has recently been contributed\, the interlocking mechanism has not yet bee
 n thoroughly investigated and the full search space of interlocking config
 urations has never been explored\, restricting applicability for the desig
 n.\n\nIn this report\, I propose a graph-based method for modeling the int
 erlocking mechanism. The core idea is to represent part blocking relations
 hips with a family of "Directional Blocking Graphs" (DBGs). By utilizing g
 raph analysis tools in classic graph theory\, my approach builds a connect
 ion between an interlocking assembly and the connectivity of its DBGs. Bas
 ed on this connection\, I propose an efficient algorithm to test interlock
 ing with polynomial time complexity which enables the ability to explore i
 nterlocking configurations that are not possible by the state of the art. 
 As a result\, my method has potential to lead to a more efficient and flex
 ible computational tool for designing interlocking assemblies of different
  forms.\n\nBackground papers\nRecursive Interlocking Puzzles. ACM TransPen
 g Song\, Chi-Wing Fu\, and Daniel Cohen-Or. 2012.  ACM Trans. on Graph. (
 SIGGRAPH Asia) 31\, 6 (2012). Article No. 128.\nAugmentation problems. Kap
 ali P Eswaran and R Endre Tarjan. 1976. SIAM J. Comput. 5\, 4 (1976)\, 653
 -665.\nGeometric Reasoning About Mechanical Assembly\, by Randall H. Wilso
 n and Jean-Claude Latombe. 1994.  Artificial Intelligence 71\, 2 (1994)\,
  371-396.
LOCATION:BC 329 https://plan.epfl.ch/?room==BC%20329
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR