{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T21:05:10Z","timestamp":1764363910336},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1993,3,1]],"date-time":"1993-03-01T00:00:00Z","timestamp":730944000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[1993,3]]},"DOI":"10.1007\/bf02189321","type":"journal-article","created":{"date-parts":[[2005,9,21]],"date-time":"2005-09-21T03:56:54Z","timestamp":1127275014000},"page":"217-255","source":"Crossref","is-referenced-by-count":31,"title":["The furthest-site geodesic voronoi diagram"],"prefix":"10.1007","volume":"9","author":[{"given":"Boris","family":"Aronov","sequence":"first","affiliation":[]},{"given":"Steven","family":"Fortune","sequence":"additional","affiliation":[]},{"given":"Gordon","family":"Wilfong","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1993,3,1]]},"reference":[{"issue":"1","key":"BF02189321_CR1","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01553882","volume":"4","author":"B. Aronov","year":"1989","unstructured":"B. Aronov, On the geodesic Voronoi diagram of point sites in a simple polygon,Algorithmica 4(1), 1989, 109\u2013140.","journal-title":"Algorithmica"},{"key":"BF02189321_CR2","first-page":"65","volume-title":"Perspectives in Computing: Discrete Algorithms and Complexity, Proceedings of Japan-US Joint Seminar","author":"T. Asano","year":"1986","unstructured":"T. Asano, G. T. Toussaint, Computing the geodesic center of a simple polygon, inPerspectives in Computing: Discrete Algorithms and Complexity, Proceedings of Japan-US Joint Seminar, D. S. Johnson, A. Nozaki, T. Nishizeki, H. Willis, eds, Academic Press, Boston, June 1986, pp. 65\u201379."},{"key":"BF02189321_CR3","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1109\/TC.1979.1675432","volume":"28","author":"J. L. Bentley","year":"1979","unstructured":"J. L. Bentley, T. A. Ottmann, Algorithms for reporting and counting geometric intersections,IEEE Transactions on Computers 28 (1979), 643\u2013647.","journal-title":"IEEE Transactions on Computers"},{"key":"BF02189321_CR4","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1007\/BF02187747","volume":"4","author":"B. Chazelle","year":"1989","unstructured":"B. Chazelle, L. Guibas, Visibility and intersection problems in plane geometry,Discrete and Computational Geometry 4 (1989), 551\u2013581.","journal-title":"Discrete and Computational Geometry"},{"key":"BF02189321_CR5","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF01840360","volume":"2","author":"L. Guibas","year":"1987","unstructured":"L. Guibas, J. Hershberger, D. Leven, M. Sharir, R. E. Tarjan, Linear-time algorithms for visibility and shortest-path problems inside triangulated simple polygons,Algorithmica 2 (1987), 209\u2013233.","journal-title":"Algorithmica"},{"issue":"4","key":"BF02189321_CR6","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1016\/0020-0190(78)90062-5","volume":"7","author":"M. R. Garey","year":"1978","unstructured":"M. R. Garey, D. S. Johnson, F. P. Preparata, R. E. Tarjan, Triangulating a simple polygon,Information Processing Letters 7(4) (1978), 8\u201321.","journal-title":"Information Processing Letters"},{"issue":"3","key":"BF02189321_CR7","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1002\/net.3230140304","volume":"14","author":"D. T. Lee","year":"1984","unstructured":"D. T. Lee, F. P. Preparata, Euclidean shortest paths in the presence of rectilinear barriers,Networks 14(3) (1984), 393\u2013410.","journal-title":"Networks"},{"key":"BF02189321_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry: an Introduction","author":"F. P. Preparata","year":"1985","unstructured":"F. P. Preparata, M. I. Shamos,Computational Geometry: an Introduction, Springer-Verlag, New York, 1985."},{"key":"BF02189321_CR9","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1007\/BF02187751","volume":"4","author":"R. Pollack","year":"1989","unstructured":"R. Pollack, M. Sharir, G. Rote, Computing the geodesic center of a simple polygon,Discrete and Computational Geometry 4 (1989), 611\u2013626.","journal-title":"Discrete and Computational Geometry"},{"key":"BF02189321_CR10","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1016\/0022-0000(89)90045-7","volume":"39","author":"S. Suri","year":"1989","unstructured":"S. Suri, Computing geodesic furthest neighbors in simple polygons,Journal of Computer and Systems Sciences 39 (1989), 220\u2013235.","journal-title":"Journal of Computer and Systems Sciences"},{"issue":"7","key":"BF02189321_CR11","doi-asserted-by":"crossref","first-page":"660","DOI":"10.1145\/6138.6151","volume":"29","author":"N. Sarnak","year":"1986","unstructured":"N. Sarnak, R. E. Tarjan, Planar point location using persistent search trees,Communications of the ACM 29(7) (1986), 660\u2013679.","journal-title":"Communications of the ACM"},{"key":"BF02189321_CR12","first-page":"853","volume-title":"Signal Processing III: Theories and Applications, Proceedings of EUSIPCO 86, Part 2","author":"G. Toussaint","year":"1986","unstructured":"G. Toussaint, An optimal algorithm for computing the relative convex hull of a set of points in a polygon, inSignal Processing III: Theories and Applications, Proceedings of EUSIPCO 86, Part 2, North-Holland, Amsterdam 1986, pp. 853\u2013856."}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02189321.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02189321\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02189321","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T17:31:26Z","timestamp":1557855086000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02189321"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,3]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1993,3]]}},"alternative-id":["BF02189321"],"URL":"https:\/\/doi.org\/10.1007\/bf02189321","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,3]]}}}