# Constructing Many Faces in Arrangements of Lines and Segments

We present new algorithms for computing many faces in arrangements of lines and segments. Given a set S of n lines (resp., segments) and a set P of m points in the plane, the problem is to compute the faces of the arrangements of S that contain at least one point of P. For the line case, we give a deterministic algorithm of O(m^2/3n^2/3log^2/3 (n/√(m))+(m+n)log n) time. This improves the previously best deterministic algorithm [Agarwal, 1990] by a factor of log^2.22n and improves the previously best randomized algorithm [Agarwal, Matoušek, and Schwarzkopf, 1998] by a factor of log^1/3n in certain cases (e.g., when m=Θ(n)). For the segment case, we present a deterministic algorithm of O(n^2/3m^2/3log n+τ(nα^2(n)+nlog m+m)log n) time, where τ=min{log m,log (n/√(m))} and α(n) is the inverse Ackermann function. This improves the previously best deterministic algorithm [Agarwal, 1990] by a factor of log^2.11n and improves the previously best randomized algorithm [Agarwal, Matoušek, and Schwarzkopf, 1998] by a factor of log n in certain cases (e.g., when m=Θ(n)). We also give a randomized algorithm of O(m^2/3K^1/3log n+τ(nα(n)+nlog m+m)log nlog K) expected time, where K is the number of intersections of all segments of S. In addition, we consider the query version of the problem, that is, preprocess S to compute the face of the arrangement of S that contains any query point. We present new results that improve the previous work for both the line and the segment cases.

There are no comments yet.

## Authors

• 21 publications
• ### Algorithms for Subpath Convex Hull Queries and Ray-Shooting Among Segments

In this paper, we first consider the subpath convex hull query problem: ...
02/25/2020 ∙ by Haitao Wang, et al. ∙ 0

• ### Hopcroft's Problem, Log-Star Shaving, 2D Fractional Cascading, and Decision Trees

We revisit Hopcroft's problem and related fundamental problems about geo...
11/05/2021 ∙ by Timothy M. Chan, et al. ∙ 0

• ### Algorithms for the Line-Constrained Disk Coverage and Related Problems

Given a set P of n points and a set S of m weighted disks in the plane, ...
04/29/2021 ∙ by Logan Pedersen, et al. ∙ 0

• ### Optimal Window Queries on Line Segments using the Trapezoidal Search DAG

We propose new query applications of the well known randomized increment...
11/13/2021 ∙ by Milutin Brankovic, et al. ∙ 0

• ### A Simple Algorithm for Computing the Zone of a Line in an Arrangement of Lines

Let L be a set of n lines in the plane. The zone Z(ℓ) of a line ℓ in the...
11/16/2021 ∙ by Haitao Wang, et al. ∙ 0

• ### Deterministic Algorithms for the Hidden Subgroup Problem

In this note, we present deterministic algorithms for the Hidden Subgrou...
04/29/2021 ∙ by Ashwin Nayak, et al. ∙ 0