A note on the all nearest-neighbor problem for convex polygons
type: Item
instance of: scholarly article
title: A note on the all nearest-neighbor problem for convex polygons
zbMATH Open document ID: 0399.68071
DOI: 10.1016/0020-0190(79)90021-8
author: Chungchun Yang
author: Tatsien Li
published in: Information Processing Letters
publication date: 1979-01-01T00:00:00Z
Mathematics Subject Classification ID: 68R99
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 52A10
zbMATH DE Number: 3621143
zbMATH Keywords: Nearest-Neighbor Problem for Convex Polygons
MaRDI profile type: Publication
full work available at URL: 0020-0190(79)90021-8
OpenAlex ID: W1977176150
cites work: A fast convex hull algorithm
cites work: Determining the minimum-area encasing rectangle for an arbitrary closed curve
cites work: The all nearest-neighbor problem for convex polygons
description: scientific article; zbMATH DE number 3621143