Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: A pants decomposition of a compact orientable surface M is a set of disjoint simple cycles which cuts M into pairs of pants, i.e., spheres with three boundaries. Assuming M is a polyhedral surface, with ighted vertex-edge graph G,  consider combinatorial pants decompositions: the cycles are closed walks in G that may overlap but do not cross.  give an algorithm which, given a pants decomposition, computes a homotopic pants decomposition in which each cycle is a shortest cycle in its homotopy class. In particular, the resulting decomposition is optimal (as short as possible among all homotopic pants decompositions), and any optimal pants decomposition is made of shortest homotopic cycles. Qur algorithm is polynomial in the complexity of the input and in the longest-to-shortest edge ratio of G. The same algorithm can be applied, given a simple cycle C, to compute a shortest cycle homotopic to C which is itself simple.
['Éric Colin de Verdière', 'Francis Lazarus']
I am writing a research paper on a idea Optimal pants decompositions and shortest homotopic cycles on an orientable surface
[{"from": "human", "value": "I am writing a research paper on a idea Optimal pants decompositions and shortest homotopic cycles on an orientable surface"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: A pants decomposition of a compact orientable surface M is a set of disjoint simple cycles which cuts M into pairs of pants, i.e., spheres with three boundaries. Assuming M is a polyhedral surface, with ighted vertex-edge graph G,  consider combinatorial pants decompositions: the cycles are closed walks in G that may overlap but do not cross.  give an algorithm which, given a pants decomposition, computes a homotopic pants decomposition in which each cycle is a shortest cycle in its homotopy class. In particular, the resulting decomposition is optimal (as short as possible among all homotopic pants decompositions), and any optimal pants decomposition is made of shortest homotopic cycles. Qur algorithm is polynomial in the complexity of the input and in the longest-to-shortest edge ratio of G. The same algorithm can be applied, given a simple cycle C, to compute a shortest cycle homotopic to C which is itself simple."}]