Alternative proof of sine's theorem on the size of a regular polygon in Rn with the ℓ∞-metric

A. Blokhuis; H.A. Wilbrink

doi:10.1007/BF02187853

Alternative proof of sine's theorem on the size of a regular polygon in Rn with the ℓ∞-metric

A. Blokhuis
, H.A. Wilbrink

Discrete Algebra and Geometry

Research output: Contribution to journal › Article › Academic › peer-review

14 Citations (Scopus)

Abstract

It is shown that a regular polygon inR n with the (2n) n -metric has at most (2n) n vertices.

Original language	English
Pages (from-to)	433-434
Number of pages	2
Journal	Discrete and Computational Geometry
Volume	7
Issue number	4
DOIs	https://doi.org/10.1007/BF02187853
Publication status	Published - 1992

Access to Document

10.1007/BF02187853

Cite this

@article{e747cedebba94ae6a897aadc34202166,

title = "Alternative proof of sine's theorem on the size of a regular polygon in Rn with the ℓ∞-metric",

abstract = "It is shown that a regular polygon inR n with the (2n) n -metric has at most (2n) n vertices.",

author = "A. Blokhuis and H.A. Wilbrink",

year = "1992",

doi = "10.1007/BF02187853",

language = "English",

volume = "7",

pages = "433--434",

journal = "Discrete and Computational Geometry",

issn = "0179-5376",

publisher = "Springer",

number = "4",

}

TY - JOUR

T1 - Alternative proof of sine's theorem on the size of a regular polygon in Rn with the ℓ∞-metric

AU - Blokhuis, A.

AU - Wilbrink, H.A.

PY - 1992

Y1 - 1992

N2 - It is shown that a regular polygon inR n with the (2n) n -metric has at most (2n) n vertices.

AB - It is shown that a regular polygon inR n with the (2n) n -metric has at most (2n) n vertices.

U2 - 10.1007/BF02187853

DO - 10.1007/BF02187853

M3 - Article

SN - 0179-5376

VL - 7

SP - 433

EP - 434

JO - Discrete and Computational Geometry

JF - Discrete and Computational Geometry

IS - 4

ER -

Alternative proof of sine's theorem on the size of a regular polygon in Rn with the ℓ∞-metric

Abstract

Access to Document

Fingerprint

Cite this