On computing the optimal bridge between two convex polygons.

DOI10.1016/S0020-0190(00)00228-3zbMath1051.68131OpenAlexW2021075090MaRDI QIDQ1603485

Robert Benkoczi, Binay K. Bhattacharya

Publication date: 14 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(00)00228-3

zbMATH Keywords

Computational geometryDiscrete optimization

Mathematics Subject Classification ID

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

Related Items

Building bridges between convex regions ⋮ EXACT AND APPROXIMATION ALGORITHMS FOR FINDING AN OPTIMAL BRIDGE CONNECTING TWO SIMPLE POLYGONS

Cites Work

• Unnamed Item
• Unnamed Item
• Computing the optimal bridge between two convex polygons
• A linear-time algorithm for computing the Voronoi diagram of a convex polygon
• A linear time algorithm for finding all farthest neighbors in a convex polygon
• Computational Geometry in C

This page was built for publication: On computing the optimal bridge between two convex polygons.