2026-07-22T18:45:15Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:6800 2024-03-06T10:38:55Z ddc:004 open_access

Space-Efficient Plane-Sweep Algorithms Elmasry, Amr Kammer, Frank closest pair line-segments intersection Klee's measure We introduce space-efficient plane-sweep algorithms for basic planar geometric problems. It is assumed that the input is in a read-only array of n items and that the available workspace is Theta(s) bits, where lg n <= s <= n * lg n. Three techniques that can be used as general tools in different space-efficient algorithms are introduced and employed within our algorithms. In particular, we give an almost-optimal algorithm for finding the closest pair among a set of n points that runs in O(n^2 /s + n * lg s) time. We also give a simple algorithm to enumerate the intersections of n line segments that runs in O((n^2 /s^{2/3}) * lg s + k) time, where k is the number of intersections. The counting version can be solved in O((n^2/s^{2/3}) * lg s) time. When the segments are axis-parallel, we give an O((n^2/s) * lg^{4/3} s + n^{4/3} * lg^{1/3} n)-time algorithm that counts the intersections and an O((n^2/s) * lg s * lg lg s + n * lg s + k)-time algorithm that enumerates the intersections, where k is the number of intersections. We finally present an algorithm that runs in O((n^2 /s + n * lg s) * sqrt{(n/s) * lg n}) time to calculate Klee's measure of axis-parallel rectangles. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Amr Elmasry and Frank Kammer 2016 Is Part Of LIPIcs, Volume 64, 27th International Symposium on Algorithms and Computation (ISAAC 2016) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ISAAC.2016.30 urn:nbn:de:0030-drops-68009 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.30 eng https://creativecommons.org/licenses/by/3.0/legalcode