{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T14:11:31Z","timestamp":1742393491752},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540230250"},{"type":"electronic","value":"9783540301400"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30140-0_62","type":"book-chapter","created":{"date-parts":[[2010,9,19]],"date-time":"2010-09-19T01:31:13Z","timestamp":1284859873000},"page":"702-713","source":"Crossref","is-referenced-by-count":14,"title":["Classroom Examples of Robustness Problems in Geometric Computations"],"prefix":"10.1007","author":[{"given":"Lutz","family":"Kettner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kurt","family":"Mehlhorn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sylvain","family":"Pion","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Schirra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chee","family":"Yap","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"62_CR1","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1016\/0020-0190(79)90072-3","volume":"9","author":"A.M. Andrew","year":"1979","unstructured":"Andrew, A.M.: Another efficient algorithm for convex hulls in two dimensions. Information Processing Letters\u00a09, 216\u2013219 (1979)","journal-title":"Information Processing Letters"},{"key":"62_CR2","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/BF02187740","volume":"4","author":"K.L. Clarkson","year":"1989","unstructured":"Clarkson, K.L., Shor, P.W.: Applications of random sampling in computational geometry, II. Journal of Discrete and Computational Geometry\u00a04, 387\u2013421 (1989)","journal-title":"Journal of Discrete and Computational Geometry"},{"key":"62_CR3","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1016\/0167-8396(92)90044-P","volume":"9","author":"T.K. Dey","year":"1992","unstructured":"Dey, T.K., Sugihara, K., Bajaj, C.L.: Delaunay triangulations in three dimensions with finite precision arithmetic. Comput. Aided Geom. Design\u00a09, 457\u2013470 (1992)","journal-title":"Comput. Aided Geom. Design"},{"key":"62_CR4","first-page":"334","volume-title":"SoCG 1991","author":"S. Fortune","year":"1991","unstructured":"Fortune, S., Milenkovic, V.J.: Numerical stability of algorithms for line arrangements. In: SoCG 1991, pp. 334\u2013341. ACM Press, New York (1991)"},{"key":"62_CR5","series-title":"NATOASI","first-page":"707","volume-title":"Fundamental Algorithms for Computer Graphics","author":"A.R. Forrest","year":"1985","unstructured":"Forrest, A.R.: Computational geometry in practice. In: Earnshaw, R.A. (ed.) Fundamental Algorithms for Computer Graphics. NATOASI, vol.\u00a0F17, pp. 707\u2013724. Springer, Heidelberg (1985)"},{"issue":"1","key":"62_CR6","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1145\/103162.103163","volume":"23","author":"D. Goldberg","year":"1990","unstructured":"Goldberg, D.: What every computer scientist should know about floating-point arithmetic. ACM Computing Surveys\u00a023(1), 5\u201348 (1990)","journal-title":"ACM Computing Surveys"},{"key":"62_CR7","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/0020-0190(72)90045-2","volume":"1","author":"R.L. Graham","year":"1972","unstructured":"Graham, R.L.: An efficient algorithm for determining the convex hulls of a finite point set. Information Processing Letters\u00a01, 132\u2013133 (1972)","journal-title":"Information Processing Letters"},{"key":"62_CR8","doi-asserted-by":"crossref","unstructured":"Halperin, D., Shelton, C.R.: A perturbation scheme for spherical arrangements with application to molecular modeling. Comp. Geom.: Theory and Applications\u00a010 (1998)","DOI":"10.1016\/S0925-7721(98)00014-5"},{"key":"62_CR9","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/BF02242021","volume":"47","author":"M. J\u00fcnger","year":"1991","unstructured":"J\u00fcnger, M., Reinelt, G., Zepf, D.: Computing correct Delaunay triangulations. Computing\u00a047, 43\u201349 (1991)","journal-title":"Computing"},{"issue":"1","key":"62_CR10","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1145\/99902.99905","volume":"10","author":"M. Karasick","year":"1991","unstructured":"Karasick, M., Lieber, D., Nackman, L.R.: Efficient Delaunay triangulation using rational arithmetic. ACM Transactions on Graphics\u00a010(1), 71\u201391 (1991)","journal-title":"ACM Transactions on Graphics"},{"key":"62_CR11","first-page":"235","volume-title":"SoCG 1990","author":"Z. Li","year":"1990","unstructured":"Li, Z., Milenkovic, V.J.: Constructing strongly convex hulls using exact or rounded arithmetic. In: SoCG 1990, pp. 235\u2013243. ACM Press, New York (1990)"},{"key":"62_CR12","first-page":"197","volume-title":"SoCG 1989","author":"V.J. Milenkovic","year":"1989","unstructured":"Milenkovic, V.J.: Calculating approximate curve arrangements using rounded arithmetic. In: SoCG 1989, pp. 197\u2013207. ACM Press, New York (1989)"},{"key":"62_CR13","unstructured":"Mehlhorn, K., N\u00e4her, S.: The LEDA Platform for Combinatorial and Geometric Computing, 1018 pages. Cambridge University Press, Cambridge (1999)"},{"key":"62_CR14","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/PL00009321","volume":"18","author":"J.R. Shewchuk","year":"1997","unstructured":"Shewchuk, J.R.: Adaptive precision floating-point arithmetic and fast robust geometric predicates. Discrete & Computational Geometry\u00a018, 305\u2013363 (1997)","journal-title":"Discrete & Computational Geometry"},{"issue":"1","key":"62_CR15","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s004530010002","volume":"27","author":"K. Sugihara","year":"2000","unstructured":"Sugihara, K., Iri, M., Inagaki, H., Imai, T.: Topology-oriented implementation - an approach to robust geometric algorithms. Algorithmica\u00a027(1), 5\u201320 (2000)","journal-title":"Algorithmica"},{"key":"62_CR16","volume-title":"Handbook of Discrete and Computational Geometry, ch. 41","author":"C.K. Yap","year":"2004","unstructured":"Yap, C.K.: Robust geometric computation. In: Goodman, J.E., O\u2019Rourke, J. (eds.) Handbook of Discrete and Computational Geometry, ch. 41, 2nd edn., CRC Press LLC, Boca Raton (2004)","edition":"2"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30140-0_62.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:44:42Z","timestamp":1605761082000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30140-0_62"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540230250","9783540301400"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30140-0_62","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}