scientific article; zbMATH DE number 3569833
From MaRDI portal
zbMath0365.68050MaRDI QIDQ4140384
Michael Ian Shamos, Jon Louis Bentley
Publication date: 1976
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
An optimal algorithm for the on-line closest-pair problem, Kinetic \(k\)-semi-Yao graph and its applications, The searching over separators strategy to solve some NP-hard problems in subexponential time, Verification of Closest Pair of Points Algorithms, On the Complexity of Closest Pair via Polar-Pair of Point-Sets, An optimized divide-and-conquer algorithm for the closest-pair problem in the planar case, Some problems in computational geometry, Monte-Carlo Valuation of American Options: Facts and New Algorithms to Improve Existing Methods, L-infinity interdistance selection by parametric search, Space-efficient geometric divide-and-conquer algorithms, An algorithm for determining identity of nearest-neighbor and potential function decision rules, Klee's measure problem made oblivious, A fast parallel algorithm for the closest pair problem, Finding minimal spanning trees in a Euclidean coordinate space, Greedy matching on a grid, On closest pair in Euclidean metric: monochromatic is as hard as bichromatic, Optimal parallel algorithms for point-set and polygon problems, Proximity problems for points on a rectilinear plane with rectangular obstacles, Approximating the minimum closest pair distance and nearest neighbor distances of linearly moving points, The \(\gamma\)-neighborhood graph, Optimal time bounds for some proximity problems in the plane, Two-dimensional closest pair problem: a closer look, Unnamed Item, A probabilistic minimum spanning tree algorithm, The complexity of finding fixed-radius near neighbors, The all nearest-neighbor problem for convex polygons, A note on Rabin's nearest-neighbor algorithm, Unnamed Item, On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic, On the Complexity of Closest Pair via Polar-Pair of Point-Sets, Dominance Product and High-Dimensional Closest Pair under L_infty, Parallel solutions to geometric problems in the scan model of computation, Some dynamic computational geometry problems, Approximate \(k\)-closest-pairs in large high-dimensional data sets