The Smallest Covering Cone or Sphere (C. Groenewod and L. Eusanio)
Charles L. Lawson · SIAM Review · 1965
Previous article Next article The Smallest Covering Cone or Sphere (C. Groenewod and L. Eusanio)C. L. LawsonC. L. Lawsonhttps://doi.org/10.1137/1007084PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAbout"The Smallest Covering Cone or Sphere (C. Groenewod and L. Eusanio)." SIAM Review, 7(3), pp. 415–416 Previous article Next article FiguresRelatedReferencesCited byDetails Real-Time Rendering Techniques with Hardware Tessellation21 September 2015 | Computer Graphics Forum, Vol. 35, No. 1 Cross Ref K-centers Min-Max clustering algorithm over heterogeneous wireless sensor networks Cross Ref An accurate and efficient algorithm for determining minimum circumscribed circles and spheres from discrete data pointsComputer-Aided Design, Vol. 45, No. 2 Cross Ref Two Algorithms for the Minimum Enclosing Ball ProblemE. Alper Yildirim21 November 2008 | SIAM Journal on Optimization, Vol. 19, No. 3AbstractPDF (294 KB)Hausdorff Matching and Lipschitz OptimizationJournal of Global Optimization, Vol. 35, No. 3 Cross Ref Evaluation of Poisson Solvation Models Using a Hybrid Explicit/Implicit Solvent Method19 February 2005 | The Journal of Physical Chemistry B, Vol. 109, No. 11 Cross Ref Optimal bounding cones of vectors in three dimensionsInformation Processing Letters, Vol. 93, No. 2 Cross Ref An efficient hybrid explicit/implicit solvent method for biomolecular simulations13 October 2004 | Journal of Computational Chemistry, Vol. 25, No. 16 Cross Ref Computational complexity of inner and outerj-radii of polytopes in finite-dimensional normed spacesMathematical Programming, Vol. 59, No. 1-3 Cross Ref An adaptive algorithm for finding a covering hypersphereInformation Processing Letters, Vol. 33, No. 1 Cross Ref Efficient algorithms for automatic viewer orientationComputers & Graphics, Vol. 9, No. 4 Cross Ref Constrained Location Problems in the Plane and on a Sphere6 July 2007 | IIE Transactions, Vol. 15, No. 4 Cross Ref Single Facility Location: Circle Covering Problem Cross Ref Single Facility Location: Circle Covering Problem Cross Ref Volume 7, Issue 3| 1965SIAM Review History Published online:18 July 2006 InformationCopyright © 1965 Society for Industrial and Applied MathematicsPDF Download Article & Publication DataArticle DOI:10.1137/1007084Article page range:pp. 415-416ISSN (print):0036-1445ISSN (online):1095-7200Publisher:Society for Industrial and Applied Mathematics