𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Complexity of Arrangements of Circles in the Plane

✍ Scribed by N. Alon; H. Last; R. Pinchasi; M. Sharir

Publisher
Springer
Year
2001
Tongue
English
Weight
230 KB
Volume
26
Category
Article
ISSN
0179-5376

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On Line Arrangements in the Hyperbolic P
On Line Arrangements in the Hyperbolic Plane
✍ A. Dress; J.H. Koolen; V. Moulton πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 138 KB

Given a finite collection L of lines in the hyperbolic plane H, we denote by k = k(L) its Karzanov number, i.e., the maximal number of pairwise intersecting lines in L, and by C(L) and n = n(L) the set and the number, respectively, of those points at infinity that are incident with at least one line

The complexity of cells in three-dimensi
The complexity of cells in three-dimensional arrangements
✍ H. Edelsbrunner; D. Haussler πŸ“‚ Article πŸ“… 1986 πŸ› Elsevier Science 🌐 English βš– 439 KB

A set of m planes dissects E3 into cells, facets, edges and vertices. Letting deg(c) be the number of facets that bound a cell c, we give exact and asymptotic bounds on the maximum of Crincdeg(c), if C is a family of cells of the arrangement with fixed cardinality. \* Research reported in the paper

The random packing of circles in a plane
The random packing of circles in a plane
✍ H.H Kausch; D.G Fesko; N.W Tschoegl πŸ“‚ Article πŸ“… 1971 πŸ› Elsevier Science 🌐 English βš– 769 KB
On the complexity of cutting-plane proof
On the complexity of cutting-plane proofs
✍ W. Cook; C.R. Coullard; Gy. TurΓ‘n πŸ“‚ Article πŸ“… 1987 πŸ› Elsevier Science 🌐 English βš– 881 KB