On optimal bridges between two convex regions

DOI10.1016/S0020-0190(00)00143-5zbMath1003.68173OpenAlexW1986312034WikidataQ127323762 ScholiaQ127323762MaRDI QIDQ1607067

Xue-Hou Tan

Publication date: 25 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)00143-5

zbMATH Keywords

Voronoi diagram

Mathematics Subject Classification ID

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

Related Items (4)

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

Uses Software

• Voronoi

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
• Geometric applications of a matrix-searching algorithm
• Power Diagrams: Properties, Algorithms and Applications

This page was built for publication: On optimal bridges between two convex regions