The following pages link to (Q4140384):
Displaying 33 items.
- Proximity problems for points on a rectilinear plane with rectangular obstacles (Q675298) (← links)
- Approximating the minimum closest pair distance and nearest neighbor distances of linearly moving points (Q680145) (← links)
- Approximate \(k\)-closest-pairs in large high-dimensional data sets (Q814957) (← links)
- Space-efficient geometric divide-and-conquer algorithms (Q883238) (← links)
- Greedy matching on a grid (Q921922) (← links)
- Some dynamic computational geometry problems (Q1071526) (← links)
- Some problems in computational geometry (Q1101225) (← links)
- L-infinity interdistance selection by parametric search (Q1115620) (← links)
- An algorithm for determining identity of nearest-neighbor and potential function decision rules (Q1143189) (← links)
- A fast parallel algorithm for the closest pair problem (Q1145510) (← links)
- Finding minimal spanning trees in a Euclidean coordinate space (Q1154282) (← links)
- Optimal parallel algorithms for point-set and polygon problems (Q1187196) (← links)
- The \(\gamma\)-neighborhood graph (Q1194312) (← links)
- Optimal time bounds for some proximity problems in the plane (Q1198024) (← links)
- A probabilistic minimum spanning tree algorithm (Q1241278) (← links)
- The complexity of finding fixed-radius near neighbors (Q1244819) (← links)
- The all nearest-neighbor problem for convex polygons (Q1250433) (← links)
- A note on Rabin's nearest-neighbor algorithm (Q1257342) (← links)
- Parallel solutions to geometric problems in the scan model of computation (Q1318471) (← links)
- An optimal algorithm for the on-line closest-pair problem (Q1330783) (← links)
- Kinetic \(k\)-semi-Yao graph and its applications (Q1622343) (← links)
- Two-dimensional closest pair problem: a closer look (Q2004080) (← links)
- On closest pair in Euclidean metric: monochromatic is as hard as bichromatic (Q2221003) (← links)
- The searching over separators strategy to solve some NP-hard problems in subexponential time (Q2366228) (← links)
- An optimized divide-and-conquer algorithm for the closest-pair problem in the planar case (Q2637298) (← links)
- Monte-Carlo Valuation of American Options: Facts and New Algorithms to Improve Existing Methods (Q2917432) (← links)
- On the Complexity of Closest Pair via Polar-Pair of Point-Sets (Q3122310) (← links)
- Verification of Closest Pair of Points Algorithms (Q5049012) (← links)
- On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic (Q5090390) (← links)
- (Q5092465) (← links)
- On the Complexity of Closest Pair via Polar-Pair of Point-Sets (Q5115796) (← links)
- (Q5121902) (← links)
- Dominance Product and High-Dimensional Closest Pair under L_infty (Q5136258) (← links)
