Geometric classification of triangulations and their enumeration in a convex polygon (Q1324413): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Srabani Sen Gupta / rank | |||
Property / author | |||
Property / author: Krishnendu Mukhopadhyaya / rank | |||
Property / author | |||
Property / author: Bhargab Bikram Bhattacharya / rank | |||
Property / author | |||
Property / author: Bhabani P. Sinha / rank | |||
Property / reviewed by | |||
Property / reviewed by: John W. Moon / rank | |||
Property / author | |||
Property / author: Srabani Sen Gupta / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Krishnendu Mukhopadhyaya / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Bhargab Bikram Bhattacharya / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Bhabani P. Sinha / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: John W. Moon / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3799261 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Triangulating a simple polygon / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Triangulating a simple polygon in linear time / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Parallel concepts in graph theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the cell-growth problem for arbitrary polygons / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Triangular Dissections of N-Gons / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4148000 / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0898-1221(94)90152-x / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2022275713 / rank | |||
Normal rank |
Latest revision as of 09:57, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Geometric classification of triangulations and their enumeration in a convex polygon |
scientific article |
Statements
Geometric classification of triangulations and their enumeration in a convex polygon (English)
0 references
15 September 1994
0 references
The authors consider triangulations of a convex \(n\)-gon in the plane. The length of a diagonal joining two vertices \(i\) and \(j\) of the \(n\)-gon is the number of edges in the shorter path from \(i\) to \(j\) through consecutive vertices of the \(n\)-gon. They show that any triangulation either contains a (bisector) diagonal of length \(n/2\) or it contains a unique (equilateral, isosceles; or scalene) triangular face with perimeter \(n\). The authors determine the number of non-isomorphic triangulations of these four types.
0 references
enumeration
0 references
convex polygon
0 references
Catalan number
0 references
triangulations
0 references