Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  consider the problems of unfolding 3D lattice polygons embedded on the surface of some classes of lattice polyhedra, and of unfolding 2D orthogonal trees. During the unfolding process, all graph edges are preserved and no edge crossings are allod. Let  n be the number of edges of the given polygon or tree.  show that a lattice polygon embedded on an open lattice orthotube can be convexified in  O ( n ) moves and time, and a lattice polygon embedded on a lattice Tor of Hanoi, a lattice Manhattan Tor, or an orthogonally-convex lattice polyhedron can be convexified in  O ( n 2) moves and time. The main technique in our algorithms is to fold up the lattice polygon from the end blocks of the given lattice polyhedron. On the other hand,  show that a 2-monotone orthogonal tree on the plane can be straightened in  O ( n 2) moves and time.  hope that our results shed some light on solving the more general conjectures, which  proposed, that a 3D lattice polygon embedded on any lattice polyhedron can always be convexified, and any 2D orthogonal tree can always be straightened.
['Sheung-Hung Poon']
I am writing a research paper on a idea On Unfolding 3D Lattice Polygons and 2D Orthogonal Trees
[{"from": "human", "value": "I am writing a research paper on a idea On Unfolding 3D Lattice Polygons and 2D Orthogonal Trees"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  consider the problems of unfolding 3D lattice polygons embedded on the surface of some classes of lattice polyhedra, and of unfolding 2D orthogonal trees. During the unfolding process, all graph edges are preserved and no edge crossings are allod. Let  n be the number of edges of the given polygon or tree.  show that a lattice polygon embedded on an open lattice orthotube can be convexified in  O ( n ) moves and time, and a lattice polygon embedded on a lattice Tor of Hanoi, a lattice Manhattan Tor, or an orthogonally-convex lattice polyhedron can be convexified in  O ( n 2) moves and time. The main technique in our algorithms is to fold up the lattice polygon from the end blocks of the given lattice polyhedron. On the other hand,  show that a 2-monotone orthogonal tree on the plane can be straightened in  O ( n 2) moves and time.  hope that our results shed some light on solving the more general conjectures, which  proposed, that a 3D lattice polygon embedded on any lattice polyhedron can always be convexified, and any 2D orthogonal tree can always be straightened."}]