{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T15:06:43Z","timestamp":1773241603882,"version":"3.50.1"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1997,2,1]],"date-time":"1997-02-01T00:00:00Z","timestamp":854755200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1997,2]]},"DOI":"10.1007\/bf02522822","type":"journal-article","created":{"date-parts":[[2006,11,8]],"date-time":"2006-11-08T04:40:51Z","timestamp":1162960851000},"page":"111-132","source":"Crossref","is-referenced-by-count":28,"title":["Evaluating signs of determinants using single-precision arithmetic"],"prefix":"10.1007","volume":"17","author":[{"given":"F.","family":"Avnaim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. -D.","family":"Boissonnat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"O.","family":"Devillers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F. P.","family":"Preparata","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Yvinec","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02522822_CR1","unstructured":"[BJMM] M. Benouamer, P. Jaillon, D. Michelucci, and J.-M. Moreau. A lazy solution to imprecision in computational geometry.Proc. 5th Canad. Conf. Comput. Geom., pp. 73\u201378, Waterloo, 1993."},{"key":"BF02522822_CR2","doi-asserted-by":"crossref","unstructured":"[Cla] K. L. Clarkson. Safe and effective determinant evaluation.Proc. 33rd Annual IEEE Symp. Found. Comput. Sci., pp. 387\u2013395, 1992.","DOI":"10.1109\/SFCS.1992.267751"},{"key":"BF02522822_CR3","doi-asserted-by":"crossref","unstructured":"[FM] S. Fortune and V. Milenkovic. Numerical stability of algorithms for line arrangements.Proc. 7th Annual ACM Symp. Comput. Geom., pp. 334\u2013341, 1991.","DOI":"10.1145\/109648.109685"},{"key":"BF02522822_CR4","doi-asserted-by":"crossref","unstructured":"[For1] S. Fortune. Stable maintenance of point set triangulations in two dimensions.Proc. 30th Annual IEEE Symp. Found. Comput. Sci., pp. 494\u2013505, 1989.","DOI":"10.1109\/SFCS.1989.63524"},{"key":"BF02522822_CR5","doi-asserted-by":"crossref","unstructured":"[For2] S. Fortune. Numerical stability of algorithms for 2-d Delaunay triangulations and Voronoid diagrams.Proc. 8th Annual ACM Symp. Comput Geom., pp. 83\u201392, 1992.","DOI":"10.1145\/142675.142695"},{"key":"BF02522822_CR6","doi-asserted-by":"crossref","unstructured":"[FV1] S. Fortune and C. J. Van Wyk. Efficient exact arithmetic for computational geometry.Proc. 9th Annual ACM Symp. Comput. Geom., pp. 163\u2013172, 1993.","DOI":"10.1145\/160985.161015"},{"key":"BF02522822_CR7","unstructured":"[FV2] S. Fortune and C. J. Van Wyk. Ln User Manual, 1994."},{"key":"BF02522822_CR8","doi-asserted-by":"crossref","unstructured":"[GSS] L. J. Guibas, D. Salesin, and J. Stolfi. Espilon geometry: building robust algorithms from imprecise computations.Proc. 5th Annual ACM Symp. Comput. Geom., pp. 208\u2013217, 1989.","DOI":"10.1145\/73833.73857"},{"key":"BF02522822_CR9","doi-asserted-by":"crossref","unstructured":"[GY] D. H. Greene and F. F. Yao. Finite-resolution computational geometry.Proc. 27th Annual IEEE Symp. Found. Comput. Sci., pp. 143\u2013152, 1986.","DOI":"10.1109\/SFCS.1986.19"},{"issue":"6","key":"BF02522822_CR10","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1109\/38.41469","volume":"9","author":"C. M. Hoffmann","year":"1989","unstructured":"[HHK] C. M. Hoffmann, J. E. Hopcroft, and M. T. Karasick. Robust set operations on polyhedral solids.IEEE Comput. Graph. Appl., 9 (6): 50\u201359, November 1989.","journal-title":"IEEE Comput. Graph. Appl."},{"key":"BF02522822_CR11","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1145\/99902.99905","volume":"10","author":"M. Karasick","year":"1991","unstructured":"[KLN] M. Karasick, D. Lieber, and L. R. Nackman. Efficient Delaunay triangulations using rational arithmetic.ACM Trans. Graph., 10: 71\u201391, 1991.","journal-title":"ACM Trans. Graph."},{"key":"BF02522822_CR12","doi-asserted-by":"crossref","unstructured":"[Mil1] V. Milenkovic. Verifiable Implementations of Geometric Algorithms Using Finite Precision Arithmetic. Ph.d. thesis, Carnegie Mellon University, 1988.","DOI":"10.1016\/0004-3702(88)90061-6"},{"key":"BF02522822_CR13","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/0004-3702(88)90061-6","volume":"37","author":"V. Milenkovic","year":"1988","unstructured":"[Mil2] V. Milenkovic. Verifiable implementations of geometric algorithms using finite precision arithmetic.Artificial Intelligence, 37: 377\u2013401, 1988.","journal-title":"Artificial Intelligence"},{"key":"BF02522822_CR14","doi-asserted-by":"crossref","unstructured":"[Mil3] V. Milenkovic. Double precision geometry: a general technique for calculating line and segment intersections using rounded arithmetic.Proc. 30th Annual IEEE Symp. Found. Comput. Sci., pp. 500\u2013505, 1989.","DOI":"10.1109\/SFCS.1989.63525"},{"key":"BF02522822_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-51486-4_58","volume-title":"LEDA, a library of efficient data types and algorithms","author":"K. Mehlhorn","year":"1989","unstructured":"[MN] K. Mehlhorn and S. N\u00e4her. LEDA, a library of efficient data types and algorithms. Report A 04\/89, Fachber. Inform., Univ. Saarlandes, Saarbr\u00fccken, 1989."},{"key":"BF02522822_CR16","unstructured":"[SI] K. Sugihara and M. Iri. Geometric algorithms in finite-precision arithmetic. Technical Report 88-10, Math. Eng. and Physics Dept., Univ. of Tokyo, September 1988."},{"key":"BF02522822_CR17","doi-asserted-by":"crossref","unstructured":"[Val] L. Valiant. Completeness classes in algebra.Proc. 11th Annual ACM Symp. Theory Comput., pp. 249\u2013261, 1979.","DOI":"10.1145\/800135.804419"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02522822.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02522822\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02522822","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T22:19:36Z","timestamp":1736633976000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02522822"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,2]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1997,2]]}},"alternative-id":["BF02522822"],"URL":"https:\/\/doi.org\/10.1007\/bf02522822","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,2]]}}}