Packing two disks into a polygonal environment

DOI10.1007/3-540-44679-6_16MaRDI QIDQ4551356zbMATH OpenFDO

Authors Prosenjit Bose, Pat Morin, Antoine Vigneron

Publication date 5 September 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2108/21080142

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Randomized algorithms (68W20)

Recommendations

• Packing two disks into a polygonal environment.
• Packing two disks in a polygon
• Algorithms for packing two circles in a convex polygon
• An approximation algorithm for locating maximal disks within convex polygons
• A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem

Cited in

(6)

• Packing two disks in a polygon
• Packing disks by flipping and flowing
• A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem
• An approximation algorithm for locating maximal disks within convex polygons
• A POLYNOMIAL-TIME APPROXIMATION ALGORITHM FOR A GEOMETRIC DISPERSION PROBLEM
• Packing two disks into a polygonal environment.

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 Q4551356)