Abstract
We pose a monotonicity conjecture on the number of pseudo-triangulations of any planar point set, and check it in two prominent families of point sets, namely the so-called double circle and double chain. The latter has asymptotically 12nn£(1) pointed pseudo-triangulations, which lies signi¯cantly above the maximum number of triangulations in a planar point set known so far.
Original language | English |
---|---|
Title of host publication | Proc. 15th Canadian Conference on Computational Geometry (CCCG) |
Pages | 141-144 |
Publication status | Published - 2003 |
Event | 15th Canadian Conference on Computational Geometry (CCCG 2003) - Halifax, Canada Duration: 11 Aug 2003 → 13 Aug 2003 Conference number: 15 |
Conference
Conference | 15th Canadian Conference on Computational Geometry (CCCG 2003) |
---|---|
Abbreviated title | CCCG |
Country/Territory | Canada |
City | Halifax |
Period | 11/08/03 → 13/08/03 |