Solution Methodologies for the Smallest Enclosing Circle Problem

Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/4015

Full metadata record

DC Field	Value	Language
dc.creator	Xu, Sheng	-
dc.creator	Freund, Robert M.	-
dc.creator	Sun, Jie	-
dc.date	2003-12-23T03:14:50Z	-
dc.date	2003-12-23T03:14:50Z	-
dc.date	2002-01	-
dc.date.accessioned	2013-10-09T02:33:46Z	-
dc.date.available	2013-10-09T02:33:46Z	-
dc.date.issued	2013-10-09	-
dc.identifier	http://hdl.handle.net/1721.1/4015	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721	-
dc.description	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 approaches for this problem, including a second order cone reformulation, a subgradient approach, a quadratic programming scheme, and a randomized incremental algorithm. For the last algorithm we also give some implementation details. It turns out the quadratic programming scheme outperforms the other three in our computational experiment.	-
dc.description	Singapore-MIT Alliance (SMA)	-
dc.format	175555 bytes	-
dc.format	application/pdf	-
dc.language	en_US	-
dc.relation	High Performance Computation for Engineered Systems (HPCES);	-
dc.subject	computational geometry	-
dc.subject	optimization	-
dc.title	Solution Methodologies for the Smallest Enclosing Circle Problem	-
dc.type	Article	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI