
Chen Gu and Leonidas Guibas. Distance between Folded Objects. 27th European Workshop on Computational Geometry. Morschach, Switzerland, March 2011.
Abstract:
Geometric folding problems have recently attracted much attention in both mathematics and theoretical computer science. In this paper, we study the following basic problem: given a set of folded conformations of a unitlength rope in 1D, how do we decide which are more similar or less similar to each other? We first define a distance function between flat folded states that incorporates both the geometry and the overlap order. Then we do some computational experiments clustering random folded ropes with this distance metric. Finally, we generalize our results for 1D folded ropes to flat folded papers (origami) in 2D.
Bibtex:
@inproceedings{ggdbfo11,
author = {Chen Gu and Leonidas Guibas},
title = {Distance between Folded Objects},
booktitle = {Proceedings of the 27th European Workshop on Computational Geometry},
pages = {3942},
year = {2011},
}

