An algorithm for extending functions in hypercubes. Nieto, José Heber (1995) Divulgaciones Matemáticas
An Implementation of Ray Tracing Algorithm for the Multiprocessor Machines Aleksandar B. Samardžić, Dušan Starčević, Milan Tuba (2006) The Yugoslav Journal of Operations Research
An inequality related to two integer sequences satisfying an order condition. Acketa, Dragan (1999) Novi Sad Journal of Mathematics
An O (n log n) Algorithm for Computing the Link Center of a Simple Polygon. J.H. Conway, N.J.A. Sloane (1992) Discrete & computational geometry
An Optimal Convex Hull Algorithm in Any Fixed Dimension. B. Chazelle (1993) Discrete & computational geometry
An Upper Bound for Conforming Delaunay Triangulations. H. Edelsbrunner, Tiow Seng Tan (1993) Discrete & computational geometry
An Upper Bound on the Number of Planar K-Sets. J. Pach, E. Szemeredi, W. Steiger (1992) Discrete & computational geometry
Applications of a New Space-Partitioning Technique. M. Sharir, P.K. Agarwal (1993) Discrete & computational geometry
Applications of Random Sampling to On-Line Algorithms in Computational Geometry. R. Schott, J.D. Boissonnat, O. Devillers, M. Teillaud (1992) Discrete & computational geometry
Approximating the Minimum Weight Steiner Triangulation. D. Eppstein (1994) Discrete & computational geometry
Approximating the Volume of Convex Bodies. U. Betke, M. Henk (1993) Discrete & computational geometry
Areas of lattice polygons, applied to computer graphics Ren Ding, J. R. Reay (1987) Applicationes Mathematicae
Asymptotic classification of aliasing structures. Izmailov, R.N., Pokrovskii, A.V. (1992) Journal of Applied Mathematics and Stochastic Analysis
Basis of quartic splines over triangulation. Pílnikova, Jana, Chalmovianský, Pavel (1999) Journal for Geometry and Graphics
Better Lower Bounds on Detecting Affine and Spherical Degeneracies. R. Seidel, J. Erickson (1995) Discrete & computational geometry
Bisectors of Linearly Separable Sets. L.R. Nackman, V. Srinivasan (1991) Discrete & computational geometry
Bounds for orthogonal 3-D graph drawing. Biedl, T., Shermer, T., Whitesides, S., Wismath, S. (1999) Journal of Graph Algorithms and Applications
Bounds on the Size of Tetrahedralizations. B. Chazelle, N. Shouraboura (1995) Discrete & computational geometry
Can Visibility Graphs Be Represented Compactly?. N. Alon, S. Suri, P.K. Agarwal, B. Aronov (1994) Discrete & computational geometry