Computing the optimal bridge between two convex polygons

DOI10.1016/S0020-0190(99)00003-4zbMath1338.68258OpenAlexW2036367883MaRDI QIDQ294636

Binhai Zhu, Leizhen Cai, Yin-Feng 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

zbMATH Keywords

approximationdiscrete optimizationcomputational geometry

Mathematics Subject Classification ID

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

Related Items (4)

Building bridges between convex regions ⋮ Unnamed Item ⋮ On computing the optimal bridge between two convex polygons. ⋮ On optimal bridges between two convex regions

Cites Work

• Unnamed Item
• Unnamed Item
• Geometric relations among Voronoi diagrams
• On the Problem of Steiner
• Optimal Point Location in a Monotone Subdivision
• Power Diagrams: Properties, Algorithms and Applications

This page was built for publication: Computing the optimal bridge between two convex polygons