[Boissonnat and Teillaud 93] Jean-Daniel Boissonnat and Monique Teillaud. ―On the Randomized
Construction of the Delaunay Tree.‖ Theoret. Comput. Sci. 112 (1993), 339–354.
[Borgefors 84] G. Borgefors. ―Distance Transformations in Arbitrary Dimensions.‖ In Computer. Vision,
Graphics, Image Processing, 27, pp. 321–345, 1984.
[Boyer et al. 00] Elizabeth D. Boyer, L. Lister, and B. Shader. ―Sphere-of-Influence Graphs Using the Sup-
Norm.‖ Mathematical and Computer Modelling 32:10 (2000), 1071–1082.
[Bremer et al. 02] Peer-Timo Bremer, Serban D. Porumbescu, Falko Kuester, Bernd Hamann, Kenneth I.
Joy, and Kwan-Liu Ma. ―Virtual Clay Modeling using Adaptive Distance Fields.‖ In Proceedings of the
2002 International Conference on Imaging Science, Systems, and Technology (CISST 2002), edited by
H. R. Arambnia et al. Athens, Georgia, 2002.
[Brown 79] K. Q. Brown. ―Voronoi Diagrams from Convex Hulls.‖ Inform. Process. Lett. 9:5 (1979), 223–
228.
[Burnikel et al. 94] C. Burnikel, K. Mehlhorn, and S. Schirra. ―On Degeneracy in Geometric
Computations.‖ In Proc. 5th ACM-SIAM Sympos. Discrete Algorithms, pp. 16–23, 1994.
[Burnikel et al. 95] Christoph Burnikel, Jochen Könnemann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra,
and Christian Uhrig. ―Exact Geometric Computation in LEDA.‖ In Proc. 11th Annu. ACM Sympos.
Comput. Geom., pp. C18–C19, 1995.
[Burnikel et al. 99] C. Burnikel, R. Fleischer, K. Mehlhorn, and S. Schirra. ―Efficient Exact Geometric
Computation Made Easy.‖ In Proc. 15th Annu. ACM Sympos. Comput. Geom., pp. 341–350, 1999.
[Burnikel et al. 00] C. Burnikel, R. Fleischer, K. Mehlhorn, and S. Schirra. ―A Strong and Easily
Computable Separation Bound for Arithmetic Expressions Involving Radicals.‖ Algorithmica 27:1 (2000),
87–99.
[Burnikel et al. 01] C. Burnikel, S. Funke, K. Mehlhorn, S. Schirra, and S. Schmitt. ―A Separation Bound
for Real Algebraic Expressions.‖ In Proc. 9th Annu. European Sympos. Algorithms, Lecture Notes
Comput. Sci., 2161, edited by Friedhelm Meyer auf der Heide, pp. 254–265. Springer-Verlag, 2001.
[Chew 89] L. P. Chew. ―Constrained Delaunay Triangulations.‖ Algorithmica 4 (1989), 97–108.
[Chew 93] L. P. Chew. ―Guaranteed-Quality Mesh Generation for Curved Surfaces.‖ In Proc. 9th Annu.
ACM Sympos. Comput. Geom., pp. 274–280, 1993.
[Chin 92] Norman Chin. ―Partitioning a 3D Convex Polygon with an Arbitrary Plane.‖ In Graphics Gems III,
edited by David Kirk, chapter V.2, pp. 219–222. Academic Press, 1992.
[Clarkson 92] K. L. Clarkson. ―Safe and Effective Determinant Evaluation.‖ In Proc. 33rd Annu. IEEE
Sympos. Found. Comput. Sci., pp. 387–395, 1992.
[Cleveland and Loader 95] W. S. Cleveland and C. L. Loader. ―Smoothing by Local Regression:
Principles and Methods.‖ In Statistical Theory and Computational Aspects of Smoothing, edited by W.
Haerdle and M. G. Schimek, pp. 10–49. New York: Springer, 1995.
[Cohen-Or et al. 98] Daniel Cohen-Or, Amira Solomovici, and David Levin. ―Three-Dimensional Distance
Field Metamorphosis.‖ ACM Transactions on Graphics 17:2 (1998), 116–141.
[Cole 86] R. Cole. ―Searching and Storing Similar Lists.‖ J. Algorithms 7 (1986), 202– 220.
[Comba 99] João Luiz Dihl Comba. ―Kinetic Vertical Decomposition Trees.‖ PhD dissertation, Stanford
University, 1999. Available from World Wide Web (http://graphics.stanford.edu/~comba/kvd/kvd.html).
[Coren and Girgus 78] S. Coren and J. S. Girgus. Seeing is Deceiving: The Psychology of Visual
Illusions. Lawrence Erlbaum Associates, 1978.
[Cover and Hart 67] T.M. Cover and P.E. Hart. ―Nearest Neighbor Pattern Classification.‖ IEEE
Transactions on Information Theory IT-13:1 (1967), 21–27.