{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T02:53:47Z","timestamp":1725677627513},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642296994"},{"type":"electronic","value":"9783642297007"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29700-7_4","type":"book-chapter","created":{"date-parts":[[2012,4,28]],"date-time":"2012-04-28T12:25:56Z","timestamp":1335615956000},"page":"36-46","source":"Crossref","is-referenced-by-count":1,"title":["Voronoi Diagram with Visual Restriction"],"prefix":"10.1007","author":[{"given":"Chenglin","family":"Fan","sequence":"first","affiliation":[]},{"given":"Jun","family":"Luo","sequence":"additional","affiliation":[]},{"given":"Wencheng","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Binhai","family":"Zhu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1145\/28395.28400","volume-title":"Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, STOC 1987","author":"A. Aggarwal","year":"1987","unstructured":"Aggarwal, A., Guibas, L., Saxe, J., Shor, P.: A linear time algorithm for computing the voronoi diagram of a convex polygon. In: Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, STOC 1987, pp. 39\u201345. ACM, New York (1987)"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1145\/116873.116880","volume":"23","author":"F. Aurenhammer","year":"1991","unstructured":"Aurenhammer, F.: Voronoi diagrams\u2013a survey of a fundamental geometric data structure. ACM Comput. Surv.\u00a023, 345\u2013405 (1991)","journal-title":"ACM Comput. Surv."},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1145\/126546.126548","volume":"22","author":"F. Aurenhammer","year":"1991","unstructured":"Aurenhammer, F., St\u00f6ckl, G.: On the Peeper\u2019s Voronoi diagram. SIGACT News\u00a022, 50\u201359 (1991)","journal-title":"SIGACT News"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Aurenhammer, F., Edelsbrunner, H.: An optimal algorithm for constructing the weighted voronoi diagram in the plane. In: Pattern Recognition, pp. 251\u2013257 (1984)","DOI":"10.1016\/0031-3203(84)90064-5"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry Algorithms and Applications. Springer (1997)","DOI":"10.1007\/978-3-662-03427-9"},{"key":"4_CR6","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/BF02187733","volume":"4","author":"H. Edelsbrunner","year":"1989","unstructured":"Edelsbrunner, H., Guibas, L.J., Sharir, M.: The upper envelope of piecewise linear functions: Algorithms and applications. Discrete & Computational Geometry\u00a04, 311\u2013336 (1989)","journal-title":"Discrete & Computational Geometry"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Fan, C., He, J., Luo, J., Zhu, B.: Moving network voronoi diagram. In: ISVD, pp. 142\u2013150 (2010)","DOI":"10.1109\/ISVD.2010.21"},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/BF01840357","volume":"2","author":"S. Fortune","year":"1987","unstructured":"Fortune, S.: A sweepline algorithm for voronoi diagrams. Algorithmica\u00a02, 153\u2013174 (1987)","journal-title":"Algorithmica"},{"issue":"5","key":"4_CR9","doi-asserted-by":"publisher","first-page":"724","DOI":"10.1109\/TIT.1983.1056738","volume":"29","author":"I.G. Gowda","year":"1983","unstructured":"Gowda, I.G., Kirkpatrick, D.G., Lee, D.T., Naamad, A.: Dynamic voronoi diagrams. IEEE Transactions on Information Theory\u00a029(5), 724\u2013730 (1983)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"4","key":"4_CR10","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/BF01758770","volume":"7","author":"L.J. Guibas","year":"1992","unstructured":"Guibas, L.J., Knuth, D.E., Sharir, M.: Randomized incremental construction of delaunay and voronoi diagrams. Algorithmica\u00a07(4), 381\u2013413 (1992)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics and Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29700-7_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:05:03Z","timestamp":1606187103000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29700-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642296994","9783642297007"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29700-7_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}