On a Construction of Digital Convex $(2S + 1)$-gons of Minimum Diameter
Yugoslav journal of operations research, Tome 5 (1995) no. 1, p. 39
Cet article a éte moissonné depuis la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts
In this paper an algorithm is described for an exact construction of digital
convex $(2s + 1)$ - gons of minimum diameter. A complete family of auxiliary so-called
perfect Basic b-tuples is obtained by applying this algorithm. The required optimal
$(2s+ 1)$-gons can be easily constructed from this family.
Keywords:
Digital geometry, digital convex polygon, greedy lower bound
@article{YJOR_1995_5_1_a3,
author = {Sne\v{z}ana Mati\v{c} - Keki\'c and Dragan M. Acketa},
title = {On a {Construction} of {Digital} {Convex} $(2S + 1)$-gons of {Minimum} {Diameter}},
journal = {Yugoslav journal of operations research},
pages = {39 },
year = {1995},
volume = {5},
number = {1},
language = {en},
url = {http://geodesic.mathdoc.fr/item/YJOR_1995_5_1_a3/}
}
TY - JOUR AU - Snežana Matič - Kekić AU - Dragan M. Acketa TI - On a Construction of Digital Convex $(2S + 1)$-gons of Minimum Diameter JO - Yugoslav journal of operations research PY - 1995 SP - 39 VL - 5 IS - 1 UR - http://geodesic.mathdoc.fr/item/YJOR_1995_5_1_a3/ LA - en ID - YJOR_1995_5_1_a3 ER -
Snežana Matič - Kekić; Dragan M. Acketa. On a Construction of Digital Convex $(2S + 1)$-gons of Minimum Diameter. Yugoslav journal of operations research, Tome 5 (1995) no. 1, p. 39 . http://geodesic.mathdoc.fr/item/YJOR_1995_5_1_a3/