Minimal tangent visibility graphs
Computational Geometry: Theory and Applications
Lower bounds on the number of crossing-free subgraphs of KN
Computational Geometry: Theory and Applications
A better upper bound on the number of triangulations of a planar point set
Journal of Combinatorial Theory Series A
A combinatorial approach to planar non-colliding robot arm motion planning
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Pseudotriangulations from Surfaces and a Novel Type of Edge Flip
SIAM Journal on Computing
Convexity minimizes pseudo-triangulations
Computational Geometry: Theory and Applications - Special issue on the 14th Canadian conference on computational geometry — CCCG02
A lower bound on the number of triangulations of planar point sets
Computational Geometry: Theory and Applications
Allocating Vertex π-Guards in Simple Polygons via Pseudo-Triangulations
Discrete & Computational Geometry
The Polytope of Non-Crossing Graphs on a Planar Point Set
Discrete & Computational Geometry
Planar minimally rigid graphs and pseudo-triangulations
Computational Geometry: Theory and Applications - Special issue on the 19th annual symposium on computational geometry - SoCG 2003
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Acute Triangulations of Polygons
Discrete & Computational Geometry
Empty pseudo-triangles in point sets
Discrete Applied Mathematics
On numbers of pseudo-triangulations
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
We pose a monotonicity conjecture on the number of pseudo-triangulations of any planar point set, and check it on two prominent families of point sets, namely the so-called double circle and double chain. The latter has asymptotically 12^nn^@Q^(^1^) pointed pseudo-triangulations, which lies significantly above the maximum number of triangulations in a planar point set known so far.