Abstract
A simple randomized algorithm is developed which computes the smallest enclosing disk of a finite set of points in the plane in expected linear time. The algorithm is based on Seidel's recent Linear Programming algorithm, and it can be generalized to computing smallest enclosing balls or ellipsoids of point sets in higher dimensions in a straightforward way. Experimental results of an implementation are presented.
Cite
CITATION STYLE
Welzl, E. (1991). New Results and New Trends in Computer Science. Lecture Notes in Computer Science, 555(3075), 359–370. Retrieved from http://link.springer.com/chapter/10.1007/BFb0038202%5Cnhttp://www.springerlink.com/index/10.1007/BFb0038178%5Cnhttp://scholar.google.com/scholar?hl=en&btnG=Search&q=intitle:New+Results+and+New+Trends+in+Computer+Science#0%5Cnhttp://link.springer.com/10.10
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
