{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T14:31:30Z","timestamp":1761489090723},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2013,2,22]],"date-time":"2013-02-22T00:00:00Z","timestamp":1361491200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2013,8]]},"DOI":"10.1007\/s00500-013-1005-y","type":"journal-article","created":{"date-parts":[[2013,2,21]],"date-time":"2013-02-21T07:37:02Z","timestamp":1361432222000},"page":"1367-1378","source":"Crossref","is-referenced-by-count":2,"title":["Verified distance computation between non-convex superquadrics using hierarchical space decomposition structures"],"prefix":"10.1007","volume":"17","author":[{"given":"Stefan","family":"Kiel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wolfram","family":"Luther","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eva","family":"Dyllong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,2,22]]},"reference":[{"key":"1005_CR1","unstructured":"Alefeld G, Herzberger J (1983) Introduction to interval computations. Academic Press, New York"},{"key":"1005_CR2","doi-asserted-by":"crossref","unstructured":"Araya I, Trombettoni G, Neveu B (2010) Exploiting monotonicity in interval constraint propagation. In: AAAI","DOI":"10.1609\/aaai.v24i1.7541"},{"key":"1005_CR3","unstructured":"Auer E, Chuev A, Cuypers R, Kiel S, Luther W (2011) Relevance of accurate and verified numerical algorithms for verification and validation in biomechanics. In: EUROMECH Colloquium 511, Ponta Delgada, Azores, Portugal"},{"key":"1005_CR4","unstructured":"Auer E, Cuypers R, Luther W (2012) Process-oriented approach to verification in engineering. In: ICINCO (2), pp 513\u2013518"},{"issue":"1","key":"1005_CR5","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1109\/MCG.1981.1673799","volume":"1","author":"A Barr","year":"1981","unstructured":"Barr A (1981) Superquadrics and angle-preserving transformations. Comput Graph Appl IEEE 1(1):11\u201323","journal-title":"Comput Graph Appl IEEE"},{"issue":"1","key":"1005_CR6","first-page":"11","volume":"9","author":"B Bastl","year":"2005","unstructured":"Bastl B, Jezek F (2005) Comparison of implicitization methods. J Geom Graph 9(1):11\u201329","journal-title":"J Geom Graph"},{"issue":"2","key":"1005_CR7","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1145\/78956.78959","volume":"9","author":"P Brunet","year":"1990","unstructured":"Brunet P, Navazo I (1990) Solid representation and operation using extended octrees. ACM Trans Graph (TOG) 9(2):170\u2013197","journal-title":"ACM Trans Graph (TOG)"},{"key":"1005_CR8","doi-asserted-by":"crossref","unstructured":"B\u00fchler K (2002) Implicit linear interval estimations. In: Proceedings of the 18th spring conference on Computer graphics. ACM, New York, p 132","DOI":"10.1145\/584458.584479"},{"key":"1005_CR9","doi-asserted-by":"crossref","unstructured":"B\u00fchler K, Dyllong E, Luther W (2004) Reliable distance and intersection computation using finite precision geometry. 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 579\u2013600","DOI":"10.1007\/978-3-540-24738-8_9"},{"issue":"4","key":"1005_CR10","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1109\/MCG.1985.276454","volume":"5","author":"I Carlbom","year":"1985","unstructured":"Carlbom I, Chakravarty I, Vanderschel D (1985) A hierarchical data structure for representing the spatial decomposition of 3-d objects. IEEE Comput Graph Appl 5(4):24\u201331","journal-title":"IEEE Comput Graph Appl"},{"issue":"1","key":"1005_CR11","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 Rob 24(1):211\u2013220","journal-title":"IEEE Trans Rob"},{"key":"1005_CR12","unstructured":"Cuypers R (2011) Geometrische Modellierung mit Superquadriken zur Optimierung skelettaler Diagnosesysteme. Logos"},{"key":"1005_CR13","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 Global Optim 5:253\u2013265","journal-title":"J Global Optim"},{"key":"1005_CR14","unstructured":"Dyllong E, Grimm C (2007) Verified adaptive octree representations of constructive solid geometry objects. In: Simulation und Visualisierung, pp 223\u2013235"},{"issue":"1","key":"1005_CR15","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1002\/pamm.201010318","volume":"10","author":"E Dyllong","year":"2010","unstructured":"Dyllong E, Kiel S (2010) Verified distance computation between convex hulls of octrees using interval optimization techniques. PAMM 10(1):651\u2013652","journal-title":"PAMM"},{"key":"1005_CR16","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/s00607-011-0161-0","volume":"94","author":"E Dyllong","year":"2012","unstructured":"Dyllong E, Kiel S (2012) A comparison of verified distance computation between implicit objects using different arithmetics for range enclosure. Computing 94:281\u2013296","journal-title":"Computing"},{"key":"1005_CR17","doi-asserted-by":"crossref","unstructured":"Edelsbrunner H (1995) Algebraic decomposition of non-convex polyhedra. In: Proceedings. 36th annual symposium on foundations of computer science, pp 248\u2013257","DOI":"10.1109\/SFCS.1995.492480"},{"key":"1005_CR18","unstructured":"de Figueiredo L, Stolfi J (1997) Self-validated numerical methods and applications. IMPA, Rio de Janeiro"},{"issue":"2","key":"1005_CR19","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":"1005_CR20","doi-asserted-by":"crossref","unstructured":"Hansen E, Walster GW (2004) Global optimization using interval analysis. Marcel Dekker, New York","DOI":"10.1201\/9780203026922"},{"key":"1005_CR21","doi-asserted-by":"crossref","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","DOI":"10.1007\/978-3-540-24738-8_2"},{"key":"1005_CR22","doi-asserted-by":"crossref","unstructured":"Jakli\u010d A, Leonardis A, Solina F (2000) Segmentation and recovery of superquadrics, vol 20. Springer, Amsterdam","DOI":"10.1007\/978-94-015-9456-1"},{"key":"1005_CR23","unstructured":"Kiel S (2010) Verified spatial subdivision of implicit objects using implicit linear interval estimations. In: Curves and surfaces, pp 402\u2013415"},{"key":"1005_CR24","first-page":"114","volume":"16","author":"S Kiel","year":"2012","unstructured":"Kiel S (2012) YalAA: yet another library for affine arithmetic. Reliable Comput 16:114\u2013129","journal-title":"Reliable Comput"},{"issue":"10","key":"1005_CR25","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":"1005_CR26","doi-asserted-by":"crossref","unstructured":"Lennerz C, Schomer E (2002) Efficient distance computation for quadratic curves and surfaces. In: Geometric modeling and processing, 2002. Proceedings, pp 60\u201369","DOI":"10.1109\/GMAP.2002.1027497"},{"issue":"4","key":"1005_CR27","first-page":"379","volume":"4","author":"K Makino","year":"2003","unstructured":"Makino K, Berz M (2003) Taylor models and other validated functional inclusion methods. Int J Pure Appl Math 4(4):379\u2013456","journal-title":"Int J Pure Appl Math"},{"key":"1005_CR28","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":"1005_CR29","doi-asserted-by":"crossref","DOI":"10.1109\/ROBOT.1994.351059","volume-title":"Efficient distance computation between non-convex objects","author":"S Quinlan","year":"1994","unstructured":"Quinlan S (1994) Efficient distance computation between non-convex objects. In, Robot Autom"},{"key":"1005_CR30","unstructured":"Samet H (2006) Foundations of multidimensional and metric data structures. Morgan Kaufmann, San Francisco"},{"key":"1005_CR31","doi-asserted-by":"crossref","unstructured":"Shapiro V (2007) Semi-analytic geometry with R-functions. ACTA Numer 16","DOI":"10.1017\/S096249290631001X"},{"key":"1005_CR32","doi-asserted-by":"crossref","unstructured":"Snyder JM, Woodbury AR, Fleischer K, Currin B, Barr AH (1993) Interval methods for multi-point collisions between time-dependent curved surfaces. In: Proceedings of the 20th annual conference on Computer graphics and interactive techniques, SIGGRAPH \u201993. ACM, New York, pp 321\u2013334","DOI":"10.1145\/166117.166158"},{"issue":"1","key":"1005_CR33","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/s10107-004-0559-y","volume":"106","author":"A W\u00e4chter","year":"2006","unstructured":"W\u00e4chter A, Biegler LT (2006) On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Math Program 106(1):25\u201357","journal-title":"Math Program"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-013-1005-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-013-1005-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-013-1005-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,29]],"date-time":"2023-06-29T17:57:43Z","timestamp":1688061463000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-013-1005-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2,22]]},"references-count":33,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2013,8]]}},"alternative-id":["1005"],"URL":"https:\/\/doi.org\/10.1007\/s00500-013-1005-y","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,2,22]]}}}