# Proc. 12th Symp. Computational Geometry

- Splitting a complex of convex polytopes in any dimension, BajPas-SCG-96
- On triangulating three-dimensional polygons, BarDicEpp-SCG-96
- Developing a practical projection-based parallel Delaunay algorithm, BleMilTal-SCG-96
- Approaching the largest $\beta$-skeleton within a minimum weight triangulation, CheXu-SCG-96
- Temporally coherent conservative visibility, CooTel-SCG-96
- A (usually?) connected subgraph of the minimum weight triangulation, DicMon-SCG-96
- Linear complexity hexahedral mesh generation, Epp-SCG-96
- On the number of arrangements of pseudolines, Fel-SCG-96
- Maintenance of the set of segments visible from a moving viewpoint in two dimensions, GhaSte-SCG-96
- Flipping edges in triangulations, HurNoyUrr-SCG-96
- An aspect ratio bound for triangulating a $d$-grid cut by a hyperplane, MitVav-SCG-96
- Fast randomized point location without preprocessing in two- and three-dimensional Delaunay triangulations, MucSaiZhu-SCG-96
- A near-linear algorithm for the planar 2-center problem, Sha-SCG-96
- Disk packings and planar separators, SpiTen-SCG-96