메뉴 건너뛰기




Volumn 25, Issue 1-3, 2003, Pages 283-292

Solution methodologies for the smallest enclosing circle problem

Author keywords

Computational geometry; Optimization

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; GEOMETRY; OPTIMIZATION; SET THEORY;

EID: 0037393484     PISSN: 09266003     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1022977709811     Document Type: Review
Times cited : (71)

References (12)
  • 1
    • 0013152010 scopus 로고    scopus 로고
    • The volume algorithm: Producing primal solutions with a subgradient method
    • F. Barahona and P. Anbil, "The volume algorithm: Producing primal solutions with a subgradient method," Mathematical Programming, vol. 87, pp. 385-399, 2000.
    • (2000) Mathematical Programming , vol.87 , pp. 385-399
    • Barahona, F.1    Anbil, P.2
  • 6
    • 0002528431 scopus 로고
    • The Minimum covering sphere problem
    • J. Elzinga and D. Hearn, "The Minimum covering sphere problem," Management Science, vol. 19, pp. 96-104, 1972.
    • (1972) Management Science , vol.19 , pp. 96-104
    • Elzinga, J.1    Hearn, D.2
  • 7
    • 84958060673 scopus 로고    scopus 로고
    • Fast and robust smallest enclosing balls
    • Algorithms - ESA'99: 7th Annual European Symposium, Proceedings, J. Nestril (Ed.). Springer-Verlag
    • B. Gärtner, "Fast and robust smallest enclosing balls," in Algorithms - ESA'99: 7th Annual European Symposium, Proceedings, J. Nestril (Ed.), vol. 1643 of Lecture Notes in Computer Science. Springer-Verlag, 1999, pp. 325-338.
    • (1999) Lecture Notes in Computer Science , vol.1643 , pp. 325-338
    • Gärtner, B.1
  • 8
    • 0000005687 scopus 로고
    • Efficient algorithms for the minimum circle problem
    • D.W. Hearn and J. Vijan, "Efficient algorithms for the minimum circle problem," Oper. Res., vol. 30, pp. 777-795, 1982.
    • (1982) Oper. Res. , vol.30 , pp. 777-795
    • Hearn, D.W.1    Vijan, J.2
  • 10
    • 0000423548 scopus 로고
    • 33 and related problems
    • 33 and related problems," SIAM J. Comput., vol. 12, pp. 759-776, 1983.
    • (1983) SIAM J. Comput. , vol.12 , pp. 759-776
    • Megiddo, N.1
  • 12
    • 85030869395 scopus 로고
    • Smallest enclosing disks (balls and ellipsoids)
    • New Results and New Trends in Computer Science, H. Maurer (Ed.). Springer-Verlag
    • E. Welzl, "Smallest enclosing disks (balls and ellipsoids)," in New Results and New Trends in Computer Science, H. Maurer (Ed.), vol. 555 of Lecture Notes in Computer Science. Springer-Verlag, 1991, pp. 359-370.
    • (1991) Lecture Notes in Computer Science , vol.555 , pp. 359-370
    • Welzl, E.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.