An O(n) algorithm to find a near-optimum partition of a convex polygon
type: Item
instance of: scholarly article
title: An O(n) algorithm to find a near-optimum partition of a convex polygon
zbMATH Open document ID: 0459.68036
DOI: 10.1016/0196-6774(81)90014-6
published in: Journal of Algorithms
publication date: 1981-01-01T00:00:00Z
Mathematics Subject Classification ID: 68R99
zbMATH DE Number: 3720374
MaRDI profile type: MaRDI publication profile
full work available at URL: 0196-6774(81)90014-6
OpenAlex ID: W1987507258
description: scientific article