Computing the optimal bridge between two polygons

DOI10.1007/s00224-001-1018-2zbMath0984.68177OpenAlexW2143749120MaRDI QIDQ5949572

Sung Kwon Kim, Chan-Su Shin

Publication date: 14 May 2002

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-001-1018-2

zbMATH Keywords

geodesic shortest path

Mathematics Subject Classification ID

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

Related Items (4)

Building bridges between convex regions ⋮ EXACT AND APPROXIMATION ALGORITHMS FOR FINDING AN OPTIMAL BRIDGE CONNECTING TWO SIMPLE POLYGONS ⋮ MINIMUM SEPARATION IN WEIGHTED SUBDIVISIONS ⋮ Efficient algorithms for the minimum diameter bridge problem

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