Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: A decomposition of a polygon P is a set of polygons whose geometric union is exactly P.  study a polygon decomposition problem that is equivalent to the Orthogonal Art Gallery problem. Two points are r-visible if the orthogonal bounding rectangle for p and q lies within P. A polygon P is an r-star if there exists a point k ∈ P such that for each point q ∈ P, q is r-visible from k. In this problem  seek a minimum cardinality decomposition of a polygon into r-stars.  show how to compute the minimum r-star cover of an orthogonal polygon in polynomial time.
['Chris Worman', 'J. Mark Keil']
I am writing a research paper on a idea POLYGON DECOMPOSITION AND THE ORTHOGONAL ART GALLERY PROBLEM
[{"from": "human", "value": "I am writing a research paper on a idea POLYGON DECOMPOSITION AND THE ORTHOGONAL ART GALLERY PROBLEM"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: A decomposition of a polygon P is a set of polygons whose geometric union is exactly P.  study a polygon decomposition problem that is equivalent to the Orthogonal Art Gallery problem. Two points are r-visible if the orthogonal bounding rectangle for p and q lies within P. A polygon P is an r-star if there exists a point k \u2208 P such that for each point q \u2208 P, q is r-visible from k. In this problem  seek a minimum cardinality decomposition of a polygon into r-stars.  show how to compute the minimum r-star cover of an orthogonal polygon in polynomial time."}]