Computing the optimal bridge between two convex polygons
From MaRDI portal
Recommendations
- On computing the optimal bridge between two convex polygons.
- Computing the optimal bridge between two polygons
- On optimal bridges between two convex regions
- EXACT AND APPROXIMATION ALGORITHMS FOR FINDING AN OPTIMAL BRIDGE CONNECTING TWO SIMPLE POLYGONS
- Efficient algorithms for the minimum diameter bridge problem
Cites work
- scientific article; zbMATH DE number 3918300 (Why is no real title available?)
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- Geometric relations among Voronoi diagrams
- On the Problem of Steiner
- Optimal Point Location in a Monotone Subdivision
- Power Diagrams: Properties, Algorithms and Applications
Cited in
(13)- Computing the optimal bridge between two polygons
- Building bridges between convex regions
- FINDING AN OPTIMAL BRIDGE BETWEEN TWO POLYGONS
- COMPUTING CONSTRAINED SHORTEST SEGMENTS: BUTTERFLY WINGSPANS IN LOGARITHMIC TIME
- scientific article; zbMATH DE number 1786529 (Why is no real title available?)
- scientific article; zbMATH DE number 1796964 (Why is no real title available?)
- Efficient algorithms for the minimum diameter bridge problem
- Mechanism design for building optimal bridges between regions
- An optimal algorithm for constructing an optimal bridge between two simple rectilinear polygons
- On computing the optimal bridge between two convex polygons.
- On optimal bridges between two convex regions
- EXACT AND APPROXIMATION ALGORITHMS FOR FINDING AN OPTIMAL BRIDGE CONNECTING TWO SIMPLE POLYGONS
- Optimal location of the terminal station of rapid transit system in a circular city with radial-circular network
This page was built for publication: Computing the optimal bridge between two convex polygons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q294636)
