Advertisement
Published in:
2008 | OriginalPaper | Chapter
Inducing Polygons of Line Arrangements
Authors : Ludmila Scharf, Marc Scherfenberg
Published in: Algorithms and Computation
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
We show that an arrangement
$\mathcal{A}$
of
n
lines in general position in the plane has an inducing polygon of size
O
(
n
). Additionally, we present a simple algorithm for finding an inducing
n
-path for
$\mathcal {A}$
in
O
(
n
log
n
) time and an algorithm that constructs an inducing
n
-gon for a special class of line arrangements within the same time bound.