Proc. 9th Symp. Computational Geometry
- Compatible tetrahedralizations, Ber-SCG-93
- Worst-case bounds for subadditive geometric graphs, BerEpp-SCG-93
- Guaranteed-quality mesh generation for curved surfaces, Che-SCG-93
- Approximating center points with iterated Radon points, ClaEppMil-SCG-93
- Counting triangle crossings and halving planes, DeyEde-SCG-93
- Computing the discrepancy, DobEpp-SCG-93
- A deterministic linear time algorithm for geometric separators and its applications, EppMilTen-SCG-93
- Dynamic ray shooting and shortest paths via balanced geodesic triangulations, GooTam-SCG-93
- Tentative prune-and-search for computing Voronoi vertices, KirSno-SCG-93
