{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:00:52Z","timestamp":1725483652100},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540005797"},{"type":"electronic","value":"9783540364771"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36477-3_14","type":"book-chapter","created":{"date-parts":[[2007,5,5]],"date-time":"2007-05-05T12:31:09Z","timestamp":1178368269000},"page":"191-205","source":"Crossref","is-referenced-by-count":3,"title":["Java Applets for the Dynamic Visualization of Voronoi Diagrams"],"prefix":"10.1007","author":[{"given":"Christian","family":"Icking","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rolf","family":"Klein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"K\u00f6llner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lihong","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,2,28]]},"reference":[{"issue":"6","key":"14_CR1","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/BF02187749","volume":"4","author":"A. Aggarwal","year":"1989","unstructured":"A. Aggarwal, L. J. Guibas, J. Saxe, and P. W. Shor. A linear-time algorithm for computing the Voronoi diagram of a convex polygon. Discrete Comput. Geom., 4(6):591\u2013604, 1989.","journal-title":"Discrete Comput. Geom."},{"key":"14_CR2","unstructured":"K. Arnold and J. Gosling. The Java Programming Language. Addison-Wesley, Reading, MA, 1996."},{"issue":"3","key":"14_CR3","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1145\/116873.116880","volume":"23","author":"F. Aurenhammer","year":"1991","unstructured":"F. Aurenhammer. Voronoi diagrams: A survey of a fundamental geometric data structure. ACM Comput. Surv., 23(3):345\u2013405, Sept. 1991.","journal-title":"ACM Comput. Surv."},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"F. Aurenhammer and R. Klein. Voronoi diagrams. In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry, pages 201\u2013290. Elsevier Science Publishers B.V. North-Holland, Amsterdam, 2000.","DOI":"10.1016\/B978-044482537-7\/50006-1"},{"issue":"4","key":"14_CR5","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1145\/234782.234792","volume":"27","author":"J. E. Baker","year":"1995","unstructured":"J. E. Baker, I. F. Cruz, G. Liotta, and R. Tamassia. A new model for algorithm animation over the WWW. ACM Computing Surveys, 27(4):568\u2013572, 1995.","journal-title":"ACM Computing Surveys"},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1006\/jagm.1994.1040","volume":"17","author":"H. Baumgarten","year":"1994","unstructured":"H. Baumgarten, H. Jung, and K. Mehlhorn. Dynamic point location in general subdivisions. J. Algorithms, 17:342\u2013380, 1994.","journal-title":"J. Algorithms"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"972","DOI":"10.1137\/0221057","volume":"21","author":"S. W. Cheng","year":"1992","unstructured":"S. W. Cheng and R. Janardan. New results on dynamic planar point location. SIAM J. Comput., 21:972\u2013999, 1992.","journal-title":"SIAM J. Comput."},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"L. P. Chew and R. L. Drysdale, III. Voronoi diagrams based on convex distance functions. In Proc. 1st Annu. ACM Sympos. Comput. Geom., pages 235\u2013244, 1985.","DOI":"10.1145\/323233.323264"},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1137\/S0097539792224516","volume":"25","author":"Y.-J. Chiang","year":"1996","unstructured":"Y.-J. Chiang, F. P. Preparata, and R. Tamassia. A unified approach to dynamic point location, ray shooting, and shortest paths in planar maps. SIAM J. Comput., 25:207\u2013233, 1996.","journal-title":"SIAM J. Comput."},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Y.-J. Chiang and R. Tamassia. Dynamization of the trapezoid method for planar point location. In Proc. 7th Annu. ACM Sympos. Comput. Geom., pages 61\u201370, 1991.","DOI":"10.1145\/109648.109655"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"A. G. Corbalan, M. Mazon, T. Recio, and F. Santos. On the topological shape of planar Voronoi diagrams. In Proc. 9th Annu. ACM Sympos. Comput. Geom., pages 109\u2013115, 1993.","DOI":"10.1145\/160985.161006"},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1007\/BF01759057","volume":"6","author":"L. Floriani De","year":"1991","unstructured":"L. De Floriani, B. Falcidieno, G. Nagy, and C. Pienovi. On sorting triangles in a Delaunay tessellation. Algorithmica, 6:522\u2013532, 1991.","journal-title":"Algorithmica"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"P. J. de Rezende and W. R. Jacometti. Animation of geometric algorithms using GeoLab. In Proc. 9th Annu. ACM Sympos. Comput. Geom., pages 401\u2013402, 1993.","DOI":"10.1145\/160985.161176"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"O. Devillers, S. Pion, and M. Teillaud. Walking in a triangulation. In Proc. 17th Annu. ACM Sympos. Comput. Geom., pages 106\u2013114, 2001.","DOI":"10.1145\/378583.378643"},{"key":"14_CR15","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/PL00009234","volume":"22","author":"L. Devroye","year":"1998","unstructured":"L. Devroye, E. P. M\u00fccke, and B. Zhu. A note on point location in Delaunay triangulations of random points. Algorithmica, 22:477\u2013482, 1998.","journal-title":"Algorithmica"},{"key":"14_CR16","unstructured":"R. L. Drysdale, III. A practical algorithm for computing the Delaunay triangulation for convex distance functions. In Proc. 1st ACM-SIAM Sympos. Discrete Algorithms, pages 159\u2013168, 1990."},{"key":"14_CR17","unstructured":"D. Flanagan. Java in a Nutshell. O'Reilly & Associates, Sebastopol, fourth edition, 2002."},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"L. J. Guibas, J. S. B. Mitchell, and T. Roos. Voronoi diagrams of moving points in the plane. In Proc. 17th Internat. Workshop Graph-Theoret. Concepts Comput. Sci., volume 570of Lecture Notes Comput. Sci., pages 113\u2013125. Springer-Verlag, 1992.","DOI":"10.1007\/3-540-55121-2_11"},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"D. P. Huttenlocher, K. Kedem, and J. M. Kleinberg. On dynamic Voronoi diagrams and the minimum Hausdorff distance for point sets under Euclidean motion in the plane. In Proc. 8th Annu. ACM Sympos. Comput. Geom., pages 110\u2013119, 1992.","DOI":"10.1145\/142675.142700"},{"key":"14_CR20","doi-asserted-by":"crossref","first-page":"331","DOI":"10.3233\/FI-1995-2242","volume":"22","author":"C. Icking","year":"1995","unstructured":"C. Icking, R. Klein, N.-M. L\u00ea, and L. Ma. Convex distance functions in 3-space are different. Fundam. Inform., 22:331\u2013352, 1995.","journal-title":"Fundam. Inform."},{"key":"14_CR21","unstructured":"M. J\u00f6nger, V. Kaibel, and S. Thienel. Computing Delaunay triangulations in Manhattan and maximum metric. Technical Report 174, Zentrum f\u00fcr Angewandte Informatik K\u00f6ln, 1994."},{"key":"14_CR22","unstructured":"P.-T. Kandzia and T. Ottmann. VIROR: The virtual university in the Upper Rhine Valley, a new challenge for four prestigious universities in Germany. In Proc. Role of Universities in the Future Information Society, 1999."},{"key":"14_CR23","unstructured":"R. Klein. Algorithmische Geometrie. Addison-Wesley, Bonn, 1997."},{"key":"14_CR24","unstructured":"L. Ma. Bisectors and Voronoi Diagrams for Convex Distance Functions. PhD thesis, Department of Computer Science, FernUniversit\u00e4t Hagen, Technical Report 267, 2000."},{"key":"14_CR25","unstructured":"H. Maurer and D. Kaiser. AUTOOL: A new system for computer assisted instruction. IIGReport 218, Inst. Informationsverarb., Tech. Univ. Graz, 1986."},{"key":"14_CR26","unstructured":"H. Maurer and F. S. Makedon. COSTOC: Computer supported teaching of computer science. In Proc. of IFIP Conference on Teleteaching, pages 107\u2013119. North-Holland, 1987."},{"key":"14_CR27","volume-title":"LEDA: A Platform for Combinatorial and Geometric Computing","author":"K. Mehlhorn","year":"2000","unstructured":"K. Mehlhorn and S. N\u00e4her. LEDA: A Platform for Combinatorial and Geometric Computing. Cambridge University Press, Cambridge, UK, 2000."},{"key":"14_CR28","unstructured":"J. Nievergelt, P. Schorn, M. de Lorenzi, C. Ammann, and A. Br\u00fcngger. XYZ: A project in experimental geometric computation. In Proc. Computational Geometry: Methods, Algorithms and Applications, volume 553 of Lecture Notes Comput. Sci., pages 171\u2013186. Springer-Verlag, 1991."},{"key":"14_CR29","doi-asserted-by":"crossref","unstructured":"S. Skyum. A sweepline algorithm for generalized Delaunay triangulations. Technical Report DAIMI PB-373, CS Dept., Aarhus University, 1991.","DOI":"10.7146\/dpb.v20i373.6605"}],"container-title":["Lecture Notes in Computer Science","Computer Science in Perspective"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36477-3_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,21]],"date-time":"2020-04-21T19:12:51Z","timestamp":1587496371000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36477-3_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540005797","9783540364771"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/3-540-36477-3_14","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}