Output-sensitive cell enumeration in hyperplane arrangements
From MaRDI portal
Publication:5054865
DOI10.1007/BFb0054377zbMath1502.68347OpenAlexW1508613754MaRDI QIDQ5054865
Publication date: 9 December 2022
Published in: Algorithm Theory — SWAT'98 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bfb0054377
Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35)
Related Items
A New Algorithm for Enumeration of Cells of Hyperplane Arrangements and a Comparison with Avis and Fukuda's Reverse Search, Nonparametric Maximum Likelihood Methods for Binary Response Models With Random Coefficients
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Topologically sweeping an arrangement
- Primal-dual methods for vertex and facet enumeration
- The parallel search bench ZRAM and its applications
- Reverse search for enumeration
- Constructing Arrangements of Lines and Hyperplanes with Applications
- Linear Programming in Linear Time When the Dimension Is Fixed
- Enumerating extreme points in higher dimensions