Covering points by hyperplanes and related problems
From MaRDI portal
Cites work
- A parameterized algorithm for the hyperplane-cover problem
- Applications of incidence bounds in point covering problems
- Counting facets and incidences
- Efficient partition trees
- Extremal problems in discrete geometry
- scientific article; zbMATH DE number 1670858 (Why is no real title available?)
- scientific article; zbMATH DE number 1017008 (Why is no real title available?)
- scientific article; zbMATH DE number 1943961 (Why is no real title available?)
- Incidences of not-too-degenerate hyperplanes
- Large Complete Bipartite Subgraphs In Incidence Graphs Of Points And Hyperplanes
- On a problem of K. Zarankiewicz
- On counting point-hyperplane incidences
- On the complexity of locating linear facilities in the plane
- On the number of incidences between points and planes in three dimensions
- Optimal partition trees
- Point-hyperplane incidence geometry and the log-rank conjecture
- The complexity and construction of many faces in arrangements of lines and of segments
This page was built for publication: Covering points by hyperplanes and related problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6896364)