Computing the optimal bridge between two polygons

DOI10.1007/S00224-001-1018-2MaRDI QIDQ5949572zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Computing the optimal bridge between two convex polygons
• EXACT AND APPROXIMATION ALGORITHMS FOR FINDING AN OPTIMAL BRIDGE CONNECTING TWO SIMPLE POLYGONS
• Efficient algorithms for the minimum diameter bridge problem
• On computing the optimal bridge between two convex polygons.
• scientific article; zbMATH DE number 1796964

Cited in

(13)

• On computing the optimal bridge between two convex polygons.
• An optimal algorithm for constructing an optimal bridge between two simple rectilinear polygons
• On optimal bridges between two convex regions
• Efficient algorithms for the minimum diameter bridge problem
• Building bridges between convex regions
• Computing the optimal bridge between two convex polygons
• EXACT AND APPROXIMATION ALGORITHMS FOR FINDING AN OPTIMAL BRIDGE CONNECTING TWO SIMPLE POLYGONS
• MINIMUM SEPARATION IN WEIGHTED SUBDIVISIONS
• Optimizing a Strip Separating Two Polygons
• scientific article; zbMATH DE number 1786529 (Why is no real title available?)
• scientific article; zbMATH DE number 1796964 (Why is no real title available?)
• FINDING AN OPTIMAL BRIDGE BETWEEN TWO POLYGONS
• Mechanism design for building optimal bridges between regions

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5949572)