scientific article; zbMATH DE number 742951
From MaRDI portal
Publication:4763392
zbMath0829.68117MaRDI QIDQ4763392
Publication date: 11 April 1995
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 (16)
Iterated nearest neighbors and finding minimal polytopes ⋮ Computing the smallest \(k\)-enclosing circle and related problems ⋮ Counting convex polygons in planar point sets ⋮ Computing the smallest k-enclosing circle and related problems ⋮ On rainbow quadrilaterals in colored point sets ⋮ Covering points with convex sets of minimum size ⋮ Empty squares in arbitrary orientation among points ⋮ Finding minimum area \(k\)-gons ⋮ Largest and smallest area triangles on imprecise points ⋮ Minimum area polygons with two reflex angles enclosingkPoints ⋮ Stacks, queues, and deques with order-statistic operations ⋮ An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints ⋮ Covering Points with Convex Sets of Minimum Size ⋮ Finding minimum area simple pentagons ⋮ Algorithms for optimal outlier removal ⋮ Smallest nonparametric tolerance regions.
This page was built for publication:
