Intersection queries for flat semi-algebraic objects in three dimensions and related problems
From MaRDI portal
Cites work
- A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk
- Algorithms in real algebraic geometry
- Approximate parametrization of plane algebraic curves by linear systems of curves
- Approximating minimum-weight triangulations in three dimensions
- Automatic parameterization of rational curves and surfaces IV: algebraic space curves
- Automatic parameterization of rational curves and surfaces. III: Algebraic plane curves
- Complexity of finding irreducible components of a semialgebraic set
- Computational geometry. Algorithms and applications.
- Constructive polynomial partitioning for algebraic curves in \(\mathbb{R}^3\) with applications
- Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications
- Efficient algorithms for approximating polygonal chains
- Efficient ray shooting and hidden surface removal
- Eliminating depth cycles among triangles in three dimensions
- Fast detection of polyhedral intersection
- scientific article; zbMATH DE number 3169149 (Why is no real title available?)
- scientific article; zbMATH DE number 3978403 (Why is no real title available?)
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- scientific article; zbMATH DE number 3497890 (Why is no real title available?)
- scientific article; zbMATH DE number 1241835 (Why is no real title available?)
- Ideals, Varieties, and Algorithms
- Intersection queries for flat semi-algebraic objects in three dimensions and related problems
- Intersection searching amid tetrahedra in 4-space and efficient continuous collision detection
- Lower bounds for intersection reporting among flat objects
- Morse Theory. (AM-51)
- Multidimensional divide-and-conquer
- Multilevel polynomial partitions and simplified range searching
- On range searching with semialgebraic sets
- On range searching with semialgebraic sets. II.
- On ray shooting for triangles in 3-space and related problems
- On semialgebraic range reporting
- On the Piano Movers problem. II: General techniques for computing topological properties of real algebraic manifolds
- On the Erdős distinct distances problem in the plane
- Parameterization of algebraic space curves. Appendix
- Plane algebraic curves.
- Polynomial partitioning for a set of varieties
- Puiseux expansion for space curves
- Radical parametrizations of algebraic curves by adjoint curves
- Randomized optimal algorithm for slope selection
- Range searching with efficient hierarchical cuttings
- Ray Shooting Amidst Convex Polyhedra and Polyhedral Terrains in Three Dimensions
- Ray Shooting Amidst Spheres in Three Dimensions and Related Problems
- Ray Shooting and Other Applications of Spanning Trees with Low Stabbing Number
- Ray Shooting and Parametric Search
- Ray shooting and stone throwing with near-linear storage
- Ray shooting on triangles in 3-space
- Ruled surface theory and incidence geometry
- Simplex Range Searching and Its Variants: A Review
- Space searching for intersecting objects
- The number of congruent simplices in a point set
Cited in
(3)
This page was built for publication: Intersection queries for flat semi-algebraic objects in three dimensions and related problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6922357)
