Hiding points in arrangements of segments
β Scribed by F. Hurtado; O. Serra; J. Urrutia
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 500 KB
- Volume
- 162
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
β¦ Synopsis
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.
π SIMILAR VOLUMES
We give a brief description of the operation principles of LeaVis, a prototype industrial machine vision system aimed at processing and segmentation of the images of hides marked by lines and other symbols that show defects and areas of different quality. The goal of LeaVis is to provide a visual in
Let A(H) be the arrangement of a set H of n hyperplanes in d-space. A k-flat is a k-dimensional affine subspace of d-space. The zone of a k-flat f with respect to H is the set of all faces in A(H) that intersect f. In this paper we study some problems on zones of k-flats. Our most important result i
## 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