{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:31:55Z","timestamp":1759638715893},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642226151"},{"type":"electronic","value":"9783642226168"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-22616-8_35","type":"book-chapter","created":{"date-parts":[[2011,7,30]],"date-time":"2011-07-30T01:25:42Z","timestamp":1311989142000},"page":"448-463","source":"Crossref","is-referenced-by-count":2,"title":["Kinetic Red-Blue Minimum Separating Circle"],"prefix":"10.1007","author":[{"given":"Yam Ki","family":"Cheung","sequence":"first","affiliation":[]},{"given":"Ovidiu","family":"Daescu","sequence":"additional","affiliation":[]},{"given":"Marko","family":"Zivanic","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"35_CR1","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1142\/S0218195998000187","volume":"8","author":"G. Albers","year":"1998","unstructured":"Albers, G., Guibas, L.J., Mitchell, J.S.B., Roos, T.: Voronoi diagrams of moving points. Int. J. Comput. Geometry Appl.\u00a08(3), 365\u2013380 (1998)","journal-title":"Int. J. Comput. Geometry Appl."},{"key":"35_CR2","unstructured":"Aronov, B., Rappaport, D., Seara, C., Garijo, D., N\u00fa\u00f1ez, Y., Urrutia, J.: Measuring the error of linear separators on linearly inseparable data. In: XIII Encuentros de Geometria Computacional, Zaragoza, Espa\u00f1a (2009)"},{"key":"35_CR3","doi-asserted-by":"crossref","unstructured":"Atallah, M.J.: Dynamic computational geometry (preliminary version). In: FOCS, pp. 92\u201399 (1983)","DOI":"10.1109\/SFCS.1983.13"},{"issue":"1","key":"35_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jagm.1998.0988","volume":"31","author":"J. Basch","year":"1999","unstructured":"Basch, J., Guibas, L.J., Hershberger, J.: Data structures for mobile data. J. Algorithms\u00a031(1), 1\u201328 (1999)","journal-title":"J. Algorithms"},{"key":"35_CR5","doi-asserted-by":"crossref","unstructured":"Basch, J., Guibas, L.J., Silverstein, C., Zhang, L.: A practical evaluation of kinetic data structures. In: Symposium on Computational Geometry, pp. 388\u2013390 (1997)","DOI":"10.1145\/262839.263016"},{"key":"35_CR6","doi-asserted-by":"crossref","unstructured":"Bitner, S., Cheung, Y.K., Daescu, O.: Minimum separating circle for bichromatic points in the plane. In: ISVD, pp. 50\u201355 (2010)","DOI":"10.1109\/ISVD.2010.14"},{"key":"35_CR7","unstructured":"Demain, E., Einsenstat, S., Guibas, L., Schulz, A.: Kinetic minimum spanning circle. In: Proceedings of the Fall Workshop on Computational Geometry, New York, USA (2010)"},{"issue":"1","key":"35_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S0218195906001902","volume":"16","author":"J.S.B. Mitchell","year":"2006","unstructured":"Mitchell, J.S.B., Seara, C., Arkin, E.M., Hurtado, F., Skiena, S.: Some lower bounds on geometric separability problems. Int. J. Comput. Geometry Appl.\u00a016(1), 1\u201326 (2006)","journal-title":"Int. J. Comput. Geometry Appl."},{"issue":"2","key":"35_CR9","first-page":"167","volume":"15","author":"C. Seara","year":"2005","unstructured":"Seara, C., Hurtado, F., Sethia, S.: Red-blue separability problems in 3d. International Journal of Computational Geometry\u00a015(2), 167\u2013192 (2005)","journal-title":"International Journal of Computational Geometry"},{"key":"35_CR10","unstructured":"Fekete, S.: On the complexity of min-link red-blue separation (1992) (manuscript)"},{"key":"35_CR11","doi-asserted-by":"crossref","unstructured":"Fisk, S.: Separating point sets by circles, and the recognition of digital disks. IEEE Transactions on Pattern Analysis and Machine Intelligence, 554\u2013556 (July 1986)","DOI":"10.1109\/TPAMI.1986.4767821"},{"key":"35_CR12","unstructured":"Guibas, L.J.: Kinetic data structures: a state of the art report. In: WAFR 1998 (1998)"},{"issue":"1-2","key":"35_CR13","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/j.dam.2003.11.014","volume":"144","author":"F. Hurtado","year":"2004","unstructured":"Hurtado, F., Mora, M., Ramos, P.A., Seara, C.: Separability by two lines and by nearly straight polygonal chains. Discrete Applied Mathematics\u00a0144(1-2), 110\u2013122 (2004)","journal-title":"Discrete Applied Mathematics"},{"issue":"1-2","key":"35_CR14","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/S0166-218X(00)00230-4","volume":"109","author":"F. Hurtado","year":"2001","unstructured":"Hurtado, F., Noy, M., Ramos, P.A., Seara, C.: Separating objects in the plane by wedges and strips. Discrete Applied Mathematics\u00a0109(1-2), 109\u2013138 (2001)","journal-title":"Discrete Applied Mathematics"},{"issue":"4","key":"35_CR15","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1137\/0212052","volume":"12","author":"N. Megiddo","year":"1983","unstructured":"Megiddo, N.: Linear-time algorithms for linear programming in R 3 and related problems. SIAM Journal on Computing\u00a012(4), 759\u2013776 (1983)","journal-title":"SIAM Journal on Computing"},{"key":"35_CR16","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF02187688","volume":"1","author":"J. O\u2019Rourke","year":"1986","unstructured":"O\u2019Rourke, J., Kosaraju, S., Megiddo, N.: Computing circular separability. Discrete Computational Geometry\u00a01, 105\u2013113 (1986)","journal-title":"Discrete Computational Geometry"},{"key":"35_CR17","doi-asserted-by":"crossref","unstructured":"Rahmati, Z., Zarei, A.: Combinatorial changes of euclidean minimum spanning tree of moving points in the plane. In: CCCG, pp. 43\u201345 (2010)","DOI":"10.1007\/978-3-642-25011-8_21"},{"issue":"3","key":"35_CR18","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0166-218X(93)90115-5","volume":"43","author":"T. Roos","year":"1993","unstructured":"Roos, T.: Voronoi diagrams over dynamic scenes. Discrete Applied Mathematics\u00a043(3), 243\u2013259 (1993)","journal-title":"Discrete Applied Mathematics"},{"key":"35_CR19","doi-asserted-by":"crossref","unstructured":"Skyum, S.: A simple algorithm for computing the smallest enclosing circle. Information Processing Letters\u00a037(3) (1991)","DOI":"10.1016\/0020-0190(91)90030-L"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22616-8_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T05:29:26Z","timestamp":1638163766000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22616-8_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642226151","9783642226168"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22616-8_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}