David Eppstein - Publications
- Application Challenges to Computational Geometry.
Computational Geometry Impact Task Force
Rep. TR-521-96, Princeton University, April 1996.
Advances in Discrete and Computational Geometry – Proc. 1996 AMS-IMS-SIAM
Joint Summer Research Conf. Discrete and Computational Geometry: Ten
Years Later, Contemporary Mathematics 223, Amer. Math. Soc., 1999, pp. 407–423.
- Ununfoldable polyhedra.
A. Mantler, and
CS-99-04, Univ. of Waterloo, Dept. of Computer Science, Aug. 1999.
11th Canad. Conf. Comp. Geom., 1999.
Worksh. Computational Geometry, Johns Hopkins Univ., 1999.
Comp. Geom. Theory & Applications (special
issue for 4th CGC Worksh.) 24 (2): 51–62, 2003.
We prove the existence of polyhedra in which all faces are convex,
but which can not be cut along edges and folded flat.
Note variations in different versions: the CCCG one was only Bern,
Demain, Eppstein, and Kuo, and the WCG one had the title "Ununfoldable
polyhedra with triangular faces". The journal version uses the title
"Ununfoldable polyhedra with convex faces" and
the combined results from both conference versions.
publication page –
- Emerging challenges in computational topology.
D. Eppstein, et al.
This is the report from the ACM Workshop on Computational Topology
run by Marshall and myself in Miami Beach, June 1999.
It details goals, current research, and recommendations
in this emerging area of collaboration between computer science and
David Eppstein –
Theory Group –
Inf. & Comp. Sci. –
from a common source file.