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
Stable unmerging in linear time and constant space
Information Processing Letters
Computing dominances inEn (short communication)
Information Processing Letters
On Finding the Maxima of a Set of Vectors
Journal of the ACM (JACM)
Dynamic Maintenance of Maxima of 2-d Point Sets
SIAM Journal on Computing
Multidimensional divide-and-conquer
Communications of the ACM
Communications of the ACM
Asymptotically efficient in-place merging
Theoretical Computer Science
Proceedings of the 17th International Conference on Data Engineering
Efficient Progressive Skyline Computation
Proceedings of the 27th International Conference on Very Large Data Bases
Towards in-place geometric algorithms and data structures
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Three-Dimensional Layers of Maxima
Algorithmica
Space-efficient planar convex hull algorithms
Theoretical Computer Science - Latin American theorotical informatics
Progressive skyline computation in database systems
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
Space-efficient geometric divide-and-conquer algorithms
Computational Geometry: Theory and Applications
Shooting stars in the sky: an online algorithm for skyline queries
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time
Computational Geometry: Theory and Applications
Line-segment intersection made in-place
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Linear Time Constant-Working Space Algorithm for Computing the Genus of a Digital Object
ISVC '08 Proceedings of the 4th International Symposium on Advances 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
| Hi-index | 0.00 |
We describe space-efficient algorithms for solving problems related to finding maxima among points in two and three dimensions. Our algorithms run in optimal $\mathcal{O}({n\log n})$ time and occupy only constant extra space in addition to the space needed for representing the input