AbstractWe show that the number of straight-edge triangulations exhibited by any set of n points in general position in the plane is bounded from below by Ω(2.33n)
AbstractLet Pn be the set of labelled planar graphs with n vertices. Denise, Vasconcellos and Welsh ...
We show that the number of partial triangulations of a set of $n$ points on the plane is at least th...
We show that there is a constant α> 0 such that, for any set P of n ≥ 5 points in general positio...
We show that the number of straight-edge triangulations exhibited by any set of n points in general...
We examine the number of triangulations that any set of n points in the plane must have, and prove t...
AbstractWe show that the number of straight-edge triangulations exhibited by any set of n points in ...
AbstractWe show that a point set of cardinality n in the plane cannot be the vertex set of more than...
We give a brief account of results concerning the number of triangulations on finite point sets in t...
A triangulation of a finite set S of points in R2 is a maximal set of line segments with disjoint in...
We present new lower bounds on the number of straight-edge triangulations that every set of n points...
Upper and lower bounds for the number of geometric graphs of specific types on a given set of points...
Upper and lower bounds for the number of geometric graphs of specific types on a given set of points...
We give upper and lower bounds on the maximum and minimum number of geometric configurations of vari...
We present algorithms that given a straight edge triangulation of n points in the plane encode a tri...
We show that the maximum number of convex polygons in a triangulation of n points in the plane is O(...
AbstractLet Pn be the set of labelled planar graphs with n vertices. Denise, Vasconcellos and Welsh ...
We show that the number of partial triangulations of a set of $n$ points on the plane is at least th...
We show that there is a constant α> 0 such that, for any set P of n ≥ 5 points in general positio...
We show that the number of straight-edge triangulations exhibited by any set of n points in general...
We examine the number of triangulations that any set of n points in the plane must have, and prove t...
AbstractWe show that the number of straight-edge triangulations exhibited by any set of n points in ...
AbstractWe show that a point set of cardinality n in the plane cannot be the vertex set of more than...
We give a brief account of results concerning the number of triangulations on finite point sets in t...
A triangulation of a finite set S of points in R2 is a maximal set of line segments with disjoint in...
We present new lower bounds on the number of straight-edge triangulations that every set of n points...
Upper and lower bounds for the number of geometric graphs of specific types on a given set of points...
Upper and lower bounds for the number of geometric graphs of specific types on a given set of points...
We give upper and lower bounds on the maximum and minimum number of geometric configurations of vari...
We present algorithms that given a straight edge triangulation of n points in the plane encode a tri...
We show that the maximum number of convex polygons in a triangulation of n points in the plane is O(...
AbstractLet Pn be the set of labelled planar graphs with n vertices. Denise, Vasconcellos and Welsh ...
We show that the number of partial triangulations of a set of $n$ points on the plane is at least th...
We show that there is a constant α> 0 such that, for any set P of n ≥ 5 points in general positio...
DOI
Add to ORKG