Abstract
We analyze the minimum and maximum number of empty pseudo-triangles defined by any planar point set. We consider the cases where the three convex vertices are fixed and where they are not fixed. Furthermore, the pseudo-triangles must either be star-shaped or can be arbitrary.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the 19th Canadian Conference on Computational Geometry (CCCG 2007) 20-22 August 2007, Ottawa, Canada |
| Publisher | The CCCG Library |
| Pages | 37-40 |
| ISBN (Print) | 978-0-7709-0520-0 |
| Publication status | Published - 2007 |
| Event | conference; CCCG 2007, Ottawa, Canada; 2007-08-20; 2007-08-22 - Duration: 20 Aug 2007 → 22 Aug 2007 |
Conference
| Conference | conference; CCCG 2007, Ottawa, Canada; 2007-08-20; 2007-08-22 |
|---|---|
| Period | 20/08/07 → 22/08/07 |
| Other | CCCG 2007, Ottawa, Canada |