Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications
From MaRDI portal
Recommendations
- An efficient algorithm for generalized polynomial partitioning and its applications
- Constructive polynomial partitioning for algebraic curves in \(\mathbb{R}^3\) with applications
- On range searching with semialgebraic sets. II.
- Multilevel polynomial partitions and simplified range searching
- Constructive polynomial partitioning for algebraic curves in \(\mathbb{R}^3\) with applications
Cites work
- scientific article; zbMATH DE number 6603592 (Why is no real title available?)
- scientific article; zbMATH DE number 4151829 (Why is no real title available?)
- scientific article; zbMATH DE number 4029737 (Why is no real title available?)
- scientific article; zbMATH DE number 7559205 (Why is no real title available?)
- A semi-algebraic version of Zarankiewicz's problem
- Algorithms in real algebraic geometry
- Algorithms in real algebraic geometry: a survey
- Almost tight upper bounds for vertical decompositions in four dimensions
- An incidence theorem in higher dimensions
- Constructive polynomial partitioning for algebraic curves in \(\mathbb{R}^3\) with applications
- Cutting algebraic curves into pseudo-segments and applications
- Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location
- Eliminating depth cycles among triangles in three dimensions
- Geometric approximation algorithms
- Lower Bounds for Approximation by Nonlinear Manifolds
- Multilevel polynomial partitions and simplified range searching
- New bounds on curve tangencies and orthogonalities
- On range searching with semialgebraic sets
- On range searching with semialgebraic sets. II.
- On the Erdős distinct distances problem in the plane
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Polynomial partitioning for a set of varieties
- Pseudo-Line Arrangements: Duality, Algorithms, and Applications
- Refined bounds on the number of connected components of sign conditions on a variety
- Simplex Range Searching and Its Variants: A Review
Cited in
(21)- Multilevel polynomial partitions and simplified range searching
- Testing polynomials for vanishing on Cartesian products of planar point sets: collinearity testing and related problems
- Efficient computation of the overpartition function and applications
- Throwing a sofa through the window
- On semialgebraic range reporting
- Partitioning procedure for polynomial optimization
- On ray shooting for triangles in 3-space and related problems
- Partitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps
- Lower envelopes of surface patches in 3-space
- Partitioning theorems for sets of semi-Pfaffian sets, with applications
- Intersection queries for flat semi-algebraic objects in three dimensions and related problems
- On reverse shortest paths in geometric proximity graphs
- On the stretch factor of polygonal chains
- Semialgebraic range stabbing, ray shooting, and intersection counting in the plane
- Towards space efficient two-point shortest path queries in a polygonal domain
- Semi-algebraic off-line range searching and biclique partitions in the plane
- Computing data distribution from query selectivities
- Improved algebraic degeneracy testing
- Few cuts meet many point sets
- Subquadratic algorithms for some \textsc{3sum}-hard geometric problems in the algebraic decision-tree model
- On 3SUM-hard problems in the decision tree model
This page was built for publication: Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4989918)
