scientific article
From MaRDI portal
Publication:3805895
zbMath0657.68038MaRDI QIDQ3805895
Klaus Hinrichs, Jurg Nievergelt, Peter Schorn
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
complexitycomputational geometryplane-sweep algorithmproximity problemsall-nearest- neighbors problem
Analysis of algorithms and problem complexity (68Q25) Other problems of combinatorial convexity (52A37)
Related Items (2)
On the Complexity of Closest Pair via Polar-Pair of Point-Sets ⋮ Computing a sweeping-plane in regular (``general) position: A numerical and a symbolic solution
This page was built for publication: