{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T20:34:42Z","timestamp":1771533282745,"version":"3.50.1"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[1996,9,1]],"date-time":"1996-09-01T00:00:00Z","timestamp":841536000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Visual Computer"],"published-print":{"date-parts":[[1996,9]]},"DOI":"10.1007\/bf01782475","type":"journal-article","created":{"date-parts":[[2005,6,19]],"date-time":"2005-06-19T03:53:08Z","timestamp":1119153188000},"page":"429-444","source":"Crossref","is-referenced-by-count":51,"title":["Hamiltonian triangulations for fast rendering"],"prefix":"10.1007","volume":"12","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","reference":[{"key":"BF01782475_CR1","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BF02187874","volume":"2","author":"D Avis","year":"1987","unstructured":"Avis D, ElGindy H (1987) Triangulating point sets in space. Discrete Comput Geom 2:99\u2013111","journal-title":"Discrete Comput Geom"},{"key":"BF01782475_CR2","series-title":"Lecture Notes in Computer Science","volume-title":"Mesh generation and optimal triangulation. Computing in Euclidean geometry","author":"M Bern","year":"1992","unstructured":"Bern M, Eppstein D (1992) Mesh generation and optimal triangulation. Computing in Euclidean geometry. (Lecture Notes in Computer Science, Vol 1) World Scientific, Singapore"},{"key":"BF01782475_CR3","volume-title":"Polygonal ribbons in two and three dimensions","author":"P Bhattacharya","year":"1994","unstructured":"Bhattacharya P, Rosenfeld A (1994) Polygonal ribbons in two and three dimensions. Report, Department of Computer Science, University of Maryland, College Park, MD"},{"key":"BF01782475_CR4","series-title":"Technical Report","volume-title":"No quadrangulation is extremely odd","author":"J Bose","year":"1995","unstructured":"Bose J, Toussaint G (1995) No quadrangulation is extremely odd. Technical Report 95-03, Department of Computer Science, University of British Columbia, Vancouver, BC"},{"key":"BF01782475_CR5","unstructured":"Cassidy R, Gregg E, Reeves R, Turmelle J (1991) IGL: the graphics library for the i860"},{"key":"BF01782475_CR6","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1109\/TIT.1985.1057060","volume":"IT-31","author":"B Chazelle","year":"1985","unstructured":"Chazelle B (1985) On the convex layers of a planar set. IEEE Trans Inform Theory IT-31:509\u2013517","journal-title":"IEEE Trans Inform Theory"},{"key":"BF01782475_CR7","first-page":"441","volume-title":"Symposium on New Directions and Recent Results in Algorithms and Complexity","author":"N Christofides","year":"1976","unstructured":"Christofides N (1976) Worst-case analysis of a new heuristic for the traveling salesman problem. In: Traub JF (ed) Symposium on New Directions and Recent Results in Algorithms and Complexity, New York, Academic Press, p 441"},{"key":"BF01782475_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1007\/3-540-51683-2_36","volume-title":"Hamiltonian cycles in Delaunay complexes","author":"H Croap","year":"1989","unstructured":"Croap H, Laumond JP (1989) Hamiltonian cycles in Delaunay complexes. Geometry and Robotics Workshop Proceedings, Toulouse, France (Lecture Notes in Computer Science, vol 391). Springer, Berlin Heildelberg New York, pp 292\u2013305"},{"key":"BF01782475_CR9","unstructured":"Das G, Heffernan P, Narasimhan G (1993) LR-visibility in polygons. Proceedings of the 5th Canadian Conference on Computational Geometry, Waterloo, Canada, pp 303\u2013308"},{"key":"BF01782475_CR10","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0020-0190(87)90124-4","volume":"25","author":"MB Dillencourt","year":"1987","unstructured":"Dillencourt MB (1987) A non-Hamiltonian, nondegenerate Delaunay triangulation. Inform Process Lett 25:149\u2013151","journal-title":"Inform Process Lett"},{"key":"BF01782475_CR11","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1002\/jgt.3190140105","volume":"14","author":"MB Dillencourt","year":"1990","unstructured":"Dillencourt MB (1990) Hamiltonian cycles in planar triangulations with no separating triangles. J Graph Theory 14:31\u201349","journal-title":"J Graph Theory"},{"key":"BF01782475_CR12","unstructured":"Dillencourt MB (1992) Finding Hamiltonian cycles in Delaunay triangulations is NP-complete. Proceedings of the 4th Canadian Conference on Computational Geometry, St. John's, Newfoundland, Canada, pp 223\u2013228"},{"key":"BF01782475_CR13","doi-asserted-by":"crossref","first-page":"704","DOI":"10.1137\/0205049","volume":"5","author":"M Garey","year":"1976","unstructured":"Garey M, Johnson D, Tarjan R (1976) The planar Hamiltonian circuit problem is NP-complete. SIAM J Comput 5:704\u2013714","journal-title":"SIAM J Comput"},{"key":"BF01782475_CR14","first-page":"632","volume":"2","author":"F Gray","year":"1953","unstructured":"Gray F (1953) Pulse code communication. United States Patent Number 2:632\u2013058","journal-title":"United States Patent Number"},{"key":"BF01782475_CR15","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF01553883","volume":"4","author":"J Hershberger","year":"1989","unstructured":"Hershberger J (1989) An optimal visibility graph algorithm for triangulated simple polygons. Algorithmica 4:141\u2013155","journal-title":"Algorithmica"},{"key":"BF01782475_CR16","volume-title":"Solid shape","author":"J Koenderink","year":"1989","unstructured":"Koenderink J (1989) Solid shape, MIT Press, MA"},{"key":"BF01782475_CR17","doi-asserted-by":"crossref","unstructured":"Narasimhan G (1996) On Hamiltonian triangulations in simple polygons. Unpublished manuscript","DOI":"10.1007\/3-540-63307-3_71"},{"key":"BF01782475_CR18","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1109\/TIT.1983.1056648","volume":"29","author":"J O'Rourke","year":"1983","unstructured":"O'Rourke J, Supowit KJ (1983) SomeN P-hard polygon decomposition problems. IEEE Trans Inform Theory IT 29:181\u2013190","journal-title":"IEEE Trans Inform Theory IT"},{"key":"BF01782475_CR19","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1016\/S0734-189X(87)80169-X","volume":"39","author":"J O'Rourke","year":"1987","unstructured":"O'Rourke J, Booth H, Washington R (1987) Connect-thedots: a new heuristic. Comput Vision Graph Image Processing 39:258\u2013266","journal-title":"Comput Vision Graph Image Processing"},{"key":"BF01782475_CR20","series-title":"Technical Report","volume-title":"Hamiltonian simple polytopes","author":"N Prabhu","year":"1990","unstructured":"Prabhu N (1990) Hamiltonian simple polytopes. Technical Report 90-17, DIMACS, Rutgers University, New Brunswick, NJ"},{"key":"BF01782475_CR21","unstructured":"Ramaswami S, Ramos P, Toussaint G (1995) Converting triangulations to quadrangulations. Proceedings of the 7th Canadian Conference on Computational Geometry, Qu\u00e9bec, QU, Canada, pp 297\u2013302"},{"key":"BF01782475_CR22","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1016\/0196-6774(89)90007-2","volume":"10","author":"C Savage","year":"1989","unstructured":"Savage C (1989) Gray code sequences of partitions. J Algorithms 10:577\u2013595","journal-title":"J Algorithms"},{"key":"BF01782475_CR23","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/978-3-642-58043-7_3","volume-title":"New trends in discrete and computational geometry, vol 10 of Algorithms and combinatorics","author":"R Seidel","year":"1993","unstructured":"Seidel R (1993) Backwards analysis of randomized geometric algorithms, Pach J (ed) New trends in discrete and computational geometry, vol 10 of Algorithms and combinatorics. Springer, Berlin Heidelberg New York, pp 37\u201368"},{"key":"BF01782475_CR24","unstructured":"Silicon Graphics (1991) Graphics library programming guide"},{"key":"BF01782475_CR25","unstructured":"Tseng LH, Lee DT (1992) Two-guard walkability of simple polygons. Manuscript"},{"key":"BF01782475_CR26","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970166","volume-title":"Combinatorial algorithms: an update","author":"H Wilf","year":"1989","unstructured":"Wilf H (1989) Combinatorial algorithms: an update. Society for Industrial and Applied Mathematics. Philadelphia"},{"key":"BF01782475_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/3-540-51683-2_35","volume-title":"Triangulation in 2D and 3D space","author":"M Yvinec","year":"1989","unstructured":"Yvinec M (1989) Triangulation in 2D and 3D space. Geometry and Robotics Workshop Proceedings, Toulouse, France (Lecture Notes in Computer Science, vol 391). Springer, Berlin Heidelberg New York, pp 275\u2013291"}],"container-title":["The Visual Computer"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01782475.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01782475\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01782475","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T20:56:22Z","timestamp":1586292982000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01782475"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,9]]},"references-count":27,"journal-issue":{"issue":"9","published-print":{"date-parts":[[1996,9]]}},"alternative-id":["BF01782475"],"URL":"https:\/\/doi.org\/10.1007\/bf01782475","relation":{},"ISSN":["0178-2789","1432-2315"],"issn-type":[{"value":"0178-2789","type":"print"},{"value":"1432-2315","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,9]]}}}