Pages that link to "Item:Q4099207"
From MaRDI portal
The following pages link to Multidimensional Searching Problems (Q4099207):
Displayed 34 items.
- Optimal randomized incremental construction for guaranteed logarithmic planar point location (Q340542) (← links)
- Tighter lower bounds for nearest neighbor search and related problems in the cell probe model (Q696979) (← links)
- Locating a robot with angle measurements (Q751327) (← links)
- On constructing the relative neighborhood graphs in Euclidean k- dimensional spaces (Q757098) (← links)
- A dual approach to detect polyhedral intersections in arbitrary dimensions (Q758179) (← links)
- Stability versus speed in a computable algebraic model (Q817853) (← links)
- A strong lower bound for approximate nearest neighbor searching (Q834886) (← links)
- Dynamic planar point location with optimal query time (Q914389) (← links)
- Algorithms for high dimensional stabbing problems (Q916570) (← links)
- Optimal in-place and cache-oblivious algorithms for 3-D convex hulls and 2-D segment intersection (Q991174) (← links)
- Local optimization on graphs (Q1122503) (← links)
- A space-optimal solution of general region location (Q1156491) (← links)
- Polygonal intersection searching (Q1165007) (← links)
- Computing the relative neighborhood graph in the \(L_ 1\) and L//infinity metrics (Q1165014) (← links)
- Optimal randomized parallel algorithms for computational geometry (Q1187202) (← links)
- Approximate closest-point queries in high dimensions (Q1209329) (← links)
- A note on a multidimensional searching problem (Q1241284) (← links)
- A note on the graph isomorphism counting problem (Q1253098) (← links)
- A note on Euclidean near neighbor searching in the plane (Q1253102) (← links)
- Lower bounds for parallel algebraic decision trees, parallel complexity of convex hulls and related problems (Q1389649) (← links)
- New applications of random sampling in computational geometry (Q1820582) (← links)
- Complexity of projected images of convex subdivisions (Q1841991) (← links)
- A fast algorithm for point-location in a finite element mesh (Q1919124) (← links)
- Decision trees based on 1-consequences (Q2043377) (← links)
- Fast spectral analysis for approximate nearest neighbor search (Q2163259) (← links)
- Rough analysis of computation trees (Q2172394) (← links)
- An algorithm for generalized point location and its applications (Q2639635) (← links)
- Time and space complexity of deterministic and nondeterministic decision trees (Q2679423) (← links)
- Dynamic planar point location with optimal query time (Q5096145) (← links)
- Learning the tangent space of dynamical instabilities from data (Q5205672) (← links)
- Rooted Uniform Monotone Minimum Spanning Trees (Q5283385) (← links)
- The complexity of linear programming (Q5904560) (← links)
- Moving regular k-gons in contact (Q6118594) (← links)
- Space-efficient functional offline-partially-persistent trees with applications to planar point location (Q6139049) (← links)