scientific article; zbMATH DE number 1256675
From MaRDI portal
Publication:4230362
zbMath0977.68568MaRDI QIDQ4230362
Hans-Peter Lenhof, Michiel H. M. Smid
Publication date: 20 January 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (8)
Iterated nearest neighbors and finding minimal polytopes ⋮ Computing the smallest \(k\)-enclosing circle and related problems ⋮ Efficient construction of a bounded-degree spanner with low weight ⋮ Static and dynamic algorithms for k-point clustering problems ⋮ Computing the smallest k-enclosing circle and related problems ⋮ Algorithms for proximity problems in higher dimensions ⋮ Fast greedy triangulation algorithms. ⋮ Approximate \(k\)-closest-pairs in large high-dimensional data sets
This page was built for publication:
