An Implementation Study of two Algorithms for the Minimum Spanning Circle Problem-Reference-Cited by-同舟云学术

An Implementation Study of two Algorithms for the Minimum Spanning Circle Problem

Published:1985 Issue: Volume: Page:267-294
ISSN:0923-0459
Container-title:Computational Geometry
language:
Short-container-title:

Author:

Melville Robert C.

Publisher

Elsevier

Reference12 articles.

1. Efficient Algorithms for the (Weighted) Minimum Circle Problem;Hearn;Operations Research,1982

2. Problems in Computational Geometry;Shamos,1977

3. Castells, C., Melville, R., An Unusual Algorithm for the Minimum Spanning Circle Problem. Technical Report, Electrical Engineering and Computer Science, Johns Hopkins University, Baltimore, MD.

4. Chrystal, G., On the Problem to Construct the Minimum Circle Enclosing n Given Points in the Plane. Proceedings of the Edinburgh Mathematical Society, Vol.3, pp.30–33; 1885.

5. Convex Hulls of Finite Sets of Points in Two and Three Dimensions;Preparata;CACM,1977

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On Convergence of a Neural Network Model Computing MSC;Advances in Soft Computing — AFSS 2002;2002

2. A recursive algorithm for finding the minimum covering sphere of a polytope and the minimum covering concentric spheres of several polytopes;Japan Journal of Industrial and Applied Mathematics;1993-06

3. Linear time algorithms for computing reachability regions from polygonal figures;Lecture Notes in Computer Science;1989

4. Inequalities for curves of constant breadth;Journal of Geometry;1988-04

5. Picture processing: 1985;Computer Vision, Graphics, and Image Processing;1986-01