Publication date
April 2003
DOI Publisher
Springer Science and Business Media LLCAbstract
10.1023/A:1022977709811Computational Optimization and Applications251-3283-292CPPP
10.1023/A:1022977709811Computational Optimization and Applications251-3283-292CPPP
In this thesis, we study the Circle Packing Problem (CPP), which involves packing a set of circles i...
An e#ective hybrid algorithm for the problem of packing circles into a larger containing circle De-f...
On a sequential linear programming approach to finding the smallest circumscribed, largest inscribed...
Given a set of circles C = {c₁, ..., cn}on the Euclidean plane with centers {(a₁, b₁), ..., (an, bn)...
10.1007/s10589-005-4565-7Computational Optimization and Applications302147-160CPPP
We present a simple iterative algorithm for computing the smallest enclosing circle and the farthest...
For a set P of n points in the plane and an integer k ≤ n, consider the problem of finding the small...
L inkedIn triangles that share a given circle as incircle, which one has the smallest perimeter? rea...
Abstract: In mathematical, minimum enclosing circle problem is a Geometrical issue of calculating th...
AbstractWe present an efficient algorithm for solving the “smallest k-enclosing circle” (kSC) proble...
To seek the smallest circle containing all the points of a given point set is an interesting problem...
We present a C++ implementation of an optimisation algorithm for computing the smallest (w.r.t. area...
This paper describes an approved algorithm for the problems of unequal circle packing – the quasi-ph...
The paper presents a new verified optimization method for the problem of finding the densest packing...
Preprint published in 2010 in arXiv; paper published in Appl. Alg. Eng. Comm. Comp., 2012, 23[3-4], ...
In this thesis, we study the Circle Packing Problem (CPP), which involves packing a set of circles i...
An e#ective hybrid algorithm for the problem of packing circles into a larger containing circle De-f...
On a sequential linear programming approach to finding the smallest circumscribed, largest inscribed...
Given a set of circles C = {c₁, ..., cn}on the Euclidean plane with centers {(a₁, b₁), ..., (an, bn)...
10.1007/s10589-005-4565-7Computational Optimization and Applications302147-160CPPP
We present a simple iterative algorithm for computing the smallest enclosing circle and the farthest...
For a set P of n points in the plane and an integer k ≤ n, consider the problem of finding the small...
L inkedIn triangles that share a given circle as incircle, which one has the smallest perimeter? rea...
Abstract: In mathematical, minimum enclosing circle problem is a Geometrical issue of calculating th...
AbstractWe present an efficient algorithm for solving the “smallest k-enclosing circle” (kSC) proble...
To seek the smallest circle containing all the points of a given point set is an interesting problem...
We present a C++ implementation of an optimisation algorithm for computing the smallest (w.r.t. area...
This paper describes an approved algorithm for the problems of unequal circle packing – the quasi-ph...
The paper presents a new verified optimization method for the problem of finding the densest packing...
Preprint published in 2010 in arXiv; paper published in Appl. Alg. Eng. Comm. Comp., 2012, 23[3-4], ...
In this thesis, we study the Circle Packing Problem (CPP), which involves packing a set of circles i...
An e#ective hybrid algorithm for the problem of packing circles into a larger containing circle De-f...
On a sequential linear programming approach to finding the smallest circumscribed, largest inscribed...
Add to ORKG