Any disjoint set of $n$ disks of arbitrary radii can be augmented by $O(n)$ "guide" disks so that the augmented system has a conveyor belt touching each disk exactly once, answering a conjecture of Demaine,Demaine, and Palop.Expand

We give a brief account of results concerning the number of triangulations on finite point sets in the plane, both for arbitrary sets and for specific sets such as the n × n integer lattice.

We show that each plane graph of order n 2 3 has a straight line embedding on the n-2 by n-2 grid. This embedding is computable in time O(n). A nice feature of the vertex-coordinates is that they… Expand

A number of natural enumeration problems in geometry and combinatorics are shown to be complete in the class # P introduced by Valiant. Among others this is established for the numeration of vertices… Expand