AbstractDefine a graph GT(n) with one node for each triangulation of a convex n-gon. Place an edge between each pair of nodes that differ by a single flip: two triangles forming a quadrilateral are exchanged for the other pair of triangles forming the same quadrilateral. In this paper we introduce a tree of all triangulations of polygons with any number of vertices which gives a unified framework in which several results on GT(n) admit new and simple proofs
AbstractTriangulation of polygons is a classical problem in computational geometry. For an arbitrary...
Triangulating a given n-vertex simple polygon means to partition the interior of the polygon into n ...
In this thesis, we consider the g-angulation existence problem of a convex geometric graph G. A tria...
AbstractDefine a graph GT(n) with one node for each triangulation of a convex n-gon. Place an edge b...
A triangulation of a finite point set A in IR d is a geometric simplicial complex which covers the c...
How many ways can a convex polygon of n（≥3） sides be triangulated by diagonals that do not intersect...
We show that the maximum number of convex polygons in a triangulation of n points in the plane is O(...
In this paper we study the problem of flipping edges in triangulations of polygons and point sets. W...
In a straight-line embedded triangulation of a point set P in the plane, removing an inner edge and—...
AbstractIt is known that a convex polygon of n sides admits Cn-2 triangulations, where Cn is a Catal...
A $k$-triangulation of a convex polygon is a maximal set of diagonals so that no $k+1$ of them mutua...
This thesis explores two specific topics of discrete geometry, the multitriangulations and the polyt...
Abstract. A k-triangulation of a convex polygon is a maximal set of diagonals so that no k+1 of them...
AbstractTriangulation of polygons is a classical problem in computational geometry. For an arbitrary...
AbstractA k-triangulation of a convex polygon is a maximal set of diagonals so that no k+1 of them m...
AbstractTriangulation of polygons is a classical problem in computational geometry. For an arbitrary...
Triangulating a given n-vertex simple polygon means to partition the interior of the polygon into n ...
In this thesis, we consider the g-angulation existence problem of a convex geometric graph G. A tria...
AbstractDefine a graph GT(n) with one node for each triangulation of a convex n-gon. Place an edge b...
A triangulation of a finite point set A in IR d is a geometric simplicial complex which covers the c...
How many ways can a convex polygon of n（≥3） sides be triangulated by diagonals that do not intersect...
We show that the maximum number of convex polygons in a triangulation of n points in the plane is O(...
In this paper we study the problem of flipping edges in triangulations of polygons and point sets. W...
In a straight-line embedded triangulation of a point set P in the plane, removing an inner edge and—...
AbstractIt is known that a convex polygon of n sides admits Cn-2 triangulations, where Cn is a Catal...
A $k$-triangulation of a convex polygon is a maximal set of diagonals so that no $k+1$ of them mutua...
This thesis explores two specific topics of discrete geometry, the multitriangulations and the polyt...
Abstract. A k-triangulation of a convex polygon is a maximal set of diagonals so that no k+1 of them...
AbstractTriangulation of polygons is a classical problem in computational geometry. For an arbitrary...
AbstractA k-triangulation of a convex polygon is a maximal set of diagonals so that no k+1 of them m...
AbstractTriangulation of polygons is a classical problem in computational geometry. For an arbitrary...
Triangulating a given n-vertex simple polygon means to partition the interior of the polygon into n ...
In this thesis, we consider the g-angulation existence problem of a convex geometric graph G. A tria...
DOI
Add to ORKG