Abstract
Let ℋ be a collection of n hyperplanes in d-space in general position. For each tuple of d+1 hyperplanes of ℋ consider the open ball inscribed in the simplex that they form. Let ℬ k denote the number of such balls intersected by exactly k hyperplanes, for k=0, 1,..., n-d-1. We show that {Mathematical expression}.
Original language | English (US) |
---|---|
Pages (from-to) | 421-425 |
Number of pages | 5 |
Journal | Discrete & Computational Geometry |
Volume | 10 |
Issue number | 1 |
DOIs | |
State | Published - Dec 1993 |
ASJC Scopus subject areas
- Theoretical Computer Science
- Geometry and Topology
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics