scientific article
From MaRDI portal
Publication:2766839
zbMath0988.68637MaRDI QIDQ2766839
Publication date: 1 July 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (14)
The geodesic 2-center problem in a simple polygon ⋮ The Euclidean \(k\)-supplier problem in \(I R^2\) ⋮ Discrete and mixed two-center problems for line segments ⋮ Some variations on constrained minimum enclosing circle problem ⋮ Base station placement on boundary of a convex polygon ⋮ Line-Constrained k-Median, k-Means, and k-Center Problems in the Plane ⋮ Efficient planar two-center algorithms ⋮ Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares ⋮ An approximation algorithm for \(k\)-center problem on a convex polygon ⋮ Covering convex polygons by two congruent disks ⋮ Computing the Line-Constrained k-center in the Plane for Small k ⋮ Constrained k-Center Problem on a Convex Polygon ⋮ Covering convex polygons by two congruent disks ⋮ On the planar two-center problem and circular hulls
This page was built for publication:
