Packing two disks in a polygon
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1629820 (Why is no real title available?)
- scientific article; zbMATH DE number 1796962 (Why is no real title available?)
- A linear-time algorithm for computing the Voronoi diagram of a convex polygon
- An efficient parallel algorithm for the row minima of a totally monotone matrix
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Discrete facility location and routing of obnoxious activities.
- Efficient parallel convex hull algorithms
- Finding the medial axis of a simple polygon in linear time
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- More Efficient Parallel Totally Monotone Matrix Searching
- Obnoxious facility location: complete service with minimal harm
- Placing two disks in a convex polygon
- Solving the Continuous p-Dispersion Problem Using Non-linear Programming
- The multiple server location problem
Cited in
(8)- Locating two obnoxious facilities using the weighted maximin criterion
- scientific article; zbMATH DE number 4060716 (Why is no real title available?)
- Packing disks on a torus
- Packing two disks into a polygonal environment.
- 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 in a polygon
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1614067)
