Proc. 6th Canad. Conf. Computational Geometry
Graph-theoretical conditions for inscribability and Delaunay realizability, DilSmi-CCCG-94
Numerically robust algorithm for constructing constrained Delaunay triangulation, InaSug-CCCG-94
The Delaunay triangulation maximizes the mean inradius, Lam-CCCG-94
Cardinality bounds for triangulations with bounded minimum angle, Mit-CCCG-94
Optimal tetrahedralization of the 3d-region “between” a convex polyhedron and a convex polygon, Pal-CCCG-94
[
D. Eppstein publications
] [
Citation database
] [
Locations
]
Fano
Experimental Web Server,
D. Eppstein
,
School of Information & Computer Science
,
UC Irvine