Minimum width color spanning annulus
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 732977 (Why is no real title available?)
- scientific article; zbMATH DE number 742950 (Why is no real title available?)
- scientific article; zbMATH DE number 1875422 (Why is no real title available?)
- Algorithms for interval structures with applications
- An optimal \(O(n\log n)\) algorithm for finding an enclosing planar rectilinear annulus of minimum width
- Computational geometry. Algorithms and applications.
- Computing a Minimum-Width Square Annulus in Arbitrary Orientation
- Computing the smallest color-spanning axis-parallel square
- Efficient randomized algorithms for some geometric optimization problems
- Establishment of a pair of concentric circles with the minimum radial separation for assessing roundness error
- Minimum Width Rectangular Annulus
- Minimum width color spanning annulus
- On levels in arrangements of lines, segments, planes, and triangles
- SMALLEST COLOR-SPANNING OBJECT REVISITED
- The upper envelope of Voronoi surfaces and its applications
Cited in
(5)
This page was built for publication: Minimum width color spanning annulus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1748988)