{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,6,11]],"date-time":"2023-06-11T03:10:13Z","timestamp":1686453013429},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"2-4","license":[{"start":{"date-parts":[[2011,11,13]],"date-time":"2011-11-13T00:00:00Z","timestamp":1321142400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[2012,3]]},"DOI":"10.1007\/s00607-011-0161-0","type":"journal-article","created":{"date-parts":[[2011,11,12]],"date-time":"2011-11-12T00:49:02Z","timestamp":1321058942000},"page":"281-296","source":"Crossref","is-referenced-by-count":1,"title":["A Comparison of verified distance computation between implicit objects using different arithmetics for range enclosure"],"prefix":"10.1007","volume":"94","author":[{"given":"Eva","family":"Dyllong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Kiel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,11,13]]},"reference":[{"key":"161_CR1","volume-title":"Introduction to interval computations","author":"G Alefeld","year":"1983","unstructured":"Alefeld G, Herzberger J (1983) Introduction to interval computations. Academic Press, New York"},{"key":"161_CR2","doi-asserted-by":"crossref","unstructured":"Araya I, Trombettoni G, Neveu B (2010) Exploiting monotonicity in interval constraint propagation","DOI":"10.1609\/aaai.v24i1.7541"},{"key":"161_CR3","unstructured":"Auer E, Cuypers R, Dyllong E, Kiel S, Luther W (2010) Verification and validation for femur prosthesis surgery. In: Brown BM, Kaltofen E, Oishi S, Rump SM (eds) Computer-assisted proofs\u2014tools, methods and applications, no. 09471 in Dagstuhl Seminar Proceedings. Schloss Dagstuhl, Germany. http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2010\/2513"},{"key":"161_CR4","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/0168-9002(95)00361-4","volume":"A363","author":"M Berz","year":"1995","unstructured":"Berz M (1995) Modern map methods for charged particle optics. Nucl Instrum Methods A363: 100\u2013104","journal-title":"Nucl Instrum Methods"},{"key":"161_CR5","volume-title":"Cosy infinity 9.0. Tech Rep. MSUHEP 060803","author":"M Berz","year":"2006","unstructured":"Berz M, Makino K (2006) Cosy infinity 9.0. Tech Rep. MSUHEP 060803. Michigan State University, East Lansing"},{"key":"161_CR6","doi-asserted-by":"crossref","unstructured":"B\u00fchler K (2002) Implicit linear interval estimations. In: Proceedings of the 18th spring conference on Computer graphics, ACM, p 132","DOI":"10.1145\/584458.584479"},{"key":"161_CR7","doi-asserted-by":"crossref","unstructured":"B\u00fchler K, Dyllong E, Luther W (2004) Reliable distance and intersection computation using finite precision geometry. Numerical Software with Result Verification, pp 579\u2013600","DOI":"10.1007\/978-3-540-24738-8_9"},{"key":"161_CR8","doi-asserted-by":"crossref","first-page":"683","DOI":"10.1023\/A:1021991817955","volume":"41","author":"L Casado","year":"2001","unstructured":"Casado L, Garca I, Csendes T (2001) A heuristic rejection criterion in internal global optimization algorithms. BIT Numer Math 41: 683\u2013692","journal-title":"BIT Numer Math"},{"issue":"1","key":"161_CR9","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1109\/TRO.2007.914851","volume":"24","author":"N Chakraborty","year":"2008","unstructured":"Chakraborty N, Peng J, Akella S, Mitchell JE (2008) Proximity queries between convex objects: An interior point approach for implicit surfaces. IEEE Trans Robot 24(1): 211\u2013220","journal-title":"IEEE Trans Robot"},{"key":"161_CR10","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/BF01096455","volume":"5","author":"K Du","year":"1994","unstructured":"Du K, Kearfott RB (1994) The cluster problem in multivariate global optimization. J Glob Optim 5: 253\u2013265","journal-title":"J Glob Optim"},{"issue":"1","key":"161_CR11","doi-asserted-by":"crossref","first-page":"1023007","DOI":"10.1002\/pamm.200700567","volume":"7","author":"E Dyllong","year":"2007","unstructured":"Dyllong E, Grimm C (2007) An efficient distance algorithm for interval-based octree-encoded csg objects with time-space coherence utilization. PAMM 7(1): 1023007\u20131023008","journal-title":"PAMM"},{"issue":"1","key":"161_CR12","doi-asserted-by":"crossref","first-page":"4010015","DOI":"10.1002\/pamm.200700637","volume":"7","author":"E Dyllong","year":"2007","unstructured":"Dyllong E, Grimm C (2007) A modified reliable distance algorithm for octree-encoded objects. PAMM 7(1): 4010015\u20134010016","journal-title":"PAMM"},{"issue":"1","key":"161_CR13","doi-asserted-by":"crossref","first-page":"562","DOI":"10.1002\/pamm.200410262","volume":"4","author":"E Dyllong","year":"2004","unstructured":"Dyllong E, Luther W (2004) An accurate distance algorithm for octree-encoded objects. PAMM 4(1): 562\u2013563","journal-title":"PAMM"},{"issue":"1","key":"161_CR14","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1023\/B:NUMA.0000049460.50984.b8","volume":"37","author":"E Dyllong","year":"2004","unstructured":"Dyllong E, Luther W (2004) The GJK distance algorithm: an interval version for incremental motions. Numer Algorithms 37(1): 127\u2013136","journal-title":"Numer Algorithms"},{"key":"161_CR15","unstructured":"Eble I (2006) \u00dcber Taylormodelle. Ph.D. thesis, Universit\u00e4t Karlsruhe"},{"key":"161_CR16","volume-title":"Self-validated numerical methods and applications","author":"L Figueiredo de","year":"1997","unstructured":"de Figueiredo L, Stolfi J (1997) Self-validated numerical methods and applications. IMPA, Rio de Janeiro"},{"key":"161_CR17","unstructured":"Gay O, Coeurjolly D, Hurst N Libaffa. http:\/\/www.nongnu.org\/libaffa\/ (Accessed on 15.11.2010)"},{"issue":"2","key":"161_CR18","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1109\/56.2083","volume":"4","author":"E Gilbert","year":"1988","unstructured":"Gilbert E, Johnson D, Keerthi S (1988) A fast procedure for computing the distance between complex objects in three-dimensional space. IEEE J Robot Autom 4(2): 193\u2013203","journal-title":"IEEE J Robot Autom"},{"key":"161_CR19","unstructured":"Gissler M, Frese U, Teschner M (2008) Exact distance computation for deformable objects. In: Proceedings of CASA, Seoul, pp 47\u201354"},{"key":"161_CR20","volume-title":"Global optimization using interval analysis","author":"E Hansen","year":"2004","unstructured":"Hansen E, Walster GW (2004) Global optimization using interval analysis. Marcel Dekker, New York"},{"key":"161_CR21","unstructured":"Hofschuster W, Kr\u00e4mer W (2004) C-XSC 2.0 A C++ library for extended scientific computing. In: Alt R, Frommer A, Kearfott R, Luther W (eds) Numerical software with result verification. Lecture Notes in Computer Science, vol 2991. Springer, Berlin, pp 259\u2013276"},{"key":"161_CR22","doi-asserted-by":"crossref","unstructured":"Kiel S (2011) Verified spatial subdivision of implicit objects using implicit linear interval estimations. In: Curves and surfaces 2011. LNCS, vol 6920. Springer (to appear)","DOI":"10.1007\/978-3-642-27413-8_25"},{"issue":"10","key":"161_CR23","doi-asserted-by":"crossref","first-page":"1053","DOI":"10.4304\/jcp.4.10.1053-1063","volume":"4","author":"S Kockara","year":"2009","unstructured":"Kockara S, Halic T, Bayrak C, Iqbal K, Rowe R (2009) Contact detection algorithms. J Comput 4(10): 1053","journal-title":"J Comput"},{"key":"161_CR24","doi-asserted-by":"crossref","unstructured":"Lennerz C, Schomer E (2002) Efficient distance computation for quadratic curves and surfaces. In: Proceedings of geometric modeling and processing 2002, pp 60\u201369","DOI":"10.1109\/GMAP.2002.1027497"},{"key":"161_CR25","unstructured":"Makino K (1998) Rigorous analysis of nonlinear motion in particle accelerators. Ph.D. thesis, Michigan State University"},{"key":"161_CR26","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1145\/285857.285860","volume":"17","author":"B Mirtich","year":"1998","unstructured":"Mirtich B (1998) V-clip: fast and robust polyhedral collision detection. ACM Trans Graph 17: 177\u2013208","journal-title":"ACM Trans Graph"},{"key":"161_CR27","volume-title":"Interval methods for systems of equations","author":"A Neumaier","year":"1990","unstructured":"Neumaier A (1990) Interval methods for systems of equations. Cambridge University Press, Cambridge"},{"key":"161_CR28","doi-asserted-by":"crossref","unstructured":"Quinlan S (1994) Efficient distance computation between non-convex objects. In: Robotics and automation, vol 4, pp 3324 \u20133329","DOI":"10.1109\/ROBOT.1994.351059"},{"key":"161_CR29","volume-title":"Foundations of multidimensional and metric data structures","author":"H Samet","year":"2006","unstructured":"Samet H (2006) Foundations of multidimensional and metric data structures. Morgan Kaufmann, San Francisco"},{"key":"161_CR30","unstructured":"Shapiro V (1991) Theory of R-functions and applications: a primer"},{"key":"161_CR31","unstructured":"Stauning O, Bendtsen C Fadbad++ web page. http:\/\/www.fadbad.com\/ (Accessed on 18.01.2010)"},{"key":"161_CR32","doi-asserted-by":"crossref","unstructured":"Uteshev A, Yashina M (2007) Distance computation from an ellipsoid to a linear or a quadric surface in R n . In: Ganzha V, Mayr E, Vorozhtsov E (eds) Computer algebra in scientific computing. Lecture Notes in Computer Science, vol 4770, Springer, Berlin, pp 392\u2013401","DOI":"10.1007\/978-3-540-75187-8_31"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-011-0161-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00607-011-0161-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-011-0161-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,11]],"date-time":"2023-06-11T02:42:42Z","timestamp":1686451362000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00607-011-0161-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,11,13]]},"references-count":32,"journal-issue":{"issue":"2-4","published-print":{"date-parts":[[2012,3]]}},"alternative-id":["161"],"URL":"https:\/\/doi.org\/10.1007\/s00607-011-0161-0","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,11,13]]}}}