Semi-algebraic off-line range searching and biclique partitions in the plane
From MaRDI portal
Cites work
- A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
- A Fast Adaptive Multipole Algorithm for Particle Simulations
- A polynomial regularity lemma for semialgebraic hypergraphs and its applications in geometry and property testing
- A semi-algebraic version of Zarankiewicz's problem
- Algorithms for bichromatic line-segment problems and polyhedral terrains
- Algorithms in real algebraic geometry
- Almost optimal set covers in finite VC-dimension
- Almost tight bounds for eliminating depth cycles in three dimensions
- An Expander-Based Approach to Geometric Optimization
- Applications of random sampling in computational geometry. II
- Can visibility graphs be represented compactly?
- Clique partitions, graph compression and speeding-up algorithms
- Combinatorial complexity bounds for arrangements of curves and spheres
- Computational geometry. Algorithms and applications.
- Computing Envelopes in Four Dimensions with Applications
- Constructive polynomial partitioning for algebraic curves in \(\mathbb{R}^3\) with applications
- Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices
- Crossing Numbers and Hard Erdős Problems in Discrete Geometry
- Cutting algebraic curves into pseudo-segments and applications
- Cutting circles into pseudo-segments and improved bounds for incidences
- Cutting hyperplanes for divide-and-conquer
- CUTTINGS AND APPLICATIONS
- Density and regularity theorems for semi-algebraic hypergraphs
- Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications
- Efficient algorithms for approximating polygonal chains
- Efficient randomized algorithms for some geometric optimization problems
- Extremal problems in discrete geometry
- Geometric matching and bottleneck problems
- scientific article; zbMATH DE number 437554 (Why is no real title available?)
- scientific article; zbMATH DE number 3841905 (Why is no real title available?)
- scientific article; zbMATH DE number 1241835 (Why is no real title available?)
- scientific article; zbMATH DE number 732977 (Why is no real title available?)
- scientific article; zbMATH DE number 2145241 (Why is no real title available?)
- scientific article; zbMATH DE number 2209708 (Why is no real title available?)
- Intersection queries for flat semi-algebraic objects in three dimensions and related problems
- Large Complete Bipartite Subgraphs In Incidence Graphs Of Points And Hyperplanes
- Lenses in arrangements of pseudo-circles and their applications
- Multilevel polynomial partitions and simplified range searching
- On counting point-hyperplane incidences
- On lazy randomized incremental construction
- On range searching with semialgebraic sets. II.
- On reverse shortest paths in geometric proximity graphs
- On semialgebraic range reporting
- On the Erdős distinct distances problem in the plane
- On the Number of Incidences Between Points and Curves
- Polynomial methods and incidence theory
- Proof of a conjecture of Burr, Grünbaum, and Sloane
- Pseudo-Line Arrangements: Duality, Algorithms, and Applications
- Randomized optimal algorithm for slope selection
- Refined bounds on the number of connected components of sign conditions on a variety
- Representation complexities of semialgebraic graphs
- Semi-algebraic off-line range searching and biclique partitions in the plane
- Semialgebraic range stabbing, ray shooting, and intersection counting in the plane
- Simplex Range Searching and Its Variants: A Review
- Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications
Cited in
(5)- Semialgebraic range stabbing, ray shooting, and intersection counting in the plane
- Semi-algebraic off-line range searching and biclique partitions in the plane
- Dominating set, independent set, discrete k-center, dispersion, and related problems for planar points in convex position
- A subquadratic algorithm for computing the L₁-distance between two terrains
- Compact representation of semilinear and terrain-like graphs
This page was built for publication: Semi-algebraic off-line range searching and biclique partitions in the plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6895905)
