{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:59:47Z","timestamp":1725663587212},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540569398"},{"type":"electronic","value":"9783540478263"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56939-1_71","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:55:21Z","timestamp":1330257321000},"page":"177-188","source":"Crossref","is-referenced-by-count":4,"title":["A simple method for resolving degeneracies in Delaunay triangulations"],"prefix":"10.1007","author":[{"given":"Michael B.","family":"Dillencourt","sequence":"first","affiliation":[]},{"given":"Warren D.","family":"Smith","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"issue":"3","key":"15_CR1","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/116873.116880","volume":"23","author":"F. Aurenhammer","year":"1991","unstructured":"F. Aurenhammer. Voronoi diagrams\u2014a survey of a fundamental geometric data structure. ACM Computing Surveys, 23 (3):345\u2013405, September 1991.","journal-title":"ACM Computing Surveys"},{"key":"15_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Applications","author":"J. A. Bondy","year":"1976","unstructured":"J. A. Bondy and U. S. R. Murty. Graph Theory with Applications. North-Holland, New York, NY, 1976."},{"issue":"5","key":"15_CR3","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0020-0190(79)90074-7","volume":"9","author":"K. Q. Brown","year":"1979","unstructured":"K. Q. Brown. Voronoi diagrams from convex hulls. Information Processing Letters, 9(5):223\u2013228, December 1979.","journal-title":"Information Processing Letters"},{"issue":"3","key":"15_CR4","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0012-365X(73)90138-6","volume":"5","author":"V. Chv\u00e1tal","year":"1973","unstructured":"V. Chv\u00e1tal. Tough graphs and Hamiltonian circuits. Discrete Mathematics, 5(3):215\u2013228, July 1973.","journal-title":"Discrete Mathematics"},{"key":"15_CR5","volume-title":"Introduction to Geometry","author":"H. S. M. M. Coxeter","year":"1969","unstructured":"H. S. M. Coxeter. Introduction to Geometry. John Wiley and Sons, New York, NY, second edition, 1969.","edition":"second edition"},{"issue":"6","key":"15_CR6","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/0020-0190(90)90210-O","volume":"33","author":"M. B. Dillencourt","year":"1990","unstructured":"M. B. Dillencourt. Realizability of Delaunay triangulations. Information Processing Letters, 33(6):283\u2013287, February 1990.","journal-title":"Information Processing Letters"},{"issue":"6","key":"15_CR7","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1007\/BF02187810","volume":"5","author":"M. B. Dillencourt","year":"1990","unstructured":"M. B. Dillencourt. Toughness and Delaunay triangulations. Discrete & Computational Geometry, 5(6):575\u2013601, 1990.","journal-title":"Discrete & Computational Geometry"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"M. B. Dillencourt and W. D. Smith. A linear-time algorithm for testing the inscribability of trivalent polyhedra. In Proceedings of the Eighth Annual ACM Symposium on Computational Geometry, pages 177\u2013185, Berlin, Germany, June 1992.","DOI":"10.1145\/142675.142715"},{"key":"15_CR9","volume-title":"volume 10 of EATCS Monographs on Theoretical Computer Science","author":"H. Edelsbrunner","year":"1987","unstructured":"H. Edelsbrunner. Algorithms in Combinatorial Geometry, volume 10 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Berlin, 1987."},{"issue":"1","key":"15_CR10","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1145\/77635.77639","volume":"9","author":"H. Edelsbrunner","year":"1990","unstructured":"H. Edelsbrunner and E. P. M\u00fccke. Simulation of simplicity: A technique to cope with degenerate cases in geometric algorithms. ACM Transactions on Graphics, 9(1):66\u2013104, January 1990.","journal-title":"ACM Transactions on Graphics"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"I. Emiris and J. Canny. A general approach to removing degeneracies. In Proceedings of the 32nd Annual IEEE Symposium on the Foundations of Computer Science, pages 405\u2013413, San Juan, Puerto Rico, October 1991.","DOI":"10.1109\/SFCS.1991.185399"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"S. Fortune. Numerical stability of algorithms for 2D Delaunay triangulations. In Proceedings of the Eighth Annual ACM Symposium on Computational Geometry, pages 83\u201392, Berlin, Germany, June 1992.","DOI":"10.1145\/142675.142695"},{"key":"15_CR13","volume-title":"Convex Polytopes","author":"B. Gr\u00fcnbaum","year":"1967","unstructured":"B. Gr\u00fcnbaum. Convex Polytopes. Wiley Interscience, New York, NY, 1967."},{"issue":"2","key":"15_CR14","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1090\/S0273-0979-1992-00303-8","volume":"27","author":"C. D. Hodgson","year":"1992","unstructured":"C. D. Hodgson, I. Rivin, and W. D. Smith. A characterization of convex hyperbolic polyhedra and of convex polyhedra inscribed in the sphere. Bulletin of the A MS, 27(2):246\u2013251, October 1992. See also Erratum, Bulletin of the AMS, 28(1):213, January 1993.","journal-title":"Bulletin of the A MS"},{"issue":"1","key":"15_CR15","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0020-0190(83)90004-2","volume":"16","author":"V. Kantabutra","year":"1983","unstructured":"V. Kantabutra. Traveling salesman cycles are not always subgraphs of Voronoi duals. Information Processing Letters, 16(1):11\u201312, January 1983.","journal-title":"Information Processing Letters"},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"D. M. Mount and A. Saalfeld. Globally-equiangular triangulations of co-circular points in O(n log n) time. In Proceedings of the Fourth ACM Symposium on Computational Geometry, pages 143\u2013152, Urbana-Champaign, IL, June 1988.","DOI":"10.1145\/73393.73408"},{"key":"15_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry: An Introduction","author":"F. P. Preparata","year":"1985","unstructured":"F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, New York, NY, 1985."},{"key":"15_CR18","doi-asserted-by":"crossref","unstructured":"I. Rivin. On the geometry of ideal polyhedra in hyperbolic 3-Space. To appear, Topology.","DOI":"10.1016\/0040-9383(93)90039-X"},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"I. Rivin. A characterization of ideal polyhedra in hyperbolic 3-space. Preprint, 1992.","DOI":"10.1016\/0040-9383(93)90039-X"},{"key":"15_CR20","unstructured":"I. Rivin. Some applications of the hyperbolic volume formula of Lobachevskii and Milnor. Preprint, 1992."},{"key":"15_CR21","volume-title":"Ideal polyhedra in H 3 are determined by their dihedral angles","author":"I. Rivin","year":"1991","unstructured":"I. Rivin and W. D. Smith. Ideal polyhedra in H 3 are determined by their dihedral angles. Manuscript, NEC Research Institute, Princeton, NJ, 1991."},{"key":"15_CR22","volume-title":"Inscribable graphs","author":"I. Rivin","year":"1991","unstructured":"I. Rivin and W. D. Smith. Inscribable graphs. Manuscript, NEC Research Institute, Princeton, NJ, 1991."},{"key":"15_CR23","volume-title":"On the enumeration of inscribable graphs","author":"W. D. Smith","year":"1991","unstructured":"W. D. Smith. On the enumeration of inscribable graphs. Manuscript, NEC Research Institute, Princeton, NJ, 1991."},{"key":"15_CR24","doi-asserted-by":"crossref","unstructured":"C-K. Yap. A geometric consistency theorem for a symbolic perturbation scheme. In Proceedings of the Fourth Annual ACM Symposium on Computational Geometry, pages 134\u2013142, Urbana-Champaign, IL, June 1988.","DOI":"10.1145\/73393.73407"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56939-1_71.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:07:30Z","timestamp":1605647250000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56939-1_71"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540569398","9783540478263"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-56939-1_71","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}