Computational geometry: an introduction
Computational geometry: an introduction
An implicit data structure supporting insertion, deletion, and search in O(log:OS2:OEn) time
Journal of Computer and System Sciences
Constructing higher-dimensional convex hulls at logarithmic cost per face
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Lower bounds for orthogonal range searching: I. The reporting case
Journal of the ACM (JACM)
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Reporting points in halfspaces
Computational Geometry: Theory and Applications
Discrete & Computational Geometry - Special issue on ACM symposium on computational geometry, North Conway
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Convex hulls of finite sets of points in two and three dimensions
Communications of the ACM
Closest-point problems simplified on the RAM
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Implicit dictionaries supporting searches and amortized updates in O(log n log log n) time
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Implicit B-Trees: New Results for the Dictionary Problem
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
In-Place Planar Convex Hull Algorithms
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Linear-Time Reconstruction of Delaunay Triangulations with Applications
ESA '97 Proceedings of the 5th Annual European Symposium on Algorithms
Sublinear geometric algorithms
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
An In-Place Sorting with O(n log n) Comparisons and O(n) Moves
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
An optimal randomized algorithm for maximum Tukey depth
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Multi-pass geometric algorithms
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time
Computational Geometry: Theory and Applications
An in-place algorithm for Klee's measure problem in two dimensions
Information Processing Letters
Space-efficient geometric divide-and-conquer algorithms
Computational Geometry: Theory and Applications
Line-segment intersection made in-place
Computational Geometry: Theory and Applications
In-place 2-d nearest neighbor search
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Succinct geometric indexes supporting point location queries
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Constant-Working-Space Algorithms for Image Processing
Emerging Trends in Visual Computing
Optimal in-place algorithms for 3-D convex hulls and 2-D segment intersection
Proceedings of the twenty-fifth annual symposium on Computational geometry
Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time
Computational Geometry: Theory and Applications
Geometric streaming algorithms with a sorting primitive
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Optimal in-place and cache-oblivious algorithms for 3-d convex hulls and 2-d segment intersection
Computational Geometry: Theory and Applications
Do we need a stack to erase a component in a binary image?
FUN'10 Proceedings of the 5th international conference on Fun with algorithms
Adaptive algorithms for planar convex hull problems
FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
In-Place algorithms for computing (layers of) maxima
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
In-place randomized slope selection
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Line-segment intersection made in-place
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Succinct geometric indexes supporting point location queries
ACM Transactions on Algorithms (TALG)
In-Place algorithms for computing a largest clique in geometric intersection graphs
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
An in-place min-max priority search tree
Computational Geometry: Theory and Applications
Reprint of: Memory-constrained algorithms for simple polygons
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
For many geometric problems, there are efficient algorithms that surprisingly use very little extra space other than the given array holding the input. For many geometric query problems, there are efficient data structures that need no extra space at all other than an array holding a permutation of the input. In this paper, we obtain the first such space-economical solutions for a number of fundamental problems, including three-dimensional convex hulls, two-dimensional Delaunay triangulations, fixed-dimensional range queries, and fixed-dimensional nearest neighbor queries.