A hidden set is a set of points such that no two points in the set are visible to each other. In this paper we study hidden sets of points in arrangements of segments, and we provide bounds for its maximum size that are optimal up to a factor 2.
Excess in arrangements of segments
β Scribed by Micha Sharir
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 281 KB
- Volume
- 58
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract Though somatotypic representation within the face in human primary somatosensory cortex (S1) to innocuous stimuli is controversial; previous work suggests that painful heat is represented based on an βonionβskinβ or segmental pattern on the face. The aim of this study was to determine i
A set of n nonconcurrent lines in the projective plane (called an arrangement) divides the plane into polygonal cells. It has long been a problem to find a nontrivial upper bound on the number of triangular regions. We show that &n(n -1) is such a bound. We also show that if no three lines are concu