{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T09:30:57Z","timestamp":1772357457158,"version":"3.50.1"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[1989,12,1]],"date-time":"1989-12-01T00:00:00Z","timestamp":628473600000},"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":[[1989,12]]},"DOI":"10.1007\/bf02187751","type":"journal-article","created":{"date-parts":[[2005,9,20]],"date-time":"2005-09-20T18:57:34Z","timestamp":1127242654000},"page":"611-626","source":"Crossref","is-referenced-by-count":58,"title":["Computing the geodesic center of a simple polygon"],"prefix":"10.1007","volume":"4","author":[{"given":"R.","family":"Pollack","sequence":"first","affiliation":[]},{"given":"M.","family":"Sharir","sequence":"additional","affiliation":[]},{"given":"G.","family":"Rote","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1989,12,1]]},"reference":[{"key":"BF02187751_CR1","unstructured":"Asano, T., and Toussaint, G. T. (1985). Computing the geodesic center of a simple polygon, Technical Report SOCS-85.32, McGill University."},{"key":"BF02187751_CR2","doi-asserted-by":"crossref","unstructured":"Chazelle, B. (1982). A theorem on polygon cutting with applications,Proc. 23rd IEEE Symp. on Foundations of Computer Science, pp. 339\u2013349.","DOI":"10.1109\/SFCS.1982.58"},{"key":"BF02187751_CR3","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1137\/0213003","volume":"13","author":"M. E. Dyer","year":"1984","unstructured":"Dyer, M. E. (1984). Linear-time algorithms for two- and three-variable linear programs,SIAM J. Comput. 13, pp. 31\u201345.","journal-title":"SIAM J. Comput."},{"key":"BF02187751_CR4","doi-asserted-by":"crossref","first-page":"725","DOI":"10.1137\/0215052","volume":"15","author":"M. E. Dyer","year":"1986","unstructured":"Dyer, M. E. (1986). On a multidimensional search technique and its applications to the Euclidean one-center problem,SIAM J. Computing 15, pp. 725\u2013738.","journal-title":"SIAM J. Computing"},{"key":"BF02187751_CR5","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0020-0190(78)90062-5","volume":"7","author":"M. R. Garey","year":"1978","unstructured":"Garey, M. R., Johnson, D. S., Preparata, F. P., and Tarjan, R. E. (1978). Triangulating a simple polygon,Inform. Process. Lett. 7, pp. 175\u2013180.","journal-title":"Inform. Process. Lett."},{"key":"BF02187751_CR6","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF01840360","volume":"2","author":"L. Guibas","year":"1987","unstructured":"Guibas, L., Hershberger, J., Leven, D., Sharir, M., and Tarjan, R. E. (1987). Linear-time algorithms for visibility and shortest path problems inside a triangulated simple polygon,Algorithmica 2, pp. 209\u2013233.","journal-title":"Algorithmica"},{"issue":"3","key":"BF02187751_CR7","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1002\/net.3230140304","volume":"14","author":"D. T. Lee","year":"1984","unstructured":"Lee, D. T., and Preparata, F. P. (1984). Euclidean shortest paths in the presence of rectilinear barriers,Networks 14(3), pp. 393\u2013410.","journal-title":"Networks"},{"key":"BF02187751_CR8","doi-asserted-by":"crossref","unstructured":"Lenhart, W., Pollack, R., Sack, J., Seidel, R., Sharir, M., Suri, S., Toussaint, G. T., Yap, C., and Whitesides, S. (1987). Computing the link center of a simple polygon,Proc. 3rd ACM Symp. on Computational Geometry, pp. 1\u201310.","DOI":"10.1145\/41958.41959"},{"key":"BF02187751_CR9","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1137\/0212052","volume":"12","author":"N. Megiddo","year":"1983","unstructured":"Megiddo, N. (1983). Linear-time algorithms for linear programming in R3 and related problems,SIAM J. Comput. 12, pp. 759\u2013776.","journal-title":"SIAM J. Comput."},{"key":"BF02187751_CR10","doi-asserted-by":"crossref","first-page":"852","DOI":"10.1145\/2157.322410","volume":"30","author":"N. Megiddo","year":"1983","unstructured":"Megiddo, N. (1983). Applying parallel computation algorithms in the design of serial algorithms,J. Assoc. Comput. Mach. 30, pp. 852\u2013866.","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF02187751_CR11","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/2422.322418","volume":"31","author":"N. Megiddo","year":"1984","unstructured":"Megiddo, N. (1984). Linear programming in linear time when the dimension is fixed,J. Assoc. Comput. Mach. 31, pp. 114\u2013127.","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF02187751_CR12","doi-asserted-by":"crossref","unstructured":"Megiddo, N. (1989). On the ball spanned by balls,Discrete Comput. Geom., this issue, pp. 605\u2013610.","DOI":"10.1007\/BF02187750"},{"key":"BF02187751_CR13","unstructured":"Pollack, R., and Sharir, M. (1986). Computing the geodesic center of a simple polygon, Technical Report 231, Computer Science Department, Courant Institute, New York University, September 1986."},{"key":"BF02187751_CR14","unstructured":"Suri, S. (1986). Computing the geodesic diameter of a simple polygon, Technical Report JHU\/EECS-86\/08, Department of Electrical Engineering and Computer Science, Johns Hopkins University."},{"key":"BF02187751_CR15","unstructured":"Suri, S. (1986). Polygon partitioning techniques for link distance problems, Technical Report, Department of Electrical Engineering and Computer Science, Johns Hopkins University."},{"key":"BF02187751_CR16","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1137\/0217010","volume":"17","author":"R. E. Tarjan","year":"1988","unstructured":"Tarjan, R. E., and Van Wyk, C. J. (1988). AnO(n log logn)-time algorithm for triangulating simple polygons,SIAM J. Comput. 17, pp. 143\u2013178.","journal-title":"SIAM J. Comput."},{"key":"BF02187751_CR17","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0020-0190(84)90014-0","volume":"18","author":"E. Zemel","year":"1984","unstructured":"Zemel, E. (1984). AnO(n) algorithm for the linear multiple choice knapsack problem and related problems,Inform. Process. Lett. 18, pp. 123\u2013128.","journal-title":"Inform. Process. Lett."}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02187751.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02187751\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02187751","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T17:22:34Z","timestamp":1557854554000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02187751"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,12]]},"references-count":17,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1989,12]]}},"alternative-id":["BF02187751"],"URL":"https:\/\/doi.org\/10.1007\/bf02187751","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,12]]}}}