Geodesic
An edge-minimization problem for regular polygons
The electronic journal of combinatorics, Tome 16 (2009) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

In this paper we will examine the following problem: What is the minimum number of unit edges required to construct $k$ identical size regular polygons in the plane if sharing of edges is allowed?
DOI : 10.37236/179
Classification : 05B45, 52C20
Mots-clés : regular polygons, asymptotically optimal configurations 
@article{10_37236_179,
     author = {Ralph H. Buchholz and Warwick de Launey},
     title = {An edge-minimization problem for regular polygons},
     journal = {The electronic journal of combinatorics},
     year = {2009},
     volume = {16},
     number = {1},
     doi = {10.37236/179},
     zbl = {1217.05055},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/179/}
}
TY  - JOUR
AU  - Ralph H. Buchholz
AU  - Warwick de Launey
TI  - An edge-minimization problem for regular polygons
JO  - The electronic journal of combinatorics
PY  - 2009
VL  - 16
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/179/
DO  - 10.37236/179
ID  - 10_37236_179
ER  - 
%0 Journal Article
%A Ralph H. Buchholz
%A Warwick de Launey
%T An edge-minimization problem for regular polygons
%J The electronic journal of combinatorics
%D 2009
%V 16
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/179/
%R 10.37236/179
%F 10_37236_179
Ralph H. Buchholz; Warwick de Launey. An edge-minimization problem for regular polygons. The electronic journal of combinatorics, Tome 16 (2009) no. 1. doi: 10.37236/179

Cité par Sources :