An optimal algorithm for constructing an optimal bridge between two simple rectilinear polygons

DOI10.1016/S0020-0190(00)00229-5zbMath1032.68151OpenAlexW2033980796WikidataQ126377184 ScholiaQ126377184MaRDI QIDQ1603488

R. Smith

Publication date: 14 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)00229-5

zbMATH Keywords

Computational geometryAnalysis of algorithmsDiscrete optimization

Mathematics Subject Classification ID

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

Related Items (3)

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

Cites Work

• On rectilinear link distance
• Triangulating a simple polygon in linear time
• The furthest-site geodesic Voronoi diagram
• AN OPTIMAL DATA STRUCTURE FOR SHORTEST RECTILINEAR PATH QUERIES IN A SIMPLE RECTILINEAR POLYGON
• Finding shortest paths in the presence of orthogonal obstacles using a combined L 1 and link metric

This page was built for publication: An optimal algorithm for constructing an optimal bridge between two simple rectilinear polygons