Covering a convex polygon by triangles

DOI10.1023/A:1005284124633zbMath0981.52012OpenAlexW74997740MaRDI QIDQ1573684

Andras Bezdek

Publication date: 18 March 2002

Published in: Geometriae Dedicata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1005284124633

zbMATH Keywords

trianglepolygonconvex set

Mathematics Subject Classification ID

Inequalities and extremum problems involving convexity in convex geometry (52A40) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)

Related Items (1)

The lower bound of the number of non-overlapping triangles.

This page was built for publication: Covering a convex polygon by triangles