scientific article
From MaRDI portal
Publication:3140402
zbMath0801.68162MaRDI QIDQ3140402
Publication date: 29 November 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Other problems of combinatorial convexity (52A37) Data structures (68P05)
Related Items
Iterated nearest neighbors and finding minimal polytopes, Static and dynamic algorithms for k-point clustering problems, On geometric optimization with few violated constraints, A branch-and-bound method for the minimum \(k\)-enclosing ball problem, On enclosing k points by a circle, Minimum area polygons with two reflex angles enclosingkPoints, Finding axis-parallel rectangles of fixed perimeter or area containing the largest number of points