Buscar
Mostrando ítems 1-3 de 3
Ponencia
Triangulations without pointed spanning trees
(2004)
Problem 50 in the Open Problems Project asks whether any triangulation on a point set in the plane contains a pointed spanning tree as a subgraph. We provide a counterexample. As a consequence we show that there ...
Ponencia
Ponencia
3D realization of two triangulations of a onvex polygon
(2004)
We study the problem of construction of a convex 3-polytope whose (i) shadow boundary has n vertices and (ii) two hulls, upper and lower, are isomorphic to two given triangulations of a convex n-gon. Barnette [℄ D. W. ...