## Pellegrini, M., Lower bounds on stabbing lines in 3-space, Computational Geometry: Theory and Applications 3 (1993) 53-58. A stabbing line for a set of convex polyhedra is extremal if it passes through four edges and is tangent to the polyhedra containing those edges. In this paper we present
Lower bounds for line stabbing
β Scribed by D. Avis; J.M. Robert; R. Wenger
- Publisher
- Elsevier Science
- Year
- 1989
- Tongue
- English
- Weight
- 721 KB
- Volume
- 33
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract For any graph __G__, let __i__(__G__) and ΞΌ;(__G__) denote the smallest number of vertices in a maximal independent set and maximal clique, respectively. For positive integers __m__ and __n__, the lower Ramsey number __s__(__m, n__) is the largest integer __p__ so that every graph of or
We show lower bounds on the worst-case complexity of Shellsort. In particular, Ε½ Ε½ 2 . Ε½ . 2 . we give a fairly simple proof of an β n lg n r lg lg n lower bound for the size of Shellsort sorting networks for arbitrary increment sequences. We also show an identical lower bound for the running time o
## Abstract One of Demailly's characterization of Seshadri constants on ample line bundles works with Lelong numbers of certain positive singular hermitian metrics. In this note this is translated into algebraic terms by using sections of multiples of the line bundle. The resulting formula for Sesh