FINDING AN OPTIMAL BRIDGE BETWEEN TWO POLYGONS

DOI10.1142/S0218195902000852MaRDI QIDQ4818559zbMATH OpenOpenAlexFDO

Authors Xuehou Tan

Publication date 29 September 2004

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

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

zbMATH Keywords

computational geometrydata structurediscrete optimizationgeodesic metricVoronoi diagrams

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• scientific article; zbMATH DE number 1796964
• Computing the optimal bridge between two polygons
• On computing the optimal bridge between two convex polygons.
• Computing the optimal bridge between two convex polygons
• An optimal algorithm for constructing an optimal bridge between two simple rectilinear polygons
• EXACT AND APPROXIMATION ALGORITHMS FOR FINDING AN OPTIMAL BRIDGE CONNECTING TWO SIMPLE POLYGONS
• On optimal bridges between two convex regions
• AN OPTIMAL MORPHING BETWEEN POLYLINES
• Building bridges between convex regions

Cites work

• A classification of the probabilistic polynomial time hierarchy under fault tolerant access to oracle classes
• An optimal algorithm for constructing an optimal bridge between two simple rectilinear polygons
• Dynamic Ray Shooting and Shortest Paths in Planar Subdivisions via Balanced Geodesic Triangulations
• On optimal bridges between two convex regions
• Optimal shortest path queries in a simple polygon
• The furthest-site geodesic Voronoi diagram

Cited in

(4)

• On 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 1796964 (Why is no real title available?)
• Mechanism design for building optimal bridges between regions

This page was built for publication: FINDING AN OPTIMAL BRIDGE BETWEEN TWO POLYGONS

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