Approximation of planar convex sets from hyperplane probes
type: Item
instance of: scholarly article
title: Approximation of planar convex sets from hyperplane probes
zbMATH Open document ID: 0939.52001
DOI: 10.1007/PL00009313
author: O. Diekmann
published in: Discrete \& Computational Geometry
publication date: 2000-07-12T00:00:00Z
review text: The following geometric probing problem is considered: An unknown planar convex set is probed by an oracle which, when given a unit vector, returns the position of the corresponding supporting hyperplane. The author presents an on-line algorithm which, after \(n\) probes, gives inscribed and circumscribed polygons with a Hausdorff distance of \(O(n^{-2})\). This is optimal and an improvement on an algorithm of \textit{M. Lindenbaum} and \textit{A. Bruckstein} [IEEE Transactions on Pattern Analysis and Machine Intelligence 10, 517-529 (1994)].
Mathematics Subject Classification ID: 52A10
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 52A27
zbMATH DE Number: 1051246
zbMATH Keywords: approximation of planar convex sets
zbMATH Keywords: geometric probing
reviewed by: Monika Ludwig
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 1051246