The crust and the beta-skeleton: Combinatorial curve reconstruction
.
N. Amenta, M. Bern, and D. Eppstein.
Graphical Models and Image Processing
, 60(2):125--135, 1998.
A randomization scheme for speeding up algorithms for linear and convex quadratic programming problems with a high constraints-to-variables ratio
.
I. Adler and R. Shamir.
Math. Prog.
, 61:39--52, 1993.
Preliminary version in
Rutgers Univ. Tech. Report
, 1990.
Almost optimal set covers in finite VC-dimension
.
H. Br{\"o}nnimann and M. T. Goodrich.
In
Proc. 10th Annu. ACM Sympos. Comput. Geom.
, pages 293--302, 1994.
Approximate clustering via core-sets
.
Mihai B\u{a}doiu, Sariel Har-Peled, and Piotr Indyk.
In
Proc. 34th Symp. on Theory of Computing
, 2002.
A numerical method for solving partial differential equations on highly irregular evolving grids
.
J. Braun and M. Sambridge.
Nature
, 376:655--659, 1995.
Multi-pass geometric algorithms
.
Timothy M. Chan and Eric Y. Chen.
In
Proc. 21st ACM Symposium on Computational Geometry
, pages 180--189, 2005.
Linear programming and its relatives
.
Geometry Center.
A code collection.
Polygons: decomposition, point location, intersection, visibility
.
Geometry Center.
A code collection.
Output-sensitive results on convex hulls, extreme points, and related problems
.
Timothy M. Y. Chan.
In
Proc. 11th Annu. ACM Sympos. Comput. Geom.
, pages 10--19, 1995.
Sublinear geometric algorithms
.
Bernard Chazelle, Ding Liu, and Avner Magen.
In
Annual {ACM} Symposium on Theory of Computing
, 2003.
On the shape of a set of points in the plane
.
H. Edelsbrunner, D. G. Kirkpatrick, and R. Seidel.
IEEE Trans. Inform. Theory
, IT-29:551--559, 1983.
Navigating nets: simple algorithms for proximity search
.
R. Krauthgamer and J. R. Lee.
In
SODA '04: Proceedings of the Fifteenth Annual {ACM-SIAM} Symposium on Discrete Algorithms
, pages 798--807. Society for Industrial and Applied Mathematics, 2004.
Finding nearest neighbors in growth-restricted metrics
.
D. R. Karger and M. Ruhl.
In
{STOC} '02: Proceedings of the Thirty-Fourth Annual {ACM} Symposium on Theory of Computing
, pages 741--750. ACM Press, 2002.
Linear programming in linear time when the dimension is fixed
.
N. Megiddo.
J. ACM
, 31:114--127, 1984.
R. Motwani and P. Raghavan.
Randomized algorithms.
Cambridge University Press, Cambridge, 1995.
Separation and approximation of polyhedral surfaces
.
J. S. B. Mitchell and S. Suri.
In
Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms
, pages 296--306, 1992.
A subexponential bound for linear programming
.
J. Matou{\v s}ek, M. Sharir, and E. Welzl.
In
Proc. 8th Annu. ACM Sympos. Comput. Geom.
, pages 1--8, 1992.
Separators in two and three dimensions
.
G. L. Miller and W. Thurston.
In
STOC '90: Proceedings of the twenty-second annual ACM symposium on Theory of computing
, pages 300--309, New York, NY, USA, 1990. ACM Press.
K. Mulmuley.
Computational geometry: An introduction through randomized algorithms.
Prentice Hall, New York, 1993.
Enumerating extreme points in higher dimensions
.
T. Ottmann, S. Schuierer, and S. Soundaralakshmi.
In
Proc. 12th Sympos. Theoret. Aspects Comput. Sci. (STACS)
, volume 900 of
Lecture Notes in Computer Science
, pages 562--570. Springer-Verlag, 1995.
Small-dimensional linear programming and convex hulls made easy
.
R. Seidel.
Discrete \& Computational Geometry
, 6:423--434, 1991.
Backwards analysis of randomized geometric algorithms
.
R. Seidel.
In J. Pach, editor,
New Trends in Discrete and Computational Geometry
, volume 10 of
Algorithms and Combinatorics
, pages 37--68. Springer-Verlag, 1993.
David F. Watson.
Contouring: A guide to the analysis and display of spatial data.
Pergamon, 1992.