An optimal algorithm for constructing an optimal bridge between two simple rectilinear polygons
type: Item
instance of: scholarly article
title: An optimal algorithm for constructing an optimal bridge between two simple rectilinear polygons
zbMATH Open document ID: 1032.68151
DOI: 10.1016/S0020-0190(00)00229-5
author: R. Smith
published in: Information Processing Letters
publication date: 2002-07-14T00:00:00Z
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 1767384
zbMATH Keywords: Computational geometry
zbMATH Keywords: Discrete optimization
zbMATH Keywords: Analysis of algorithms
MaRDI profile type: Publication
cites work: The furthest-site geodesic Voronoi diagram
cites work: On rectilinear link distance
cites work: Finding shortest paths in the presence of orthogonal obstacles using a combined L 1 and link metric
cites work: Triangulating a simple polygon in linear time
cites work: AN OPTIMAL DATA STRUCTURE FOR SHORTEST RECTILINEAR PATH QUERIES IN A SIMPLE RECTILINEAR POLYGON
Wikidata QID: Q126377184
full work available at URL: s0020-0190(00)00229-5
OpenAlex ID: W2033980796
description: scientific article; zbMATH DE number 1767384