BCBelén Cruces
Belén Cruces
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Belén Cruces has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
- Clemens Huemer
Universitat Politecnica de Catalunya
2 shared publications - Dolores Lara
Centro de Investigación y de Estudios Avanzados del Instituto Politécnico Nacional, Mexico City, Mexico
2 shared publications
Latest Publications
- Open Access
- 21 January 2026
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 42 (1) , 16
On the Number of Drawings of a Combinatorial Triangulation
In 1962, Tutte provided a formula for the number of combinatorial triangulations, that is, maximal planar graphs with a fixed triangular face and n additional vertices. In this note, we study in how many ways a combinatorial triangulation can be drawn as geometric triangulation, that is, with straight-line segments, on a given point set in the plane. Our central contribution is that there exist a combinatorial triangulation T and a point set S such that T can be drawn on S in at least $$\varOmega (1,31^n)$$ ways as different geometric triangulations. We also show an upper bound on the number of drawings of a combinatorial triangulation on the so-called double chain point set.- 21 January 2026
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 42 (1) , 16
Open AccessOn the Number of Drawings of a Combinatorial Triangulation
In 1962, Tutte provided a formula for the number of combinatorial triangulations, that is, maximal planar graphs with a fixed triangular face and n additional vertices. In this note, we study in how many ways a combinatorial triangulation can be drawn as geometric triangulation, that is, with straight-line segments, on a given point set in the plane. Our central contribution is that there exist a combinatorial triangulation T and a point set S such that T can be drawn on S in at least $$\varOmega (1,31^n)$$ ways as different geometric triangulations. We also show an upper bound on the number of drawings of a combinatorial triangulation on the so-called double chain point set. - Open Access
On the number of drawings of a combinatorial triangulation
In 1962, Tutte provided a formula for the number of combinatorial triangulations, that is, maximal planar graphs with a fixed triangular face and $n$ additional vertices. In this note, we study how many ways a combinatorial triangulation can be drawn as geometric triangulation, that is, with straight-line segments, on a given point set in the plane. Our central contribution is that there exists a combinatorial triangulation with n vertices that can be drawn in at least $Ω(1,31^n)$ ways on a set of n points as different geometric triangulations. We also show an upper bound on the number of drawings of a combinatorial triangulation on the so-called double chain point set.Open AccessOn the number of drawings of a combinatorial triangulation
In 1962, Tutte provided a formula for the number of combinatorial triangulations, that is, maximal planar graphs with a fixed triangular face and $n$ additional vertices. In this note, we study how many ways a combinatorial triangulation can be drawn as geometric triangulation, that is, with straight-line segments, on a given point set in the plane. Our central contribution is that there exists a combinatorial triangulation with n vertices that can be drawn in at least $Ω(1,31^n)$ ways on a set of n points as different geometric triangulations. We also show an upper bound on the number of drawings of a combinatorial triangulation on the so-called double chain point set.