Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Given a set of $h$ pairwise disjoint polygonal obstacles with a total of $n$ vertices in the plane, the vertex-vertex visibility graph is an undirected graph whose nodes are vertices of the obstacles and whose edges are pairs of visible vertices. The vertex-edge and edge-edge visibility graphs are defined similarly. Ghosh and Mount gave a ll-known output-sensitive $O(n\log n+k)$ time algorithm for computing these visibility graphs, where $k$ is the size of the corresponding graph. By developing new techniques based on an extended corridor structure,  augment Ghosh and Mount’s algorithm to build these visibility graphs in $O(n+h\log h+k)$ time, after the free space is triangulated. The new algorithm improves Ghosh and Mount’s algorithm by reducing its additive $O(n\log n)$ time factor to $O(n + h\log h)$. Like Ghosh and Mount’s algorithm, our algorithm can also compute several important structures such as the funnel structure and the enhanced visibility graph, which may have other applications.
['Danny Z. Chen', 'Haitao Wang']
I am writing a research paper on a idea A NEW ALGORITHM FOR COMPUTING VISIBILITY GRAPHS OF POLYGONAL OBSTACLES IN THE PLANE
[{"from": "human", "value": "I am writing a research paper on a idea A NEW ALGORITHM FOR COMPUTING VISIBILITY GRAPHS OF POLYGONAL OBSTACLES IN THE PLANE"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Given a set of $h$ pairwise disjoint polygonal obstacles with a total of $n$ vertices in the plane,\u00a0the vertex-vertex visibility graph is an undirected graph whose nodes are vertices of the obstacles\u00a0and whose edges are pairs of visible vertices. The vertex-edge and edge-edge visibility graphs\u00a0are defined similarly. Ghosh and Mount gave a ll-known output-sensitive $O(n\\log n+k)$ time\u00a0algorithm for computing these visibility graphs, where $k$ is the size of the corresponding graph. By developing new techniques based on an extended corridor structure,  augment Ghosh and Mount\u2019s algorithm to build these visibility graphs in $O(n+h\\log h+k)$ time, after the free space is triangulated. The new algorithm improves Ghosh and Mount\u2019s algorithm by reducing its additive $O(n\\log n)$ time factor to $O(n + h\\log h)$. Like Ghosh and Mount\u2019s algorithm, our algorithm can also compute several important structures such as the funnel structure and the enhanced visibility graph, which may have other applications."}]