A Minimum Spanning Ellipse Algorithm

Mark J. Post

IEEE Annual Symposium on Foundations of Computer Science (FOCS)（1981）CCF A

被引用17|浏览3

摘要

An algorithm to find the minimum spanning ellipse of a convex set of points in the plane, i.e., the ellipse of minimum area containing the set, is described. The result for higher dimensions is suggested, along with a brief discussion of possible applications.

更多

查看译文

关键词

layout area,wire area argument,N-node planar graph,computationally useful network,lower bound,maximum edge length,ellipse algorithm