{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T11:01:27Z","timestamp":1725879687835},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319530062"},{"type":"electronic","value":"9783319530079"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-53007-9_3","type":"book-chapter","created":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T05:13:23Z","timestamp":1486012403000},"page":"24-36","source":"Crossref","is-referenced-by-count":3,"title":["Voronoi Diagram for Convex Polygonal Sites with Convex Polygon-Offset Distance Function"],"prefix":"10.1007","author":[{"given":"Gill","family":"Barequet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Minati","family":"De","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,1,26]]},"reference":[{"issue":"6","key":"3_CR1","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1016\/j.ipl.2006.07.008","volume":"100","author":"F Aurenhammer","year":"2006","unstructured":"Aurenhammer, F., Drysdale, R.L.S., Krasser, H.: Farthest line segment Voronoi diagrams. Inf. Process. Lett. 100(6), 220\u2013225 (2006)","journal-title":"Inf. Process. Lett."},{"key":"3_CR2","doi-asserted-by":"crossref","DOI":"10.1142\/8685","volume-title":"Voronoi Diagrams and Delaunay Triangulations","author":"F Aurenhammer","year":"2013","unstructured":"Aurenhammer, F., Klein, R., Lee, D.-T.: Voronoi Diagrams and Delaunay Triangulations. World Scientific, Singapore (2013)"},{"issue":"2","key":"3_CR3","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/s004540010081","volume":"25","author":"G Barequet","year":"2001","unstructured":"Barequet, G., Dickerson, M.T., Goodrich, M.T.: Voronoi diagrams for convex polygon-offset distance functions. Discret. Comput. Geom. 25(2), 271\u2013291 (2001)","journal-title":"Discret. Comput. Geom."},{"issue":"8","key":"3_CR4","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1016\/j.comgeo.2015.04.008","volume":"48","author":"C Bohler","year":"2015","unstructured":"Bohler, C., Cheilaris, P., Klein, R., Liu, C.-H., Papadopoulou, E., Zavershynskyi, M.: On the complexity of higher order abstract Voronoi diagrams. Comput. Geom. Theory Appl. 48(8), 539\u2013551 (2015)","journal-title":"Comput. Geom. Theory Appl."},{"issue":"4","key":"3_CR5","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1016\/j.comgeo.2010.11.004","volume":"44","author":"O Cheong","year":"2011","unstructured":"Cheong, O., Everett, H., Glisse, M., Gudmundsson, J., Hornus, S., Lazard, S., Lee, M., Na, H.-S.: Farthest-polygon Voronoi diagrams. Comput. Geom. Theory Appl. 44(4), 234\u2013247 (2011)","journal-title":"Comput. Geom. Theory Appl."},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Chew, L.P., Drysdale III, R.L.S.: Voronoi diagrams based on convex distance functions. In: O\u2019Rourke, J. (ed.) Proceedings of the First Annual Symposium on Computational Geometry, Baltimore, Maryland, USA, 5\u20137 June 1985, pp. 235\u2013244. ACM (1985)","DOI":"10.1145\/323233.323264"},{"key":"3_CR7","volume-title":"Principia Philosophiae","author":"R Descartes","year":"1644","unstructured":"Descartes, R.: Principia Philosophiae. Ludovicus Elzevirius, Amsterdam (1644)"},{"key":"3_CR8","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/BF01840357","volume":"2","author":"S Fortune","year":"1987","unstructured":"Fortune, S.: A sweepline algorithm for Voronoi diagrams. Algorithmica 2, 153\u2013174 (1987)","journal-title":"Algorithmica"},{"key":"3_CR9","volume-title":"Linear Topological Spaces","author":"JL Kelley","year":"1976","unstructured":"Kelley, J.L., Namioka, I.: Linear Topological Spaces. Springer, Heidelberg (1976)"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Kirkpatrick, D.G.: Efficient computation of continuous skeletons. In: 20th Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, 29\u201331 October 1979, pp. 18\u201327. IEEE Computer Society (1979)","DOI":"10.1109\/SFCS.1979.15"},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-52055-4","volume-title":"Concrete and Abstract Voronoi Diagrams","author":"R Klein","year":"1989","unstructured":"Klein, R.: Concrete and Abstract Voronoi Diagrams. Lecture Notes in Computer Science, vol. 400. Springer, Heidelberg (1989)"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/BFb0035852","volume-title":"STACS 88","author":"R Klein","year":"1988","unstructured":"Klein, R., Wood, D.: Voronoi diagrams based on general metrics in the plane. In: Cori, R., Wirsing, M. (eds.) STACS 1988. LNCS, vol. 294, pp. 281\u2013291. Springer, Heidelberg (1988). doi: 10.1007\/BFb0035852"},{"key":"3_CR13","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF02187867","volume":"2","author":"D Leven","year":"1987","unstructured":"Leven, D., Sharir, M.: Planning a purely translational motion for a convex object in two-dimensional space using generalized Voronoi diagrams. Discret. Comput. Geom. 2, 9\u201331 (1987)","journal-title":"Discret. Comput. Geom."},{"issue":"1","key":"3_CR14","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/BF02716580","volume":"15","author":"M McAllister","year":"1996","unstructured":"McAllister, M., Kirkpatrick, D.G., Snoeyink, J.: A compact piecewise-linear Voronoi diagram for convex sites in the plane. Discret. Comput. Geom. 15(1), 73\u2013105 (1996)","journal-title":"Discret. Comput. Geom."},{"issue":"6","key":"3_CR15","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1142\/S0218195901000663","volume":"11","author":"K Mehlhorn","year":"2001","unstructured":"Mehlhorn, K., Meiser, S., Rasch, R.: Furthest site abstract Voronoi diagrams. Int. J. Comput. Geom. Appl. 11(6), 583\u2013616 (2001)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"6","key":"3_CR16","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1142\/S0218195913600121","volume":"23","author":"E Papadopoulou","year":"2013","unstructured":"Papadopoulou, E., Dey, S.K.: On the farthest line-segment Voronoi diagram. Int. J. Comput. Geometry Appl. 23(6), 443\u2013460 (2013)","journal-title":"Int. J. Comput. Geometry Appl."},{"key":"3_CR17","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF02187890","volume":"2","author":"C-K Yap","year":"1987","unstructured":"Yap, C.-K.: An O $$(n \\log n)$$ ( n log n ) algorithm for the Voronoi diagram of a set of simple curve segments. Discret. Comput. Geom. 2, 365\u2013393 (1987)","journal-title":"Discret. Comput. Geom."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-53007-9_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T05:35:19Z","timestamp":1498368919000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-53007-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319530062","9783319530079"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-53007-9_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}