On optimal bridges between two convex regions

DOI10.1016/S0020-0190(00)00143-5MaRDI QIDQ1607067zbMATH OpenOpenAlexWikidataFDO

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

Recommendations

• Computing the optimal bridge between two convex polygons
• Computing the optimal bridge between two polygons
• On computing the optimal bridge between two convex polygons.
• EXACT AND APPROXIMATION ALGORITHMS FOR FINDING AN OPTIMAL BRIDGE CONNECTING TWO SIMPLE POLYGONS
• An optimal algorithm for constructing an optimal bridge between two simple rectilinear polygons

Cites work

• A linear-time algorithm for computing the Voronoi diagram of a convex polygon
• Computing the optimal bridge between two convex polygons
• Geometric applications of a matrix-searching algorithm
• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• scientific article; zbMATH DE number 1182913 (Why is no real title available?)
• Power Diagrams: Properties, Algorithms and Applications

Cited in

(7)

• 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
• scientific article; zbMATH DE number 1786529 (Why is no real title available?)
• FINDING AN OPTIMAL BRIDGE BETWEEN TWO POLYGONS
• Mechanism design for building optimal bridges between regions

Describes a project that uses

Uses Software

• Voronoi

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

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