Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

COMPGEOM
2005
ACM

favoriteEmaildiscussreport

100views Discrete Geometry» more COMPGEOM 2005»

Multi-pass geometric algorithms

13 years 6 months ago

Multi-pass geometric algorithms

Download www.cs.utsa.edu

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

Timothy M. Chan, Eric Y. Chen

Real-time Traffic

COMPGEOM 2005 | Convex Hulls | Discrete Geometry | Exact Geometric Algorithms | Linear Programming |

claim paper

Related Content

» Lower Bounds for MultiPass Processing of Multiple Data Streams

» Improving the Access Time Performance of Serpentine Tape Drives

» Geometrically Consistent Mesh Modification

» Algorithms for the transportation problem in geometric settings

» The Geometric Efficient Matching Algorithm for Firewalls

» On the structure and composition of forbidden sequences with geometric applications

» Weighted capacitated priority and geometric set cover via improved quasiuniform sampling

» Spatial selfsynchronizing video watermarking technique

» Compressive sensing with local geometric features

» Bidimensionality and geometric graphs

Post Info
More Details (n/a)

Added	13 Oct 2010
Updated	13 Oct 2010
Type	Conference
Year	2005
Where	COMPGEOM
Authors	Timothy M. Chan, Eric Y. Chen

Comments (0)