{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:26:39Z","timestamp":1725459999119},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540584346"},{"type":"electronic","value":"9783540487944"}],"license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/bfb0049395","type":"book-chapter","created":{"date-parts":[[2006,3,6]],"date-time":"2006-03-06T13:42:35Z","timestamp":1141652555000},"page":"36-47","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Hamiltonian triangulations for fast rendering"],"prefix":"10.1007","author":[{"given":"Esther M.","family":"Arkin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Held","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joseph S. B.","family":"Mitchell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steven S.","family":"Skiena","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,2,23]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/BF02187874","volume":"2","author":"D. Avis","year":"1987","unstructured":"D. Avis and H. ElGindy. Triangulating point sets in space. Discrete Comput. Geom., 2:99\u2013111, 1987.","journal-title":"Discrete Comput. Geom."},{"key":"5_CR2","series-title":"LNCS Vol. 1","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1142\/9789814355858_0002","volume-title":"Computing in Euclidean Geometry","author":"M. Bern","year":"1992","unstructured":"M. Bern and D. Eppstein. Mesh generation and optimal triangulation. In D.-Z. Du and F. K. Hwang, editors, Computing in Euclidean Geometry, LNCS Vol. 1, pp. 23\u201390. World Scientific, Singapore, 1992."},{"key":"5_CR3","unstructured":"R. Cassidy, E. Gregg, R. Reeves, and J. Turmelle. IGL: The graphics library for the i860, March 22, 1991."},{"key":"5_CR4","first-page":"441","volume-title":"Worst-case analysis of a new heuristic for the traveling salesman problem","author":"N. Christofides","year":"1976","unstructured":"N. Christofides. Worst-case analysis of a new heuristic for the traveling salesman problem. In J. F. Traub, editor, Sympos. on New Directions and Recent Results in Algorithms and Complexity, page 441, New York, NY, 1976. Academic Press."},{"key":"5_CR5","first-page":"292","volume":"391","author":"H. Crapo","year":"1989","unstructured":"H. Crapo and J-P. Laumond. Hamiltonian cycles in Delaunay complexes. Geometry and Robotics Workshop Proceedings, Springer-Verlag LNCS Vol. 391, pp. 292\u2013305, 1989.","journal-title":"Springer-Verlag LNCS"},{"key":"5_CR6","unstructured":"G. Das, P. Heffernan, and G. Narasimhan. LR-Visibility in polygons. In Proc. 5th Canad. Conf. Comput. Geom., pages 303\u2013308, Waterloo, Canada, 1993."},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0020-0190(87)90124-4","volume":"25","author":"M. B. Dillencourt","year":"1987","unstructured":"M. B. Dillencourt. A non-Hamiltonian, nondegenerate Delaunay triangulation. Inform. Process. Lett., 25:149\u2013151, 1987.","journal-title":"Inform. Process. Lett."},{"key":"5_CR8","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1002\/jgt.3190140105","volume":"14","author":"M. B. Dillencourt","year":"1990","unstructured":"M. B. Dillencourt. Hamiltonian cycles in planar triangulations with no separating triangles. J. Graph Theory, 14:31\u201349, 1990.","journal-title":"J. Graph Theory"},{"key":"5_CR9","unstructured":"M. B. Dillencourt. Finding Hamiltonian cycles in Delaunay triangulations is NP-complete. In Proc. 4th Canad. Conf. Comput. Geom., pages 223\u2013228, 1992."},{"key":"5_CR10","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1137\/0205049","volume":"5","author":"M. Garey","year":"1976","unstructured":"M. Garey, D. Johnson, and R. Tarjan. The planar Hamiltonian circuit problem is NP-complete. SIAM J. Computing, 5:704\u2013714, 1976.","journal-title":"SIAM J. Computing"},{"key":"5_CR11","unstructured":"F. Gray. Pulse code communication. United States Patent Number 2,632,058, March 17, 1953."},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/BF01553883","volume":"4","author":"J. Hershberger","year":"1989","unstructured":"J. Hershberger. An optimal visibility graph algorithm for triangulated simple polygons. Algorithmica, 4:141\u2013155, 1989.","journal-title":"Algorithmica"},{"key":"5_CR13","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1016\/S0734-189X(87)80169-X","volume":"39","author":"J. O'Rourke","year":"1987","unstructured":"J. O'Rourke, H. Booth, and R. Washington. Connect-the-dots: a new heuristic. Comput. Vision Graph. Image Process., 39:258\u2013266, 1987.","journal-title":"Comput. Vision Graph. Image Process."},{"key":"5_CR14","unstructured":"N. Prabhu. Hamiltonian simple polytopes. Technical Report 90-17, DIMACS, Rutgers Univ., 1990."},{"key":"5_CR15","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1016\/0196-6774(89)90007-2","volume":"10","author":"C. Savage","year":"1989","unstructured":"C. Savage. Gray code sequences of partitions. J. Algorithms, 10:577\u2013595, 1989.","journal-title":"J. Algorithms"},{"key":"5_CR16","unstructured":"T. Shermer, private communication, April 1994."},{"key":"5_CR17","unstructured":"Silicon Graphics, Inc. Graphics library programming guide, 1991."},{"key":"5_CR18","unstructured":"L. H. Tseng and D. T. Lee, \u201cTwo-Guard Walkability of Simple Polygons\u201d, manuscript, 1992."},{"key":"5_CR19","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970166","volume-title":"Combinatorial Algorithms: An Update","author":"H. Wilf","year":"1989","unstructured":"H. Wilf. Combinatorial Algorithms: An Update. Society for Industrial and Applied Mathematics, Philadelphia, 1989."},{"key":"5_CR20","first-page":"275","volume":"391","author":"M. Yvinec","year":"1989","unstructured":"M. Yvinec. Triangulation in 2D and 3D space. Geometry and Robotics Workshop Proceedings, Springer-Verlag LNCS Vol. 391, pp. 275\u2013291, 1989.","journal-title":"Springer-Verlag LNCS"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2014 ESA '94"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0049395","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T09:12:03Z","timestamp":1558257123000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0049395"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540584346","9783540487944"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/bfb0049395","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]},"assertion":[{"value":"23 February 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}