SMALLEST COLOR-SPANNING OBJECT REVISITED
From MaRDI portal
Recommendations
Cites work
- Constructing Belts in Two-Dimensional Arrangements with Applications
- Dynamically maintaining the widest k-dense corridor
- Finding the upper envelope of n line segments in O(n log n) time
- scientific article; zbMATH DE number 732977 (Why is no real title available?)
- On \(k\)-sets in arrangements of curves and surfaces
- Smallest \(k\)-point enclosing rectangle and square of arbitrary orientation
- The K-dense corridor problems
- The upper envelope of Voronoi surfaces and its applications
Cited in
(23)- Minimum width color spanning annulus
- Color-spanning localized query
- Minimum color spanning circle of imprecise points
- Color spanning objects: algorithms and hardness results
- Expected computations on color spanning sets
- On some geometric problems of color-spanning sets
- Minimum color spanning circle in imprecise setup
- Color spanning objects: algorithms and hardness results
- Minimum width color spanning annulus
- Computing the smallest color-spanning axis-parallel square
- On some geometric problems of color-spanning sets
- Algorithms for interval structures with applications
- Algorithms for interval structures with applications
- scientific article; zbMATH DE number 1875422 (Why is no real title available?)
- Network optimization on partitioned pairs of points
- Fréchet Distance for Uncertain Curves
- Online \(k\)-color spanning disk problems
- Arbitrary-oriented color spanning region for line segments
- Computing largest minimum color-spanning intervals of imprecise points
- Maximum-width rainbow-bisecting empty annulus
- The 2-mixed-center color spanning problem
- Fréchet distance for uncertain curves
- Shortest color-spanning intervals
This page was built for publication: SMALLEST COLOR-SPANNING OBJECT REVISITED
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3647618)
