Sciweavers

APPML
2008
77views more  APPML 2008»
13 years 7 months ago
Antipodality in convex cones and distance to unpointedness
We provide a complete answer to the problem which consists in finding an unpointed convex cone lying at minimal bounded Pompeiu-Hausdorff distance from a pointed one. We give also...
Alfredo N. Iusem, Alberto Seeger
RAM
2008
IEEE
95views Robotics» more  RAM 2008»
14 years 1 months ago
A New Distance Algorithm and Its Application to General Force-Closure Test
This paper presents an algorithm for computing the distance between a point and a convex cone in n-dimensional space. The convex cone is specified by the set of all nonnegative com...
Yu Zheng, Chee-Meng Chew