{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:14:57Z","timestamp":1760440497301},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540357537"},{"type":"electronic","value":"9783540357551"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11785293_35","type":"book-chapter","created":{"date-parts":[[2006,6,26]],"date-time":"2006-06-26T05:24:10Z","timestamp":1151299450000},"page":"375-387","source":"Crossref","is-referenced-by-count":11,"title":["Largest and Smallest Tours and Convex Hulls for Imprecise Points"],"prefix":"10.1007","author":[{"given":"Maarten","family":"L\u00f6ffler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"van Kreveld","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"35_CR1","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/S0020-0190(99)00107-6","volume":"71","author":"M. Abellanas","year":"1999","unstructured":"Abellanas, M., Hurtado, F., Ramos, P.A.: Structural tolerance and Delaunay triangulation. Inf. Proc. Lett.\u00a071, 221\u2013227 (1999)","journal-title":"Inf. Proc. Lett."},{"key":"35_CR2","unstructured":"Bandyopadhyay, D., Snoeyink, J.: Almost-Delaunay simplices: nearest neighbour relations for imprecise points. In: Proc. 15th ACM-SIAM Sympos. on Discr. Algorithms, pp. 410\u2013419 (2004)"},{"key":"35_CR3","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/BF02187906","volume":"3","author":"C. Bajaj","year":"1988","unstructured":"Bajaj, C.: The algebraic degree of geometric optimization problems. Discr. Comput. Geom.\u00a03, 177\u2013191 (1988)","journal-title":"Discr. Comput. Geom."},{"key":"35_CR4","doi-asserted-by":"crossref","unstructured":"Boissonnat, J.-D., Lazard, S.: Convex hulls of bounded curvature. In: Proc. 8th Canad. Conf. on Comput. Geom., pp. 14\u201319 (1996)","DOI":"10.1515\/9780773591134-005"},{"key":"35_CR5","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1142\/S0218195997000326","volume":"7","author":"L. Cai","year":"1997","unstructured":"Cai, L., Keil, J.M.: Computing visibility information in an inaccurate simple polygon. Internat. J. Comput. Geom. Appl.\u00a07, 515\u2013538 (1997)","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"35_CR6","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1142\/S0218195998000242","volume":"8","author":"M. Berg de","year":"1998","unstructured":"de Berg, M., Meijer, H., Overmars, M.H., Wilfong, G.T.: Computing the angularity tolerance. Int. J. Comput. Geometry Appl.\u00a08, 467\u2013482 (1998)","journal-title":"Int. J. Comput. Geometry Appl."},{"key":"35_CR7","doi-asserted-by":"crossref","unstructured":"Dror, M., Efrat, A., Lubiw, A., Mitchell, J.S.B.: Touring a Sequence of Polygons. In: Proc. 35th ACM Sympos. Theory Comput. (2003)","DOI":"10.1145\/780542.780612"},{"key":"35_CR8","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0304-3975(85)90005-2","volume":"35","author":"H. Edelsbrunner","year":"1985","unstructured":"Edelsbrunner, H.: Finding transversals for sets of simple geometric figures. Theor. Comp. Science\u00a035, 55\u201369 (1985)","journal-title":"Theor. Comp. Science"},{"key":"35_CR9","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1016\/j.dam.2004.02.018","volume":"145","author":"J. Fiala","year":"2005","unstructured":"Fiala, J., Kratochvil, J., Proskurowski, A.: Systems of distant representatives. Discrete Applied Mathematics\u00a0145, 306\u2013316 (2005)","journal-title":"Discrete Applied Mathematics"},{"key":"35_CR10","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1016\/0734-189X(90)90135-I","volume":"49","author":"M.T. Goodrich","year":"1990","unstructured":"Goodrich, M.T., Snoeyink, J.: Stabbing parallel segments with a convex polygon. Computer Vision, Graphics, and Image Processing\u00a049, 152\u2013170 (1990)","journal-title":"Computer Vision, Graphics, and Image Processing"},{"key":"35_CR11","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1007\/BF01190154","volume":"9","author":"L. Guibas","year":"1993","unstructured":"Guibas, L., Salesin, D., Stolfi, J.: Constructing strongly convex approximate hulls with inaccurate primitives. Algorithmica\u00a09, 534\u2013560 (1993)","journal-title":"Algorithmica"},{"key":"35_CR12","unstructured":"Khanban, A.A., Edalat, A.: Computing Delaunay triangulation with imprecise input data. In: Proc. 15th Canad. Conf. on Comput. Geom., pp. 94\u201397 (2003)"},{"key":"35_CR13","doi-asserted-by":"crossref","unstructured":"L\u00f6ffler, M., van Kreveld, M.: Largest and Smallest Convex Hulls for Imprecise Points, Technical Report UU-CS-2006-019, Department of Computing and Information Science, Utrecht University (2006)","DOI":"10.1007\/11785293_35"},{"key":"35_CR14","doi-asserted-by":"crossref","unstructured":"L\u00f6ffler, M., van Kreveld, M.: Largest and Smallest Tours for Imprecise Points (manuscript, 2006)","DOI":"10.1007\/11785293_35"},{"key":"35_CR15","doi-asserted-by":"crossref","unstructured":"Nagai, T., Tokura, N.: Tight error bounds of geometric problems on convex objects with imprecise coordinates. In: Jap. Conf. on Discrete and Comput. Geom., pp. 252\u2013263 (2000)","DOI":"10.1007\/3-540-47738-1_24"},{"key":"35_CR16","unstructured":"Ostrovsky-Berman, Y., Joskowicz, L.: Uncertainty Envelopes. In: Abstracts 21st European Workshop on Comput., pp. 175\u2013178 (2005)"},{"key":"35_CR17","unstructured":"Polishchuk, V., Mitchell, J.S.B.: Touring Convex Bodies - A Conic Programming Solution. In: Proc. 17th Canad. Conf. on Comput. Geom., pp. 290\u2013293 (2005)"},{"key":"35_CR18","doi-asserted-by":"publisher","first-page":"1577","DOI":"10.1137\/S0097539798340205","volume":"29","author":"J. Sellen","year":"2000","unstructured":"Sellen, J., Choi, J., Yap, C.-K.: Precision-sensitive Euclidean shortest paths in 3-space. SIAM J. Comput.\u00a029, 1577\u20131595 (2000)","journal-title":"SIAM J. Comput."},{"key":"35_CR19","first-page":"927","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, pp. 927\u2013952. Chapman and Hall, Boca Raton (2004)"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2013 SWAT 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11785293_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,4]],"date-time":"2024-02-04T23:31:15Z","timestamp":1707089475000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11785293_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540357537","9783540357551"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11785293_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}