graphStabbing.bbl
\begin{thebibliography}{10}

\bibitem{ae-degg-89}
N.~Alon and P.~Erd{\H o}s.
\newblock Disjoint edges in geometric graphs.
\newblock {\em Discrete Comput. Geom.}, 4:287--290, 1989.

\bibitem{Chazelle-Ray}
B.~Chazelle, H.~Edelsbrunner, M.~Grigni, L.~Guibas, J.~Hershberger, M.~Sharir,
  and J.~Snoeyink.
\newblock Ray shooting in polygons using geodesic triangulations.
\newblock In {\em Proceedings of the 18th international colloquium on Automata,
  languages and programming}, pages 661--673, New York, NY, USA, 1991.
  Springer-Verlag New York, Inc.

\bibitem{c-esag-96}
Y.~H. Chou.
\newblock {\em Exploring Spatial Analysis in {GIS}}.
\newblock Onword Press, 1996.

\bibitem{c-sssl-86}
R.~Cole.
\newblock Searching and storing similar lists.
\newblock {\em J. Algorithms}, 7:202--220, 1986.

\bibitem{bkos-cgaa-97}
M.~de~Berg, M.~van Kreveld, M.~Overmars, and O.~Schwarzkopf.
\newblock {\em Computational Geometry: Algorithms and Applications}.
\newblock Springer-Verlag, Berlin, 1997.

\bibitem{Dwy-DCG-97}
R.~A. Dwyer.
\newblock {Voronoi diagrams of random lines and flats}.
\newblock {\em Discrete {\&} Computational Geometry}, 17(2):123{--}136, 1997.

\bibitem{eka-nplai-84}
M.~Edahiro, I.~Kokubo, and T.~Asano.
\newblock A new point-location algorithm and its practical efficiency ---
  {C}omparison with existing algorithms.
\newblock {\em ACM Trans. Graph.}, 3(2):86--109, 1984.

\bibitem{e-acg-87}
H.~Edelsbrunner.
\newblock {\em Algorithms in Combinatorial Geometry}, volume~10 of {\em EATCS
  Monographs on Theoretical Computer Science}.
\newblock Springer-Verlag, Heidelberg, West Germany, 1987.

\bibitem{eg-snprn-08}
D.~Eppstein and M.~T. Goodrich.
\newblock Studying (non-planar) road networks through an algorithmic lens.
\newblock In {\em GIS '08: Proceedings of the 16th ACM SIGSPATIAL international
  conference on Advances in geographic information systems}, pages 1--10, New
  York, NY, USA, 2008. ACM.

\bibitem{egs-ltagg-09}
D.~Eppstein, M.~T. Goodrich, and D.~Strash.
\newblock Linear-time algorithms for geometric graphs with sublinearly many
  crossings.
\newblock In {\em SODA '09: Proceedings of the Nineteenth Annual ACM -SIAM
  Symposium on Discrete Algorithms}, pages 150--159, Philadelphia, PA, USA,
  2009. Society for Industrial and Applied Mathematics.

