Memory-constrained algorithms for simple polygons
Authors:
- Tetsuo AsanoTATetsuo Asano
- Kevin BuchinKBKevin Buchin
- Maike BuchinMBMaike Buchin
- Matias KormanMKMatias Korman
- Wolfgang MulzerWMWolfgang Mulzer
- Günter RoteGRGünter Rote
- André SchulzASAndré Schulz
- 1 October 2013
- journal article
- research article
- Published by Elsevier in Computational Geometry
- Vol. 46 (8) , 959-969
Abstract
No abstract availableKeywords
All Related Versions
This publication has 17 references indexed in Scilit:
- Optimal in-place and cache-oblivious algorithms for 3-d convex hulls and 2-d segment intersectionComputational Geometry, 2010
- Comparison-based time-space lower bounds for selectionACM Transactions on Algorithms, 2010
- Undirected connectivity in log-spaceJournal of the ACM, 2008
- Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear timeComputational Geometry, 2006
- Data Streams: Algorithms and ApplicationsFoundations and Trends® in Theoretical Computer Science, 2005
- Space-efficient planar convex hull algorithmsTheoretical Computer Science, 2004
- Selection from read-only memory and sorting with minimum data movementTheoretical Computer Science, 1996
- Triangulating Simple Polygons and Equivalent ProblemsACM Transactions on Graphics, 1984
- Triangulation and shape-complexityACM Transactions on Graphics, 1984
- Selection and sorting with limited storageTheoretical Computer Science, 1980