Abstract
We propose the study of exact geometric algorithms that require limited storage and make only a small number of passes over the input. Fundamental problems such as low-dimensional linear programming and convex hulls are considered. © 2006 Springer.
Cite
CITATION STYLE
APA
Chan, T. M., & Chen, E. Y. (2007). Multi-pass geometric algorithms. Discrete and Computational Geometry, 37(1), 79–102. https://doi.org/10.1007/s00454-006-1275-6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free