Packing two disks into a polygonal environment.
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1629820 (Why is no real title available?)
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Farthest neighbors, maximum spanning trees and related problems in higher dimensions
- Finding the medial axis of a simple polygon in linear time
- Improved algorithms for placing undesirable facilities
- Obnoxious facility location: complete service with minimal harm
- Packing two disks in a polygon
- Placing two disks in a convex polygon
Cited in
(9)- Locating two obnoxious facilities using the weighted maximin criterion
- A POLYNOMIAL-TIME APPROXIMATION ALGORITHM FOR A GEOMETRIC DISPERSION PROBLEM
- Packing two disks in a polygon
- A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem
- The forest hiding problem, an illumination problem for maximal disk packings
- Packing disks by flipping and flowing
- Three problems about simple polygons
- An approximation algorithm for locating maximal disks within convex polygons
- scientific article; zbMATH DE number 1796962 (Why is no real title available?)
This page was built for publication: Packing two disks into a polygonal environment.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q878013)