An efficient algorithm for generalized polynomial partitioning and its applications
From MaRDI portal
Recommendations
- Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications
- On range searching with semialgebraic sets. II.
- Multilevel polynomial partitions and simplified range searching
- On range searching with semialgebraic sets
- Constructive polynomial partitioning for algebraic curves in \(\mathbb{R}^3\) with applications
Cites work
- A semi-algebraic version of Zarankiewicz's problem
- A singly exponential stratification scheme for real semi-algebraic varieties and its applications
- Algorithms in real algebraic geometry
- Almost tight upper bounds for vertical decompositions in four dimensions
- Constructive polynomial partitioning for algebraic curves in \(\mathbb{R}^3\) with applications
- Cutting algebraic curves into pseudo-segments and applications
- Geometric approximation algorithms
- scientific article; zbMATH DE number 4029737 (Why is no real title available?)
- Lower Bounds for Approximation by Nonlinear Manifolds
- 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
- Refined bounds on the number of connected components of sign conditions on a variety
- Simplex Range Searching and Its Variants: A Review
Cited in
(12)- Eliminating depth cycles among triangles in three dimensions
- Removing depth-order cycles among triangles: an algorithm generating triangular fragments
- Multilevel polynomial partitions and simplified range searching
- Partitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps
- Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications
- Constructive polynomial partitioning for algebraic curves in \(\mathbb{R}^3\) with applications
- Partitioning procedure for polynomial optimization
- Intersection searching amid tetrahedra in 4-space and efficient continuous collision detection
- Intersection searching amid tetrahedra in four dimensions
- Lower bounds for semialgebraic range searching and stabbing problems
- Lower bounds for semialgebraic range searching and stabbing problems
- On ray shooting for triangles in 3-space and related problems
This page was built for publication: An 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 Q5088930)
