On convex segments in a triangulation (Q687140)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On convex segments in a triangulation |
scientific article; zbMATH DE number 429158
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On convex segments in a triangulation |
scientific article; zbMATH DE number 429158 |
Statements
On convex segments in a triangulation (English)
0 references
1 November 1993
0 references
For any triangulation of a convex polygon with \(n\) boundary vertices and \(m\) inner vertices, the number of its nonconvex edges cannot exceed the integral part of \((1/2)(5m+\text{min}(m,n-2))\). The obtained evaluation is shown to be the best possible one.
0 references
planar triangulation
0 references
convex polygon
0 references
inner vertex
0 references
edge
0 references
boundary vertex
0 references
