On counting point-hyperplane incidences

DOI10.1016/S0925-7721(02)00127-XMaRDI QIDQ1873152zbMATH OpenOpenAlexFDO

Authors Christian Knauer, Peter Brass

Publication date 19 May 2003

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0925-7721(02)00127-x

zbMATH Keywords

lower boundsbipartite subgraph compressionHopcroft's problempoint-hyperplane incidence structure

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• scientific article; zbMATH DE number 4213491
• A bichromatic incidence bound and an application
• Counting facets and incidences
• New lower bounds for Hopcroft's problem
• Incidences

Cites work

• scientific article; zbMATH DE number 3841905 (Why is no real title available?)
• scientific article; zbMATH DE number 863486 (Why is no real title available?)
• A guided tour of Chernoff bounds
• Can visibility graphs be represented compactly?
• Clique partitions, graph compression and speeding-up algorithms
• Combinatorial complexity bounds for arrangements of curves and spheres
• Covering lattice points by subspaces
• Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices
• Cutting hyperplanes for divide-and-conquer
• Efficient algorithms for approximating polygonal chains
• Extremal problems in discrete geometry
• Implicitly representing arrangements of lines or segments
• New lower bounds for Hopcroft's problem
• No-three-in-line for seventeen and nineteen
• Norm-graphs and bipartite Turán numbers
• Norm-graphs: Variations and applications
• On the no-three-in-line problem
• Progress in the no-three-in-line problem. II
• Progress in the no-three-in-line-problem
• Range searching with efficient hierarchical cuttings
• Some advances in the no-three-in-line problem
• Space-Time Tradeoffs for Emptiness Queries
• The No-Three-In-Line Problem
• The exact fitting problem in higher dimensions
• Update on the no-three-in-line problem

Cited in

(22)

• Two theorems on point-flat incidences
• INCIDENCE CONSTRAINTS: A COMBINATORIAL APPROACH
• On a Question of Bourgain about Geometric Incidences
• The polynomial method over varieties
• Minkowski's successive minima in convex and discrete geometry
• No l Grid-Points in Spaces of Small Dimension
• Covering lattice points by subspaces and counting point-hyperplane incidences
• Representation complexities of semialgebraic graphs
• Covering lattice points by subspaces and counting point-hyperplane incidences
• Discrete geometry. Abstracts from the workshop held January 21--26, 2024
• Evasive sets, covering by subspaces, and point-hyperplane incidences
• Incidences
• A semi-algebraic version of Zarankiewicz's problem
• The largest complete bipartite subgraph in point-hyperplane incidence graphs
• Depth in an arrangement of hyperplanes
• On the number of incidences between points and planes in three dimensions
• A bichromatic incidence bound and an application
• The probability that the number of points on a complete intersection is squarefree
• Concentration estimates for algebraic intersections
• How to find groups?
• On the Number of Tetrahedra with Minimum, Unit, and Distinct Volumes in Three-Space
• Counting problems relating to a theorem of Dirichlet

This page was built for publication: On counting point-hyperplane incidences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1873152)