\bibitem{f-slrpg-48}
I.~F{\'a}ry.
\newblock On straight lines representation of planar graphs.
\newblock {\em Acta Univ. Szeged. Sect. Sci. Math.}, 11:229--233, 1948.

\bibitem{f-gga-04}
S.~Felsner.
\newblock {\em Geometric Graphs and Arrangements}.
\newblock Vieweg Press, 2004.

\bibitem{gh-cspasm-05}
A.~V. Goldberg and C.~Harrelson.
\newblock Computing the shortest path: {A$^*$} search meets graph theory.
\newblock In {\em SODA '05: Proceedings of the sixteenth annual ACM-SIAM
  symposium on Discrete algorithms}, pages 156--165, Philadelphia, PA, USA,
  2005. Society for Industrial and Applied Mathematics.

\bibitem{Goodrich-DynRay}
M.~T. Goodrich and R.~Tamassia.
\newblock Dynamic ray shooting and shortest paths via balanced geodesic
  triangulations.
\newblock In {\em SCG '93: Proceedings of the ninth annual symposium on
  Computational geometry}, pages 318--327, New York, NY, USA, 1993. ACM.

\bibitem{gt-dtdpl-98}
M.~T. Goodrich and R.~Tamassia.
\newblock Dynamic trees and dynamic point location.
\newblock {\em SIAM J. Comput.}, 28(2):612--636, 1998.

\bibitem{Gou-RMP-45}
S.~Goudsmit.
\newblock {Random distribution of lines in a plane}.
\newblock {\em Rev. Modern Phys.}, 17:321{--}322, 1945.

\bibitem{hsww-csuts-05}
M.~Holzer, F.~Schulz, D.~Wagner, and T.~Willhalm.
\newblock Combining speed-up techniques for shortest-path computations.
\newblock {\em J. Exp. Algorithmics}, 10:2.5, 2005.

\bibitem{kp-sppls-06}
G.~A. Klunder and H.~N. Post.
\newblock The shortest path problem on large-scale real-road networks.
\newblock {\em Networks}, 48(4):182--194, 2006.

\bibitem{k-cdf-63}
D.~E. Knuth.
\newblock Computer drawn flowcharts.
\newblock {\em Commun. ACM}, 6, 1963.

\bibitem{Mil-PNAS-64}
R.~E. Miles.
\newblock {Random polygons determined by random lines in a plane}.
\newblock {\em Proc. Nat. Acad. Sci. U.S.A.}, 52:901{--}907, 1964.

\bibitem{o-agta-87}
J.~O'Rourke.
\newblock {\em Art Gallery Theorems and Algorithms}.
\newblock The International Series of Monographs on Computer Science. Oxford
  University Press, New York, NY, 1987.

\bibitem{p-ggt-99}
J.~Pach.
\newblock Geometric graph theory.
\newblock In {\em Surveys in Combinatorics}, volume 267 of {\em Lecture Notes
  Series}, pages 167--200. Cambridge University Press, 1999.

\bibitem{p-ggt-04}
J.~Pach.
\newblock Geometric graph theory.
\newblock In J.~E. Goodman and J.~O'Rourke, editors, {\em Handbook of Discrete
  and Computational Geometry}, chapter~10, pages 219--238. CRC Press LLC, 2nd
  edition, 2004.

\bibitem{p-ttgg-04}
J.~Pach.
\newblock {\em Towards a Theory of Geometric Graphs}, volume 342 of {\em
  Contemporary Mathematics}.
\newblock American Mathematical Society, 2004.

\bibitem{p-nappl-81}
F.~P. Preparata.
\newblock A new approach to planar point location.
\newblock {\em SIAM J. Comput.}, 10(3):473--482, 1981.

\bibitem{p-pplr-90}
F.~P. Preparata.
\newblock Planar point location revisited.
\newblock {\em Internat. J. Found. Comput. Sci.}, 1(1):71--86, 1990.

\bibitem{ps-cgi-90}
F.~P. Preparata and M.~I. Shamos.
\newblock {\em Computational Geometry: An Introduction}.
\newblock Springer-Verlag, 3rd edition, Oct. 1990.

\bibitem{ss-hhhes-05}
P.~Sanders and D.~Schultes.
\newblock Highway hierarchies hasten exact shortest path queries.
\newblock In {\em Proceedings 17th European Symposium on Algorithms (ESA)},
  volume 3669 of {\em Springer LNCS}, pages 568--579. Springer, 2005.

\bibitem{st-pplup-86}
N.~Sarnak and R.~E. Tarjan.
\newblock Planar point location using persistent search trees.
\newblock {\em Commun. ACM}, 29(7):669--679, July 1986.

\bibitem{sv-speg-86}
R.~Sedgewick and J.~S. Vitter.
\newblock Shortest paths in {Euclidean} graphs.
\newblock {\em Algorithmica}, 1:31--48, 1986.

\bibitem{t-cagg-98}
S.-H. Teng.
\newblock Combinatorial aspects of geometric graphs.
\newblock {\em Comput. Geom. Theory Appl.}, 9:277--287, 1998.

\bibitem{t-crg-60}
W.~T. Tutte.
\newblock Convex representations of graphs.
\newblock {\em Proceedings London Mathematical Society}, 10(38):304--320, 1960.

\bibitem{t-hdg-63}
W.~T. Tutte.
\newblock How to draw a graph.
\newblock {\em Proceedings London Mathematical Society}, 13(52):743--768, 1963.

\bibitem{zn-spaeu-98}
F.~B. Zhan and C.~E. Noon.
\newblock Shortest path algorithms: An evaluation using real road networks.
\newblock {\em Transportation Science}, 32(1):65--73, 1998.

\end{thebibliography}
