. Lemma-3, For s, s ? A, the bisector J(s, s ) is an infinite connected curve consisting of a finite number of conic arcs, which separates the unbounded path-connected regions D(s, s ) and D(s , s)

. Proof, By the above, J(s, s ) = ?D(s, s ) = ?D(s , s), and D(s, s ) ? J(s, s ) ?

P. Agarwal and M. Sharir, Circle Shooting in a Simple Polygon, Journal of Algorithms, vol.14, issue.1, pp.69-87, 1993.
DOI : 10.1006/jagm.1993.1004

H. Ahn, O. Cheong, and R. Van-oostrum, Casting a polyhedron with directional uncertainty, Computational Geometry, vol.26, issue.2, pp.129-141, 2003.
DOI : 10.1016/S0925-7721(02)00167-0

S. W. Bae and K. Chwa, VORONOI DIAGRAMS FOR A TRANSPORTATION NETWORK ON THE EUCLIDEAN PLANE, International Journal of Computational Geometry & Applications, vol.16, issue.02n03, pp.117-144, 2006.
DOI : 10.1142/S0218195906001963

S. Cheng, O. Cheong, H. Everett, and R. Van-oostrum, Hierarchical Decompositions and Circular Ray Shooting in Simple Polygons, Discrete & Computational Geometry, vol.32, issue.3, pp.401-415, 2004.
DOI : 10.1007/s00454-004-1098-2
URL : https://hal.archives-ouvertes.fr/inria-00100017

M. De-berg, M. Van-kreveld, M. Overmars, and O. Schwarzkopf, Computational Geometry: Algorithms and Applications, 2000.

J. Hershberger and S. Suri, A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk, Journal of Algorithms, vol.18, issue.3, pp.403-431, 1995.
DOI : 10.1006/jagm.1995.1017

R. Klein, Concrete and Abstract Voronoi Diagrams, Lecture Notes Comput . Sci, vol.400, 1989.
DOI : 10.1007/3-540-52055-4

R. Klein, K. Mehlhorn, and S. Meiser, Randomized incremental construction of abstract Voronoi diagrams, Computational Geometry, vol.3, issue.3, pp.157-184, 1993.
DOI : 10.1016/0925-7721(93)90033-3

M. Sharir and H. Shaul, Ray shooting and stone throwing with near-linear storage, Computational Geometry, vol.30, issue.3, pp.239-252, 2005.
DOI : 10.1016/j.comgeo.2004.10.001
URL : http://doi.org/10.1016/j.comgeo.2004.10.001