{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:24:49Z","timestamp":1725665089942},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642280757"},{"type":"electronic","value":"9783642280764"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-28076-4_7","type":"book-chapter","created":{"date-parts":[[2012,2,27]],"date-time":"2012-02-27T13:53:14Z","timestamp":1330350794000},"page":"40-51","source":"Crossref","is-referenced-by-count":1,"title":["Tight Bound for Farthest-Color Voronoi Diagrams of Line Segments"],"prefix":"10.1007","author":[{"given":"Sang Won","family":"Bae","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","unstructured":"Abellanas, M., Hurtado, F., Icking, C., Klein, R., Langetepe, E., Ma, L., Palop, B., Sacrist\u00e1n, V.: The farthest color Voronoi diagram and related problems. Technical Report 002, Rheinische Friedrich\u2013Wilhelms\u2013Universit\u00e4t Bonn (2006)"},{"key":"7_CR2","unstructured":"Aurenhammer, F., Klein, R.: Voronoi diagrams. In: Sack, J.R., Urrutia, J. (eds.) Handbook of Computational Geometry. Elsevier (2000)"},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1109\/TC.1979.1675432","volume":"C-28","author":"J.L. Bentley","year":"1979","unstructured":"Bentley, J.L., Ottman, T.A.: Algorithms for reporting and counting geometric intersections. IEEE Trans. Comput.\u00a0C-28, 643\u2013647 (1979)","journal-title":"IEEE Trans. Comput."},{"key":"7_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04245-8","volume-title":"Computationsl Geometry: Alogorithms and Applications","author":"M. Berg de","year":"2000","unstructured":"de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computationsl Geometry: Alogorithms and Applications, 2nd edn. Springer, Heidelberg (2000)","edition":"2"},{"key":"7_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/147508.147511","volume":"39","author":"B. Chazelle","year":"1992","unstructured":"Chazelle, B., Edelsbrunner, H.: An optimal algorithm for intersecting line segments in the plane. J. ACM\u00a039, 1\u201354 (1992)","journal-title":"J. ACM"},{"issue":"4","key":"7_CR6","doi-asserted-by":"publisher","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 and Appl.\u00a044(4), 234\u2013247 (2011)","journal-title":"Comput. Geom.: Theory and Appl."},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0020-0190(89)90136-1","volume":"33","author":"J. Hershberger","year":"1989","unstructured":"Hershberger, J.: Finding the upper envelope of n line segments in O(nlogn) time. Inform. Proc. Lett.\u00a033, 169\u2013174 (1989)","journal-title":"Inform. Proc. Lett."},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/BF02189323","volume":"9","author":"D.P. Huttenlocher","year":"1993","unstructured":"Huttenlocher, D.P., Kedem, K., Sharir, M.: The upper envelope of Voronoi surfaces and its applications. Discrete Comput. Geom.\u00a09, 267\u2013291 (1993)","journal-title":"Discrete Comput. Geom."},{"key":"7_CR9","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. LNCS, vol.\u00a0400. Springer, Heidelberg (1989)"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Lee, C., Shin, D., Bae, S.W., Choi, S.: Best and worst-case coverage problems for arbitrary paths in wireless sensor networks. In: Proc. IEEE 7th Int. Conf. Mobile Adhoc and Sensor Systems (MASS 2010), pp. 127\u2013136 (2010)","DOI":"10.1109\/MASS.2010.5663957"},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1145\/322217.322219","volume":"27","author":"D.T. Lee","year":"1980","unstructured":"Lee, D.T.: Two-dimensional Voronoi diagrams in the L\n                  \n                    p\n                  -metric. J. ACM\u00a027, 604\u2013618 (1980)","journal-title":"J. ACM"},{"issue":"6","key":"7_CR12","doi-asserted-by":"publisher","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. Internat. J. Comput. Geom. Appl.\u00a011(6), 583\u2013616 (2001)","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"7_CR13","doi-asserted-by":"publisher","DOI":"10.1002\/9780470317013","volume-title":"Spatial Tessellations: Concepts and Applications of Voronoi Diagrams","author":"A. Okabe","year":"2000","unstructured":"Okabe, A., Boots, B., Sugihara, K., Chiu, S.N.: Spatial Tessellations: Concepts and Applications of Voronoi Diagrams, 2nd edn. John Wiley and Sons, New York (2000)","edition":"2"},{"key":"7_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry: An Introduction","author":"F. Preparata","year":"1985","unstructured":"Preparata, F., Shamos, M.: Computational Geometry: An Introduction. Springer, Heidelberg (1985)"},{"key":"7_CR15","volume-title":"Davenport-Schinzel Sequences and Their Geometric Applications","author":"M. Sharir","year":"1995","unstructured":"Sharir, M., Agarwal, P.K.: Davenport-Schinzel Sequences and Their Geometric Applications. Cambridge University Press, New York (1995)"},{"issue":"1","key":"7_CR16","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF02187890","volume":"2","author":"C.K. Yap","year":"1987","unstructured":"Yap, C.K.: An O(n logn) algorithm for the Voronoi diagram of a set of simple curve segments. Discrete Comput. Geom.\u00a02(1), 365\u2013393 (1987)","journal-title":"Discrete Comput. Geom."}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-28076-4_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T06:45:09Z","timestamp":1556433909000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-28076-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642280757","9783642280764"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28076-4_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}