Is still an open problem?

[Angel Plaza]

In the paper "Computational Geometry Column 23", (in the Internt. J.
Comput. Geom. Appl. 4 (1994), 239-242) authors talk about three 
open
problems in Computational Geometry. The first one is: Does 
tetrahedral
bisection refinement keeps solid angles bound away from zero?

I would like to know if that problem remains open or not. 

Thanks,

Angel Plaza
Departamento de Matemáticas
Edificio de Matemáticas e Informática
Campus de Tafira
Universidad de Las Palmas de Gran Canaria
35017-Las Palmas de Gran Canaria 
SPAIN
Tfo: 34-928-458827
Fax: 34-928-458711
 

-------------
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://www.uiuc.edu/~sariel/CG/compgeom/maillist.html.