首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Calculating a minimal sphere containing a polytope defined by a system of linear inequalities
Authors:Hiroshi Konno  Yasutoshi Yajima  Ayumi Ban
Institution:(1) Institute of Human and Social Sciences, Tokyo Institute of Technology, 2-12-1 Oh-Okayama, 152 Meguro-Ku, Tokyo, Japan;(2) Department of Industrial Engineering and Management, Tokyo Institute of Technology, Tokyo, Japan
Abstract:We will propose an algorithm for calculating a minimal sphere containing a polytope defined by a system of linear inequalities in low dimensional Euclidean space. This algorithm is a straightforward application of the algorithm for maximizing a convex quadratic function over a polytope. It will be shown that this algorithm successfully generates a minimal sphere when the dimensions of the underlying space is up to five.International Digital Communication Inc.
Keywords:minimal sphere  convex maximization  outer approximation method  computational geometry
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号