On the Computation of the Minimal Ellipse Enclosing a Set of Planar Curves
A method of finding the precise ellipse of minimal area, enclosing a finite set of regular planar curves (and points), is presented. We start with a direct approach of prescribing the problem using a set of algebraic constraints and solving them. This approach turns out to be intractable using contemporary memory support and computing power and several improvements are presented to alleviate these difficulties: the number of degrees of freedom and constraints is limited and the search domain is restricted. As a result, an alternative set of algebraic constraints is created whose solution is found in a reasonable amount of memory size and/or computing time.
bounding areas minimal spanning circles collision detection linear programming
Dan Albocher Gershon Elber
Department of Computer Science, Technion-Israel Institute of Technology, Technion City, Haifa 32000, Israel
国际会议
IEEE International Conference on Shape Modeling and Applications (SMI)(2009年形状建模国际会议)
北京
英文
185-192
2009-06-26（万方平台首次上网日期，不代表论文的发表时间）