Verified distance computation between non-convex superquadrics using hierarchical space decomposition structures
- 22 February 2013
- journal article
- focus
- Published by Springer Nature in Soft Computing
- Vol. 17 (8) , 1367-1378
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- A Comparison of verified distance computation between implicit objects using different arithmetics for range enclosureComputing, 2011
- Verified Distance Computation Between Convex Hulls of Octrees Using Interval Optimization TechniquesProceedings in Applied Mathematics and Mechanics, 2010
- Contact Detection AlgorithmsJournal of Computers, 2009
- Semi-analytic geometry with R-functionsActa Numerica, 2007
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programmingMathematical Programming, 2005
- C-XSC 2.0 – A C++ Library for Extended Scientific ComputingLecture Notes in Computer Science, 2004
- V-ClipACM Transactions on Graphics, 1998
- The cluster problem in multivariate global optimizationJournal of Global Optimization, 1994
- Solid representation and operation using extended octreesACM Transactions on Graphics, 1990
- A fast procedure for computing the distance between complex objects in three-dimensional spaceIEEE Journal on Robotics and Automation, 1988