Buscar
Mostrando ítems 1-3 de 3
Artículo
Optimal Divisions of a Convex Body
(Ele-Math, 2023)
For a convex body C in Rd andadivision of C into convex subsets C1,...,Cn, we can consider max{F(C1),...,F(Cn)} (respectively, min{F(C1),...,F(Cn)}), where F represents one of these classical geometric magnitudes: the ...
Artículo
Shortcut sets for plane Euclidean networks (Extended abstract)
(Elsevier, 2016)
We study the problem of augmenting the locus N of a plane Euclidean network N by inserting iteratively a finite set of segments, called shortcut set, while reducing the diameter of the locus of the resulting network. ...
Artículo
Shortcut sets for the locus of plane Euclidean networks
(Elsevier, 2018)
We study the problem of augmenting the locus N of a plane Euclidean network N by in- serting iteratively a finite set of segments, called shortcut set , while reducing the diameterof the locus of the resulting network. ...