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

DOI10.1007/BF02935738zbMath1034.52016MaRDI QIDQ1871441

Changqing Xu, Ren Ding

Publication date: 2003

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

zbMATH Keywords

convex polygonlower bound\(k\)-sided regionnumber of non-overlapping trianglessingle point

Mathematics Subject Classification ID

Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Covering a convex polygon by triangles with fixed vertices
• Covering a convex polygon by triangles

This page was built for publication: The lower bound of the number of non-overlapping triangles.