scientific article; zbMATH DE number 3569833

Cited in

(36)

Some dynamic computational geometry problems
Some problems in computational geometry
L-infinity interdistance selection by parametric search
An algorithm for determining identity of nearest-neighbor and potential function decision rules
A fast parallel algorithm for the closest pair problem
Finding minimal spanning trees in a Euclidean coordinate space
Optimal parallel algorithms for point-set and polygon problems
The \(\gamma\)-neighborhood graph
Optimal time bounds for some proximity problems in the plane
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
Parallel solutions to geometric problems in the scan model of computation
An optimal algorithm for the on-line closest-pair problem
Kinetic \(k\)-semi-Yao graph and its applications
Two-dimensional closest pair problem: a closer look
On closest pair in Euclidean metric: monochromatic is as hard as bichromatic
The searching over separators strategy to solve some NP-hard problems in subexponential time
An optimized divide-and-conquer algorithm for the closest-pair problem in the planar case
Monte-Carlo valuation of American options: facts and new algorithms to improve existing methods
On the complexity of closest pair via polar-pair of point-sets
Verification of Closest Pair of Points Algorithms
On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic
scientific article; zbMATH DE number 7561744 (Why is no real title available?)
On the complexity of closest pair via polar-pair of point-sets
scientific article; zbMATH DE number 7250154 (Why is no real title available?)
Dominance product and high-dimensional closest pair under \(L_\infty\)
Klee's measure problem made oblivious
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
A parallel batch-dynamic data structure for the closest pair problem
Tight bounds on the number of closest pairs in vertical slabs
Approximate k-closest-pairs in large high-dimensional data sets
Space-efficient geometric divide-and-conquer algorithms
Greedy matching on a grid

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4140384)