Computing the optimal bridge between two convex polygons
From MaRDI portal
Publication:294636
DOI10.1016/S0020-0190(99)00003-4zbMATH Open1338.68258OpenAlexW2036367883MaRDI QIDQ294636FDOQ294636
Authors: Leizhen Cai, Binhai Zhu, Yinfeng Xu
Publication date: 16 June 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019099000034?np=y
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
Cited In (13)
- 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
- Building bridges between convex regions
- Efficient algorithms for the minimum diameter bridge problem
- Optimal location of the terminal station of rapid transit system in a circular city with radial-circular network
- Mechanism design for building optimal bridges between regions
- EXACT AND APPROXIMATION ALGORITHMS FOR FINDING AN OPTIMAL BRIDGE CONNECTING TWO SIMPLE POLYGONS
- FINDING AN OPTIMAL BRIDGE BETWEEN TWO POLYGONS
- COMPUTING CONSTRAINED SHORTEST SEGMENTS: BUTTERFLY WINGSPANS IN LOGARITHMIC TIME
- Title not available (Why is that?)
- Computing the optimal bridge between two polygons
- Title not available (Why is that?)
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)