Results 31 to 40 of about 17,391 (302)
Investigation of algorithms for coagulate arrangement in fundus images [PDF]
Diabetic retinopathy is one of the most frequent complications of diabetes, which leads to severe consequences, including rapid and irreversible vision loss.
Aleksandr Shirokanev +3 more
doaj +1 more source
A rapid and simple method for assessing and representing genome sequence relatedness
Coherent genomic groups are frequently used as a proxy for bacterial species delineation through computation of overall genome relatedness indices (OGRI).
Briand, M +5 more
doaj +1 more source
We consider the online problem of packing circles into a square container. A sequence of circles has to be packed one at a time, without knowledge of the following incoming circles and without moving previously packed circles. We present an algorithm that packs any online sequence of circles with a combined area not larger than 0.350389 0.350389 of the
Sándor P. Fekete +2 more
openaire +2 more sources
Minkowski Circle Packings on the Sphere [PDF]
A set of balls is said to be a Minkowski set if none of its elements contains in its interior the centre of another. Replacing in a Minkowski set of balls each ball by a concentric ball of half the radius, one obtains a packing of balls which is called a Minkowski packing. The paper under review concerns Minkowski sets and Minkowski packings of circles
openaire +2 more sources
Circle, sphere, and drop packings [PDF]
We studied the geometrical and topological rules underlying the dispositions and the size distribution of non-overlapping, polydisperse circle-packings. We found that the size distribution of circles that densely cover a plane follows the power law: $N(R) \propto R^{-α}$.
openaire +3 more sources
Partial covering of a circle by equal circles. Part II: The case of 5 circles
How must n equal circles of given radius r be placed so that they cover as great a part of the area of the unit circle as possible? In this Part II of a two-part paper, a conjectured solution of this problem for n = 5 is given for r varying from the ...
Zsolt Gáspár +2 more
doaj +1 more source
Generation of triangular mesh with specified size by circle packing [PDF]
This paper describes an algorithm for the generation of a finite element mesh with a specified element size over an unbound 2D domain using the advancing front circle packing technique. Unlike the conventional frontal method, the procedure does not start
Ming, CY, Lo, SH, Wang, WX
core +1 more source
Multi-component layout design with coupled shape and topology optimization [PDF]
A Coupled Shape and Topology Optimization (CSTO) method is proposed here to deal with the layout design of the multi-component system. Considering a complex packing system for which several components will be placed in a container of specific shape ...
Zhu J. H., Zhang W. H., Beckers P.
doaj +1 more source
The Third Dimension of the Magdouh Mosaic in Antioch
This study investigates the complex geometry of the pattern of circles in the Magdouh Mosaic, which dates to between the ffth and sixth centuries, found in Antioch-on-the-Orontes (modern Antakya, Turkey). The mosaic has a complex pattern that is composed
Hakan HİSARLIGİL +1 more
doaj +1 more source
Formulation symmetries in circle packing [PDF]
Abstract The performance of Branch-and-Bound algorithms is severely impaired by the presence of symmetric optima in a given problem. We describe a method for the automatic detection of formulation symmetries in MINLP instances. A software implementation of this method is used to conjecture the group structure of the problem symmetries of packing ...
Alberto Costa +2 more
openaire +1 more source

