a question

[Greg Perkins]

  Let T be a triangulation and define x \subset T
as simple if the union of all triangles in x forms
a simple polygon with no holes.  Let X be the
set of all simple subsets of T.  What is the size
of X?

  Has an upper-bound been proven for this?

Thanks,
Greg Perkins

-------------
The compgeom mailing lists: see
http://netlib.bell-labs.com/netlib/compgeom/readme.html
or send mail to compgeom-request at research.bell-labs.com with the line:
send readme
Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html.