Geodesic.bib

@article{hershberger1993matrix,
  title={Matrix Searching with the Shortest-Path Metric},
  author={Hershberger, John and Suri, Subhash},
  journal={SIAM Journal on Computing},
  volume={26},
  number={6},
  pages={1612--1634},
  year={1997},
  publisher={Society for Industrial and Applied Mathematics}
}

@InProceedings{PolygonalDomainsL1,
  author ={Sang Won Bae and Matias Korman and Joseph S. B. Mitchell and Yoshio Okamoto and Valentin Polishchuk and Haitao Wang},
  title ={{Computing the L1 Geodesic Diameter and Center of a Polygonal Domain}},
  booktitle ={33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)},
  pages ={14:1--14:14},
  series ={Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN ={978-3-95977-001-9},
  ISSN ={1868-8969},
  year ={2016},
  volume ={47},
  editor ={Nicolas Ollinger and Heribert Vollmer},
  publisher ={Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address ={Dagstuhl, Germany}
}

@book{harborth1993esther,
  title={The Esther-Klein-problem in the projective plane},
  author={Harborth, Heiko and M{\"o}ller, Meinhard},
  year={1993},
  publisher={Inst. f{\"u}r Mathematik, TU Braunschweig}
}

@article{ArXivGeodesicCenter,
  author    = {Hee{-}Kap Ahn and
               Luis Barba and
               Prosenjit Bose and
               Jean-Lou {De Carufel} and
               Matias Korman and
               Eunjin Oh},
  title     = {A linear-time algorithm for the geodesic center of a simple polygon},
  journal   = {CoRR},
  volume    = {abs/1501.00561},
  year      = {2015},
  url       = {http://arxiv.org/abs/1501.00561},
  timestamp = {Mon, 02 Feb 2015 14:12:25 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/corr/AhnBBCKO15},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}

@article{turan1941extremal,
  title={On an extremal problem in graph theory},
  author={Tur{\'a}n, Paul},
  journal={Matematikai Žs Fizikai Lapok},
  volume={48},
  number={436-452},
  pages={137},
  year={1941}
}

@book{matouvsek2002lectures,
  title={Lectures on {D}iscrete {G}eometry},
  author={Matou{\v{s}}ek, Ji{\v{r}}{\'\i}},
  volume={108},
  year={2002},
  publisher={Springer New York}
}

@article{chazelle1991triangulating,
  title={Triangulating a simple polygon in linear time},
  author={Chazelle, Bernard},
  journal={Discrete \& Computational Geometry},
  volume={6},
  number={1},
  pages={485--524},
  year={1991},
  publisher={Springer}
}

@article{lee1984euclidean,
  title={Euclidean shortest paths in the presence of rectilinear barriers},
  author={Lee, Der-Tsai and Preparata, Franco P},
  journal={Networks},
  volume={14},
  number={3},
  pages={393--410},
  year={1984},
  publisher={Wiley Online Library}
}

@article{bko-cgcpd-14,
  author = {Sang Won Bae and Matias Korman and Yoshio Okamoto},
  title = {Computing the Geodesic Centers of a Polygonal Domain},
  journal = {Computational Geometry: Theory and Applications},
  mkformat = {journal},
  year = {2015},
  note = {Special issue of selected papers from the 26th Canadian Conference on Computational Geometry (CCCG'14). In press.}
}


@article{chazelle1994ray,
  title={Ray shooting in polygons using geodesic triangulations},
  author={Chazelle, Bernard and Edelsbrunner, Herbert and Grigni, Michelangelo and Guibas, L and Hershberger, John and Sharir, Micha and Snoeyink, Jack},
  journal={Algorithmica},
  volume={12},
  number={1},
  pages={54--68},
  year={1994},
  publisher={Springer}
}

@article{harel1984fast,
  title={Fast algorithms for finding nearest common ancestors},
  author={Harel, Dov and Tarjan, Robert Endre},
  journal={SIAM Journal on Computing},
  volume={13},
  number={2},
  pages={338--355},
  year={1984},
  publisher={SIAM}
}

@article{matousekCuttings,
  title={Approximations and optimal geometric divide-and-conquer},
  author={Matou{\v{s}}ek, Ji{\v{r}}{\'\i}},
  journal={Journal of Computer and System Sciences},
  volume={50},
  number={2},
  pages={203--208},
  year={1995},
  publisher={Elsevier}
}

@article{guibasShortestPathTree,
  title={Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons},
  author={Guibas, Leonidas and Hershberger, John and Leven, Daniel and Sharir, Micha and Tarjan, Robert E},
  journal={Algorithmica},
  volume={2},
  number={1-4},
  pages={209--233},
  year={1987},
  publisher={Springer}
}

@article{megiddo1989ball,
  title={On the ball spanned by balls},
  author={Megiddo, Nimrod},
  journal={Discrete \& Computational Geometry},
  volume={4},
  number={1},
  pages={605--610},
  year={1989},
  publisher={Springer}
}


@article{megiddo1982linear,
author = {Megiddo, Nimrod},
title = {Linear-Time Algorithms for Linear Programming in $\mathbb{R}^3$ and Related Problems},
publisher = {SIAM},
year = {1983},
journal = {SIAM Journal on Computing},
volume = {12},
number = {4},
pages = {759-776},
keywords = {linear programming; 1-center; weighted center; smallest circle; linear time; median; separability; quadratic programming},
url = {http://link.aip.org/link/?SMJ/12/759/1},
}

@article{pollackComputingCenter,
  title={Computing the geodesic center of a simple polygon},
  author={Pollack, Richard and Sharir, Micha and Rote, G\"unter},
  journal={Discrete \& Computational Geometry},
  volume={4},
  number={1},
  pages={611--626},
  year={1989},
  publisher={Springer}
}

@inproceedings{ConstructionEpsilonNets,
  title={Approximations and optimal geometric divide-and-conquer},
  author={Matou{\v{s}}ek, Ji{\v{r}}{\'\i}},
  booktitle={Proceedings of the twenty-third annual ACM symposium on Theory of computing},
  pages={505--511},
  year={1991},
  organization={ACM}
}


@article{edelsbrunner1990simulation,
  title={Simulation of simplicity: {A} technique to cope with degenerate cases in geometric algorithms},
  author={Edelsbrunner, Herbert and M{\"u}cke, Ernst Peter},
  journal={ACM Transactions on Graphics},
  volume={9},
  number={1},
  pages={66--104},
  year={1990},
  publisher={ACM}
}

@article{aronov1993furthest,
  title={The furthest-site geodesic {V}oronoi diagram},
  author={Aronov, Boris and Fortune, Steven and Wilfong, Gordon},
  journal={Discrete \& Computational Geometry},
  volume={9},
  number={1},
  pages={217--255},
  year={1993},
  publisher={Springer}
}

@article{aronov1989geodesic,
  title={On the geodesic {V}oronoi diagram of point sites in a simple polygon},
  author={Aronov, Boris},
  journal={Algorithmica},
  volume={4},
  number={1-4},
  pages={109--140},
  year={1989},
  publisher={Springer}
}


@article{guibasShortestPathQueries,
  title={Optimal shortest path queries in a simple polygon}, 
  author={Guibas, Leonidas J and Hershberger, John},
  journal={Journal of {C}omputer and {S}ystem {S}ciences},
  volume={39},
  number={2},
  pages={126--152},
  year={1989},
  publisher={Academic Press}
}

@inproceedings{c-tpca-82,
 author = {Bernard Chazelle},
 title = {A theorem on polygon cutting with applications},
 booktitle = {Proceedings of FOCS},
 year = {1982},
 pages = {339--349}
}


@article{bkow-clgdcsplt-13,
  author = {Sang Won Bae and Matias Korman and Yoshio Okamoto and Haitao Wang},
  title = {Computing the ${L}_1$ Geodesic Diameter and Center of a Simple Polygon in Linear Time},
  journal = {Computational Geometry: Theory and Applications},
  mkformat = {journal},
  year = {2015},
  volume = {48},
  number = {6},
  pages = {495-505}
}

@article{suri1989computing,
  title={Computing geodesic furthest neighbors in simple polygons},
  author={Suri, Subhash},
  journal={Journal of Computer and System Sciences},
  volume={39},
  number={2},
  pages={220--235},
  year={1989},
  publisher={Elsevier}
}

@InCollection{m-gspno-00,
  author =       "J. S. B. Mitchell",
  booktitle =       "Handbook of Computational Geometry",
  editor =       "J.-R. Sack and J. Urrutia",
  title =        "Geometric Shortest Paths and Network Optimization",
  publisher =    "Elsevier",
  pages =        "633-701",
  year =         "2000",
}


@TECHREPORT{at-cgcsp-85,
  AUTHOR =       {T. Asano and G.T. Toussaint},
  TITLE =        {Computing the geodesic center of a simple polygon},
  INSTITUTION =  {McGill University},
  YEAR =         {1985},
  type =         {Technical Report},
  number =       {SOCS-85.32},
}

@article{bko-gdpd-13,
  author    = {Sang Won Bae and
               Matias Korman and
               Yoshio Okamoto},
  title     = {The Geodesic Diameter of Polygonal Domains},
  journal   = {Discrete \& Computational Geometry},
  volume    = {50},
  number    = {2},
  year      = {2013},
  pages     = {306--329},
}

@article{dls-aclcsp-92,
    author= "H.N. Djidjev and A. Lingas and J.-R. Sack",
    title = "An {$O(n\log n)$} algorithm for computing the link center of
		a simple polygon",
    journal= "Discrete \& Computational Geometry",
    volume=  "8",
    pages= "131--152",
    year= "1992",
}

@inproceedings{ns-crldp-91,
  title={Computing the rectilinear link diameter of a polygon},
  author={Nilsson, Bengt J and Schuierer, Sven},
  booktitle={Computational Geometry-Methods, Algorithms and Applications},
  pages={203--215},
  year={1991},
  organization={Springer}
}


@article{ns-oarlcrp-96,
    author= "B.J. Nilsson and S. Schuierer",
    title = "An optimal algorithm for the rectilinear link center of
		a rectilinear polygon",
    journal= "Computational Geometry: Theory and Applications",
    volume=  "6",
    pages= "169--194",
    year= "1996",
}

@PHDTHESIS{suri-mlpprp-87,
  AUTHOR =       {S. Suri},
  TITLE =        {Minimum Link Paths in Polygons and Related Problems},
  SCHOOL =       {Johns Hopkins Univ.},
  YEAR =         {1987},
}

@inproceedings{k-ealdp-89,
  title={An efficient algorithm for link-distance problems},
  author={Ke, Yan},
  booktitle={Proceedings of the fifth annual Symposium on Computational Geometry},
  pages={69--78},
  year={1989},
  organization={ACM}
}