On computing the optimal bridge between two convex polygons.
type: Item
instance of: scholarly article
title: On computing the optimal bridge between two convex polygons.
zbMATH Open document ID: 1051.68131
DOI: 10.1016/S0020-0190(00)00228-3
published in: Information Processing Letters
publication date: 2002-07-14T00:00:00Z
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 1767382
zbMATH Keywords: Computational geometry
zbMATH Keywords: Discrete optimization
author: Binay Bhattacharya
author: Robert Benkoczi
MaRDI profile type: Publication
cites work: A linear-time algorithm for computing the Voronoi diagram of a convex polygon
cites work: A linear time algorithm for finding all farthest neighbors in a convex polygon
cites work: Computing the optimal bridge between two convex polygons
cites work: Computational Geometry in C
cites work: Q3992847
cites work: Q3693476
full work available at URL: s0020-0190(00)00228-3
OpenAlex ID: W2021075090
description: scientific article; zbMATH DE number 1767382