Packing two disks into a polygonal environment.
From MaRDI portal
Publication:878013
DOI10.1016/J.JDA.2003.12.003zbMATH Open1108.68125OpenAlexW1989681946MaRDI QIDQ878013FDOQ878013
Authors: 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
Recommendations
Randomized algorithms (68W20) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55)
Cites Work
- Title not available (Why is that?)
- Finding the medial axis of a simple polygon in linear time
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Farthest neighbors, maximum spanning trees and related problems in higher dimensions
- 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
- Title not available (Why is that?)
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
- Title not available (Why is that?)
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)
