BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:A Graph-based Method for Understanding Interlocking Assemblies
DTSTART:20180831T100000
DTEND:20180831T120000
DTSTAMP:20260406T142526Z
UID:908c7769d009f826e5a22e27a8086d2d467df21e4c4262fa1abd4a3a
CATEGORIES:Conferences - Seminars
DESCRIPTION:Ziqi Wang\nEDIC candidacy exam (retake)\nExam president: Prof.
  Wenzel Jakob\nThesis advisor: Prof. Mark Pauly\nCo-examiner: Prof. Pierre
  Dillenbourg\n\nAbstract\nComputing a feasible disassembly sequence of par
 ts for a given 3D structure is a fundamental research topic in geometric r
 easoning. Its inverse problem\, which is to create the geometry of a 3D as
 sembly according to predefined constraints on the parts disassembly order\
 ,  attracts more and more attention from computer graphics community. Thi
 s report focuses on 3D interlocking assemblies where all component parts c
 an be disassembled after removing a single key part. Though several comput
 ational methods for designing interlocking assemblies such as puzzle and f
 urniture has recently been contributed\, the interlocking mechanism has no
 t yet been thoroughly investigated and the full search space of interlocki
 ng configurations has never been explored\, restricting applicability for 
 the design.\n\nIn this report\, I propose a graph-based method for modelin
 g the interlocking mechanism. The core idea is to represent part blocking 
 relationships with a family of "Directional Blocking Graphs" (DBGs). By ut
 ilizing graph analysis tools in classic graph theory\, my approach builds 
 a connection between an interlocking assembly and the connectivity of its 
 DBGs. Based on this connection\, I propose an efficient algorithm to test 
 interlocking with polynomial time complexity which enables the ability to 
 explore interlocking 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 flexible computational tool for designing interlocking assemblies of 
 different forms.\n\nBackground papers\nRecursive Interlocking Puzzles. ACM
  TransPeng Song\, Chi-Wing Fu\, and Daniel Cohen-Or. 2012.  ACM Trans. on
  Graph. (SIGGRAPH Asia) 31\, 6 (2012). Article No. 128.\nAugmentation prob
 lems. Kapali P Eswaran and R Endre Tarjan. 1976. SIAM J. Comput. 5\, 4 (19
 76)\, 653-665.\nGeometric Reasoning About Mechanical Assembly\, by Randall
  H. Wilson 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