Standard

Orthogonal triangulation of polygons. / Kalnitsky, V. S.

In: Vestnik St. Petersburg University: Mathematics, Vol. 49, No. 4, 01.10.2016, p. 334-339.

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

Harvard

Kalnitsky, VS 2016, 'Orthogonal triangulation of polygons', Vestnik St. Petersburg University: Mathematics, vol. 49, no. 4, pp. 334-339. https://doi.org/10.3103/S1063454116040075

APA

Kalnitsky, V. S. (2016). Orthogonal triangulation of polygons. Vestnik St. Petersburg University: Mathematics, 49(4), 334-339. https://doi.org/10.3103/S1063454116040075

Vancouver

Kalnitsky VS. Orthogonal triangulation of polygons. Vestnik St. Petersburg University: Mathematics. 2016 Oct 1;49(4):334-339. https://doi.org/10.3103/S1063454116040075

Author

Kalnitsky, V. S. / Orthogonal triangulation of polygons. In: Vestnik St. Petersburg University: Mathematics. 2016 ; Vol. 49, No. 4. pp. 334-339.

BibTeX

@article{ebecc0dc874049408d1a219a9f3a9976,
title = "Orthogonal triangulation of polygons",
abstract = "In this study, the question whether any convex polygon can be divided using an orthogonal grid into right-angled triangles is answered in the negative. Moreover, it is demonstrated that there exists a convex pentagon which cannot be even approximated by divisible pentagons.",
keywords = "division of polygonal domains, rectangular grid, triangulation of plane domains",
author = "Kalnitsky, {V. S.}",
year = "2016",
month = oct,
day = "1",
doi = "10.3103/S1063454116040075",
language = "English",
volume = "49",
pages = "334--339",
journal = "Vestnik St. Petersburg University: Mathematics",
issn = "1063-4541",
publisher = "Pleiades Publishing",
number = "4",

}

RIS

TY - JOUR

T1 - Orthogonal triangulation of polygons

AU - Kalnitsky, V. S.

PY - 2016/10/1

Y1 - 2016/10/1

N2 - In this study, the question whether any convex polygon can be divided using an orthogonal grid into right-angled triangles is answered in the negative. Moreover, it is demonstrated that there exists a convex pentagon which cannot be even approximated by divisible pentagons.

AB - In this study, the question whether any convex polygon can be divided using an orthogonal grid into right-angled triangles is answered in the negative. Moreover, it is demonstrated that there exists a convex pentagon which cannot be even approximated by divisible pentagons.

KW - division of polygonal domains

KW - rectangular grid

KW - triangulation of plane domains

UR - http://www.scopus.com/inward/record.url?scp=85006893205&partnerID=8YFLogxK

U2 - 10.3103/S1063454116040075

DO - 10.3103/S1063454116040075

M3 - Article

AN - SCOPUS:85006893205

VL - 49

SP - 334

EP - 339

JO - Vestnik St. Petersburg University: Mathematics

JF - Vestnik St. Petersburg University: Mathematics

SN - 1063-4541

IS - 4

ER -

ID: 9168959