EXACT AND APPROXIMATION ALGORITHMS FOR FINDING AN OPTIMAL BRIDGE CONNECTING TWO SIMPLE POLYGONS

DOI10.1142/S0218195905001889MaRDI QIDQ3373057zbMATH OpenOpenAlexFDO

Authors Amit M. Bhosle, Teofilo F. Gonzalez

Publication date 13 March 2006

Published in International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0218195905001889

zbMATH Keywords

exact algorithmpolynomial time approximation schemeoptimal bridge between polygons

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• scientific article; zbMATH DE number 1796964
• FINDING AN OPTIMAL BRIDGE BETWEEN TWO POLYGONS
• On computing the optimal bridge between two convex polygons.
• Computing the optimal bridge between two convex polygons
• On optimal bridges between two convex regions
• Computing the optimal bridge between two polygons
• Efficient algorithms for the minimum diameter bridge problem
• Computing the extreme distances between two convex polygons
• scientific article; zbMATH DE number 1786529
• Finding the minimum vertex distance between two disjoint convex polygons in linear time

Cites work

• An Optimal Algorithm for Euclidean Shortest Paths in the Plane
• An algorithm for shortest-path motion in three dimensions
• An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane
• An optimal algorithm for constructing an optimal bridge between two simple rectilinear polygons
• Approximate Euclidean Shortest Paths in 3-Space
• Building bridges between convex regions
• Computing geodesic furthest neighbors in simple polygons
• Computing the optimal bridge between two polygons
• DETERMINING THE SEPARATION OF SIMPLE POLYGONS
• FINDING AN OPTIMAL BRIDGE BETWEEN TWO POLYGONS
• On computing the optimal bridge between two convex polygons.
• On optimal bridges between two convex regions
• The furthest-site geodesic Voronoi diagram
• Visibility and intersection problems in plane geometry

Cited in

(7)

• An optimal algorithm for constructing an optimal bridge between two simple rectilinear polygons
• On computing the optimal bridge between two convex polygons.
• On optimal bridges between two convex regions
• Computing the optimal bridge between two convex polygons
• FINDING AN OPTIMAL BRIDGE BETWEEN TWO POLYGONS
• Computing the optimal bridge between two polygons
• scientific article; zbMATH DE number 1796964 (Why is no real title available?)

This page was built for publication: EXACT AND APPROXIMATION ALGORITHMS FOR FINDING AN OPTIMAL BRIDGE CONNECTING TWO SIMPLE POLYGONS

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