A Dissimilarity Measure for Comparing Origami Crease Patterns

A measure of dissimilarity (distance) is proposed for comparing origami crease patterns represented as geometric graphs. The distance measure is determined by minimum-weight matchings calculated between the edges as well as the vertices of the graphs being compared. The distances between pairs of edges and pairs of vertices of the graph are weighted linear combinations of six parameters that constitute geometric features of the edges and vertices. The results of a preliminary study performed with a collection of 45 crease patterns obtained from Mitaniâ??s ORIPA web page, revealed which of these features appear to be more salient for obtaining a clustering of the crease patterns that appears to agree with human intuition.

[1]  Joachim Gudmundsson,et al.  Measuring the Similarity of Geometric Graphs , 2009, SEA.

[2]  Alberto Del Bimbo,et al.  A Graph Edit Distance Based on Node Merging , 2004, CIVR.

[3]  T Hodge,et al.  A myosin family tree. , 2000, Journal of cell science.

[4]  Joseph B. M. Mitchell,et al.  When can you fold a map? , 2000, Comput. Geom..

[5]  Robert J. Lang,et al.  A computational algorithm for origami design , 1996, SCG '96.

[6]  Katherine A. Liapi,et al.  Transformable Architecture Inspired by the Origami Art: Computer Visualization as a Tool for Form Exploration , 2002 .

[7]  R. Lang.  Origami Design Secrets: Mathematical Methods for an Ancient Art , 2003 .

[8]  Harold W. Kuhn,et al.  The Hungarian method for the assignment problem , 1955, 50 Years of Integer Programming.

[9]  Hongliang Fei,et al.  Structure feature selection for graph classification , 2008, CIKM '08.

[10]  Phillip Anzalone.  Synthetic Landscapes: Proceedings of the 25th Annual Conference of the Association for Computer-Aided Design in Architecture , 2006 .

[11]  Robert J. Lang,et al.  Folding paper : the infinite possibilities of origami , 2013 .

[12]  Amine Labriji,et al.  Similarity Measure of Graphs , 2017, Int. J. Recent Contributions Eng. Sci. IT.

[13]  Godfried T. Toussaint,et al.  The Edit Distance as a Measure of Perceived Rhythmic Similarity , 2011 .

[14]  L. Guibas,et al.  Distance between Folded Objects , 2011 .

[15]  J. Pach.  Towards a Theory of Geometric Graphs , 2004 .

[16]  Godfried T. Toussaint,et al.  Efficient Many-To-Many Point Matching in One Dimension , 2007, Graphs Comb..

[17]  Heikki Mannila,et al.  Distance measures for point sets and their computation , 1997, Acta Informatica.

[18]  Horst Bunke,et al.  Graph Edit Distance with Node Splitting and Merging, and Its Application to Diatom Idenfication , 2003, GbRPR.

[19]  O Gascuel,et al.  BIONJ: an improved version of the NJ algorithm based on a simple model of sequence data. , 1997, Molecular biology and evolution.

[20]  Hugo A. Akitaya,et al.  Generating folding sequences from crease patterns of flat-foldable origami , 2013, SIGGRAPH '13.

[21]  Devin J. Balkcom,et al.  Folding Paper Shopping Bags , 2006 .

[22]  Erik D. Demaine,et al.  Recent Results in Computational Origami , 2002 .

[23]  Zhong You,et al.  A solution for folding rigid tall shopping bags , 2011, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences.

[24]  Tomohiro Tachi,et al.  Freeform Rigid-Foldable Structure using Bidirectionally Flat-Foldable Planar Quadrilateral Mesh , 2010, AAG.

[25]  Xuelong Li,et al.  A survey of graph edit distance , 2010, Pattern Analysis and Applications.

[26]  Godfried T. Toussaint,et al.  Minimum Many-to-Many Matchings for Computing the Distance Between Two Sequences , 2011, CCCG.

[27]  J. Munkres.  ALGORITHMS FOR THE ASSIGNMENT AND TRANSIORTATION tROBLEMS* , 1957 .

[28]  Marshall W. Bern,et al.  The complexity of flat origami , 1996, SODA '96.

[29]  Erik D. Demaine,et al.  Geometric folding algorithms - linkages, origami, polyhedra , 2007 .

[30]  Vladimir I. Levenshtein,et al.  Binary codes capable of correcting deletions, insertions, and reversals , 1965 .

[31]  D. Huson,et al.  Application of phylogenetic networks in evolutionary studies. , 2006, Molecular biology and evolution.