Feb 1, 1993 · Thezone of σ inA is the collection of cells ofA crossed by σ. We show that the total number of faces bounding the cells of the zone of σ isO(n d ...
Jun 19, 2024 · It asserts that the zone of a hyperplane in an arrangement of n hyperplanes in R has complexity O(n a- 1). A recent proof of the Zone Theorem is ...
On the Zone of a Surface in a Hyperplane Arrangement. M. Sharir; B. Aronov; M. Pellegrini · Discrete & computational geometry (1993). Volume: 9, Issue: 2, page ...
Let H be a collection of n hyperplanes in ℝd, let A denote the arrangement of H, and let σ be a (d-1)-dimensional algebraic surface of low degree, ...
Let H be a collection of n hyperplanes in ℝd, let A denote the arrangement of H, and let σ be a (d - 1)-dimensional algebraic surface of low degree, ...
The zone of σ in A is the collection of cells of A crossed by σ. We show that the total number of faces bounding the cells of the zone of σ is O(n d−1 log n).
The zone theorem for an arrangement of n hyperplanes in d-dimensional real space says that the total number of faces bounding the cells intersected by ...
A new proof of the zone theorem is presented based on an inductive argument, which also applies in the case of pseudohyperplane arrangements and the ...
The zone theorem for an arrangement of n hyperplanes in d-dimensional real space says that the total number of faces bounding the cells intersected by ...
Jan 13, 2017 · every point p that comes from intersecting d hyperplanes is a "smallest point" for some region: just take the region defined by these d ...
Missing: Zone | Show results with:Zone