Multi-pass geometric algorithms

We initiate 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 lowdimensional linear programming and convex hulls are considered. Categories and Subject Descriptors F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems—geometrical problems and computations General Terms Algorithms, Theory Keywords Streaming algorithms, convex hulls, linear programming

• Type: Conference
• Year: 2005
• Where: COMPGEOM
• Authors: Timothy M. Chan, Eric Y. Chen
• Keywords: COMPGEOM 2005, Convex Hulls, Discrete Geometry, Exact Geometric Algorithms, Linear Programming