Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Consider a set  X  of  n -points in space, each with positive  z -coordinate, and a compact plane convex set  S .  define a graph  G ( X , S ), called the  ray-shooting graph , on  X  as follows: The points of  X  are the vertices and        , is an edge if and only if the infinite line joining  p   i   to  p   j   intersects  S .   provide a characterization of shooting graphs; they are exactly the set of comparability graphs of containment orders arising from families of plane homothetic convex sets.  also prove that the crossing number of these ordered sets is at most 2, and that not all comparability graphs are three-dimensional ray-shooting graphs.
['Evangelos Kranakis', 'Danny Krizanc', 'Anil Maheshwari', 'Jörg-Rüdiger Sack', 'Jorge Urrutia']
I am writing a research paper on a idea Ray shooting from convex ranges
[{"from": "human", "value": "I am writing a research paper on a idea Ray shooting from convex ranges"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Consider a set  X  of  n -points in space, each with positive  z -coordinate, and a compact plane convex set  S .  define a graph  G ( X , S ), called the  ray-shooting graph , on  X  as follows: The points of  X  are the vertices and        , is an edge if and only if the infinite line joining  p   i   to  p   j   intersects  S .   provide a characterization of shooting graphs; they are exactly the set of comparability graphs of containment orders arising from families of plane homothetic convex sets.  also prove that the crossing number of these ordered sets is at most 2, and that not all comparability graphs are three-dimensional ray-shooting graphs."}]