An optimal algorithm for finding segments intersections
Proceedings of the eleventh annual symposium on Computational geometry
Communications of the ACM
Asymptotically efficient in-place merging
Theoretical Computer Science
In-Place Planar Convex Hull Algorithms
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Towards in-place geometric algorithms and data structures
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Algorithms for Reporting and Counting Geometric Intersections
IEEE Transactions on Computers
An in-place algorithm for Klee's measure problem in two dimensions
Information Processing Letters
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
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
| Hi-index | 0.03 |
We present a space-efficient algorithm for reporting all k intersections induced by a set of n line segments in the place. Our algorithm is an in-place variant of Balaban's algorithm and runs in $\mathcal{O}(n log^2_2 n + k)$ time using $\mathcal{O}$(1) extra words of memory over and above the space used for the input to the algorithm.