Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Recent advances on polygon triangulation have yielded efficient algorithms for a large number of problems dealing with a single simple polygon. If the input consists of several disjoint polygons, hover, it is often desirable to merge them in preprocessing so as to produce a single polygon that retains the geometric characteristics of its individual components.  give an efficient method for doing so, which combines a generalized form of Jordan sorting with the efficient use of point location and interval trees. As a corollary,  are able to triangulate a collection of p disjoint Jordan polygonal chains in time O (n + p (log p)1+e), for any fixed e > 0, where n is the total number of vertices. A variant of the algorithm gives a running time of O ((n + p log p) log log p). The performance of these solutions approaches the lor bound of Ω (n + p log p).
['Reuven Bar-Yehuda', 'Bernard Chazelle']
I am writing a research paper on a idea TRIANGULATING DISJOINT JORDAN CHAINS
[{"from": "human", "value": "I am writing a research paper on a idea TRIANGULATING DISJOINT JORDAN CHAINS"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Recent advances on polygon triangulation have yielded efficient algorithms for a large number of problems dealing with a single simple polygon. If the input consists of several disjoint polygons, hover, it is often desirable to merge them in preprocessing so as to produce a single polygon that retains the geometric characteristics of its individual components.  give an efficient method for doing so, which combines a generalized form of Jordan sorting with the efficient use of point location and interval trees. As a corollary,  are able to triangulate a collection of p disjoint Jordan polygonal chains in time O (n + p (log p)1+e), for any fixed e > 0, where n is the total number of vertices. A variant of the algorithm gives a running time of O ((n + p log p) log log p). The performance of these solutions approaches the lor bound of \u03a9 (n + p log p)."}]