An Edge-Minimization Problem for Regular Polygons

  • Ralph H. Buchholz
  • Warwick de Launey
DOI: https://doi.org/10.37236/179

Abstract

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?

Published
2009-07-24
How to Cite
Buchholz, R. H., & de Launey, W. (2009). An Edge-Minimization Problem for Regular Polygons. The Electronic Journal of Combinatorics, 16(1), R90. https://doi.org/10.37236/179
Issue
Volume 16, Issue 1 (2009)
Article Number
R90