Multi-Pass Geometric Algorithms

Authors:
Timothy M. Chan;Eric Y. Chen
Affiliations:
Bell Labs, 600 Mountain Avenue, Murray Hill, NJ 07974, USA;Bell Labs, 600 Mountain Avenue, Murray Hill, NJ 07974, USA
Venue:
Discrete & Computational Geometry
Year:
2007

Citing 0
Cited 8

Comparison-based time-space lower bounds for selection

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Comparison-based time-space lower bounds for selection

ACM Transactions on Algorithms (TALG)
In-place linear-time algorithms for Euclidean distance transform

Transactions on computational science VIII
In-place linear-time algorithms for Euclidean distance transform

Transactions on computational science VIII
Constant-Work-Space algorithm for a shortest path in a simple polygon

WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
Computing the visibility polygon using few variables

ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Efficient protocols for distributed classification and optimization

ALT'12 Proceedings of the 23rd international conference on Algorithmic Learning Theory
Reprint of: Memory-constrained algorithms for simple polygons

Computational Geometry: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

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.