Deciding whether a hypergraph admits a straight-line or straight-segment representation is ∃R-hard in six natural variants, with polynomial algorithms for low-rank or low-degree cases.
Geometry revisited , volume 19
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CG 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Representing Hypergraphs by Point-Line Incidences
Deciding whether a hypergraph admits a straight-line or straight-segment representation is ∃R-hard in six natural variants, with polynomial algorithms for low-rank or low-degree cases.