Name
Abstract | ||
|---|---|---|
This paper deals with the computational complexity of disassembling 2-dimensional composite parts (comprised of simple polygons) via collision-free translations. The first result of this paper is an O(Mn + M log M) algorithm for computing a sequence of translations (performed in a common direction) to disassemble composite parts. The algorithm improves on the O(Mn log Mn) bound previously established for this problem and is easily seen to be optimal. The algorithm solves the problem posed by Nurmi and by Toussaint. |
Year | DOI | Venue |
|---|---|---|
1993 | 10.1007/3-540-51859-2_14 | International Journal of Computational Geometry and Applications |
Keywords | DocType | Volume |
disassembling two-dimensional composite parts,computational complexity,2 dimensional | Journal | 3 |
Issue | ISBN | Citations |
1 | 3-540-51859-2 | 3 |
PageRank | References | Authors |
0.39 | 13 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Doron Nussbaum | 1 | 89 | 13.49 |
| Jörg-Rüdiger Sack | 2 | 1099 | 166.07 |