title

The complexity and construction of many faces in arrangements of lines and of segments | Discrete & Computational Geometry

charset

UTF-8

X-UA-Compatible

IE=edge

applicable-device

pc,mobile

viewport

width=device-width, initial-scale=1

og:url

https://link.springer.com/article/10.1007/BF02187784

og:type

article

og:site_name

SpringerLink

og:title

The complexity and construction of many faces in arrangements of lines and of segments - Discrete & Computational Geometry

og:description

We show that the total number of edges ofm faces of an arrangement ofn lines in the plane isO(m 2/3−δ n 2/3+2δ +n) for anyδ>0. The proof takes an algorithmic approach, that is, we describe an algorithm for the calculation of thesem faces and derive the upper bound from the analysis of the algorithm. The algorithm uses randomization and its expected time complexity isO(m 2/3−δ n 2/3+2δ logn+n logn logm). If instead of lines we have an arrangement ofn line segments, then the maximum number of edges ofm faces isO(m 2/3−δ n 2/3+2δ +nα (n) logm) for anyδ>0, whereα(n) is the functional inverse of Ackermann's function. We give a (randomized) algorithm that produces these faces and takes expected timeO(m 2/3−δ n 2/3+2δ log+nα(n) log2 n logm).

twitter:site

@SpringerLink

twitter:card

summary_large_image

twitter:image:alt

Content cover image

twitter:title

The complexity and construction of many faces in arrangements of lines and of segments

twitter:description

Discrete & Computational Geometry - We show that the total number of edges ofm faces of an arrangement ofn lines in the plane isO(m 2/3−δ n 2/3+2δ +n) for anyδ>0....

position

1

position

2

position

3

apple-touch-icon

/oscar-static/img/favicons/darwin/apple-touch-icon-6ef0829b9c.png

canonical

https://link.springer.com/article/10.1007/BF02187784

icon

/oscar-static/img/favicons/darwin/android-chrome-192x192.png

icon

/oscar-static/img/favicons/darwin/favicon-32x32.png

icon

/oscar-static/img/favicons/darwin/favicon-16x16.png