Packing two disks into a polygonal environment.
From MaRDI portal
Publication:878013
DOI10.1016/j.jda.2003.12.003zbMath1108.68125OpenAlexW1989681946MaRDI QIDQ878013
Prosenjit Bose, Pat Morin, Antoine Vigneron
Publication date: 25 April 2007
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2003.12.003
Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Randomized algorithms (68W20)
Related Items
Three problems about simple polygons ⋮ Locating two obnoxious facilities using the weighted maximin criterion
Cites Work
- Unnamed Item
- Unnamed Item
- Farthest neighbors, maximum spanning trees and related problems in higher dimensions
- Finding the medial axis of a simple polygon in linear time
- Placing two disks in a convex polygon
- Packing two disks in a polygon
- Improved algorithms for placing undesirable facilities
- OBNOXIOUS FACILITY LOCATION: COMPLETE SERVICE WITH MINIMAL HARM
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
This page was built for publication: Packing two disks into a polygonal environment.