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
An optimal algorithm for intersecting line segments in the plane
Journal of the ACM (JACM)
An optimal algorithm for finding segments intersections
Proceedings of the eleventh annual symposium on Computational geometry
Efficient algorithms for line and curve segment intersection using restricted predicates
Computational Geometry: Theory and Applications
Communications of the ACM
Asymptotically efficient in-place merging
Theoretical Computer Science
An elementary algorithm for reporting intersections of red/blue curve segments
Computational Geometry: Theory and Applications
Intersecting is easier than sorting
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Optimizing stable in-place merging
Theoretical Computer Science
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Towards in-place geometric algorithms and data structures
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Space-efficient planar convex hull algorithms
Theoretical Computer Science - Latin American theorotical informatics
Algorithm Design
A simple algorithm for in-place merging
Information Processing Letters
Algorithms for Reporting and Counting Geometric Intersections
IEEE Transactions on Computers
Line-segment intersection made in-place
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Optimal in-place algorithms for 3-D convex hulls and 2-D segment intersection
Proceedings of the twenty-fifth annual symposium on Computational geometry
Optimal in-place and cache-oblivious algorithms for 3-d convex hulls and 2-d segment intersection
Computational Geometry: Theory and Applications
Some variations on constrained minimum enclosing circle problem
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
An in-place min-max priority search tree
Computational Geometry: Theory and Applications
Some variations on constrained minimum enclosing circle problem
Journal of Combinatorial Optimization
| Hi-index | 0.00 |
We present a space-efficient algorithm for reporting all k intersections induced by a set of n line segments in the plane. Our algorithm is an in-place variant of Balaban's algorithm and, in the worst case, runs in time using extra words of memory in addition to the space used for the input to the algorithm.