{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:05:03Z","timestamp":1760439903151},"reference-count":15,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2002,5,1]],"date-time":"2002-05-01T00:00:00Z","timestamp":1020211200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4095,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[2002,5]]},"DOI":"10.1016\/s0925-7721(01)00046-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:26:50Z","timestamp":1027592810000},"page":"99-118","source":"Crossref","is-referenced-by-count":4,"title":["LOOK: A Lazy Object-Oriented Kernel design for geometric computation"],"prefix":"10.1016","volume":"22","author":[{"given":"Stefan","family":"Funke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kurt","family":"Mehlhorn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0925-7721(01)00046-3_BIB001","series-title":"Proc. 14th Annual ACM Symposium on Computational Geometry","article-title":"The crust and the \u03b2-skeleton: Combinatorial curve reconstruction","author":"Amenta","year":"1998"},{"key":"10.1016\/S0925-7721(01)00046-3_BIB002","series-title":"Proc. 15th Annual ACM Symposium on Computational Geometry","article-title":"Efficient algorithms for line and curve segment intersection using restricted predicates","author":"Boissonat","year":"1999"},{"key":"10.1016\/S0925-7721(01)00046-3_BIB003","series-title":"Proc. 14th Annual ACM Symposium on Computational Geometry","article-title":"Interval analysis yields efficient arithmetic filters for computational geometry","author":"Br\u00f6nnimann","year":"1998"},{"key":"10.1016\/S0925-7721(01)00046-3_BIB004","unstructured":"The CGAL project http:\/\/www.cs.uu.nl\/CGAL\/"},{"key":"10.1016\/S0925-7721(01)00046-3_BIB005","series-title":"Proc. 15th Annual ACM Symposium on Computational Geometry","article-title":"Efficient exact geometric computation made easy","author":"Burnikel","year":"1999"},{"key":"10.1016\/S0925-7721(01)00046-3_BIB006","unstructured":"C. Burnikel, S. Funke, M. Seel, Exact geometric computation using cascading, preliminary version in: Proc. 14th Annual ACM Symposium on Computational Geometry, 1998; also: International Journal on Computational Geometry and Applications, to appear"},{"issue":"2","key":"10.1016\/S0925-7721(01)00046-3_BIB007","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/S0925-7721(99)00011-5","article-title":"Further results on arithmetic filters for geometric predicates","volume":"13","author":"Devillers","year":"1999","journal-title":"Computational Geometry: Theory and Applications"},{"key":"10.1016\/S0925-7721(01)00046-3_BIB008","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/BF01840356","article-title":"A faster divide-and-conquer algorithm for constructing Delaunay triangulations","volume":"2","author":"Dwyer","year":"1987","journal-title":"Algorithmica"},{"key":"10.1016\/S0925-7721(01)00046-3_BIB009","series-title":"Proc. 14th Annual ACM Symposium on Computational Geometry","article-title":"Vertex-rounding a three-dimensional polyhedral subdivision","author":"Fortune","year":"1998"},{"issue":"3","key":"10.1016\/S0925-7721(01)00046-3_BIB010","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1145\/231731.231735","article-title":"Static analysis yields efficient exact integer arithmetic for computational geometry","volume":"15","author":"Fortune","year":"1996","journal-title":"ACM Trans. Graphics"},{"key":"10.1016\/S0925-7721(01)00046-3_BIB011","series-title":"Proc. 11th Canadian Conference on Computational Geometry","article-title":"Structural filtering\u2014A paradigm for efficient and exact geometric programs","author":"Funke","year":"1999"},{"key":"10.1016\/S0925-7721(01)00046-3_BIB012","unstructured":"IEEE standard 754-1985 for binary floating-point arithmetic; reprinted in SIGPLAN 22 (2) (1987) 9\u201325"},{"issue":"1","key":"10.1016\/S0925-7721(01)00046-3_BIB013","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1145\/99902.99905","article-title":"Efficient Delaunay triangulation using rational arithmetic","volume":"10","author":"Karasick","year":"1991","journal-title":"ACM Transactions on Graphics"},{"key":"10.1016\/S0925-7721(01)00046-3_BIB014","unstructured":"The LEDA homepage http:\/\/www.mpi-sb.mpg.de\/LEDA\/"},{"key":"10.1016\/S0925-7721(01)00046-3_BIB015","series-title":"Computing in Euclidean Geometry","first-page":"452","article-title":"The exact computation paradigm","author":"Yap","year":"1995"}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772101000463?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772101000463?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T04:54:18Z","timestamp":1556427258000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0925772101000463"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,5]]},"references-count":15,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2002,5]]}},"alternative-id":["S0925772101000463"],"URL":"https:\/\/doi.org\/10.1016\/s0925-7721(01)00046-3","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[2002,5]]}}}