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

DOI10.1142/S0218195905001889zbMath1088.65012OpenAlexW2102302396MaRDI QIDQ3373057

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)

Cites Work

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

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