Solution Methodologies for the Smallest Enclosing Circle Problem
Given a set of circles C = {c₁, ..., cn}on the Euclidean plane with centers {(a₁, b₁), ..., (an, b<sub>n</sub>)}and radii {r₁..., r<n},the smallest enclosing circle (of fixed circles) problem is to ï¬nd the circle of minimum radius that encloses all circles in C. We survey four known...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | en_US |
Published: |
2003
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/4015 |