Packing two disks in a polygon

DOI10.1016/S0925-7721(01)00044-XzbMath1001.68173MaRDI QIDQ1614067

Sergei Bespamyatnikh

Publication date: 3 September 2002

Published in: Computational Geometry (Search for Journal in Brave)

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Packing two disks into a polygonal environment. ⋮ Three problems about simple polygons ⋮ Locating two obnoxious facilities using the weighted maximin criterion

Cites Work

• Unnamed Item
• Unnamed Item
• A linear-time algorithm for computing the Voronoi diagram of a convex polygon
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• Finding the medial axis of a simple polygon in linear time
• Discrete facility location and routing of obnoxious activities.
• Placing two disks in a convex polygon
• OBNOXIOUS FACILITY LOCATION: COMPLETE SERVICE WITH MINIMAL HARM
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• Efficient parallel convex hull algorithms
• An efficient parallel algorithm for the row minima of a totally monotone matrix
• More Efficient Parallel Totally Monotone Matrix Searching
• Solving the Continuous p-Dispersion Problem Using Non-linear Programming
• The multiple server location problem

This page was built for publication: Packing two disks in a polygon