@inproceedings{3555,
abstract = {A sliver is a tetrahedron whose four vertices lie close to a plane and whose perpendicular projection to that plane is a convex quadrilateral with no short edge. Slivers are both undesirable and ubiquitous in 3-dimensional Delaunay triangulations. Even when the point-set is well-spaced, slivers may result. This paper shows that such a point set permits a small perturbation whose Delaunay triangulation contains no slivers. It also gives deterministic algorithms that compute the perturbation of n points in time O(n log n) with one processor and in time O(log n) with O(n) processors.},
author = {Edelsbrunner, Herbert and Li, Xiang and Miller, Gary and Stathopoulos, Andreas and Talmor, Dafna and Teng, Shang and Üngör, Alper and Walkington, Noel},
booktitle = {Proceedings of the 32nd annual ACM symposium on Theory of computing},
isbn = {9781581131840},
location = {Portland, OR, USA},
pages = {273 -- 277},
publisher = {ACM},
title = {{Smoothing and cleaning up slivers}},
doi = {10.1145/335305.335338},
year = {2000},
}