Approximating largest convex hulls for imprecise points
type: Item
instance of: scholarly article
title: Approximating largest convex hulls for imprecise points
zbMATH Open document ID: 1154.68544
author: Maarten Löffler
author: Marc Van Kreveld
published in: Journal of Discrete Algorithms
publication date: 2009-02-23T00:00:00Z
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 52B55
zbMATH DE Number: 5509889
zbMATH Keywords: computational geometry
zbMATH Keywords: data imprecision
zbMATH Keywords: convex hull
zbMATH Keywords: core-sets
MaRDI profile type: Publication
full work available at URL: j.jda.2008.04.002
OpenAlex ID: W2026291033
cites work: Structural tolerance and Delaunay triangulation
cites work: Maintaining approximate extent measures of moving points
cites work: Q5290249
cites work: Q5501287
cites work: APPROXIMATING THE DIAMETER, WIDTH, SMALLEST ENCLOSING CYLINDER, AND MINIMUM-WIDTH ANNULUS
cites work: Robustness of numerical methods in geometric computation when problem data is uncertain
cites work: Systems of distant representatives
cites work: Q3601532
cites work: Analysis of incomplete data and an intrinsic-dimension Helly theorem
cites work: Constructing strongly convex approximate hulls with inaccurate primitives
cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
cites work: An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons
cites work: Constructing strongly convex hulls using exact or rounded arithmetic
cites work: Largest and smallest convex hulls for imprecise points
cites work: Q4821338
DOI: 10.1016/J.JDA.2008.04.002
description: scientific article; zbMATH DE number 5509889