Paper Info
Title
A decision algorithm for reversible pairs of polygons.
Abstract
A given pair of convex polygons α and β is said to be reversible if α has a dissection into a finite number of pieces which can be rearranged to form β under some conditions. In this paper, we give an algorithm to decide whether or not a given pair of polygons α and β is reversible. Furthermore, a method of how to dissect α to make β, when they are reversible, is also given.
Year
DOI
Venue
2014
10.1016/j.dam.2014.06.015
Discrete Applied Mathematics
Keywords
Field
DocType
Reversibility,Decision algorithm,Equi-decomposability,Tiling,Reversion trunk,Parallelogram
Discrete mathematics,Polygon,Combinatorics,Parallelogram,Finite set,Algorithm,Regular polygon,Mathematics
Journal
Volume
ISSN
Citations 
178
0166-218X
2
PageRank 
References 
Authors
0.65
0
3
Name
Order
Citations
PageRank
Jin Akiyama1103.25
David Rappaport2758.34
Hyunwoo Seong320.65