An algorithm for constructing the convex hull of a set of spheres in dimension \(d\)
type: Item
instance of: scholarly article
title: An algorithm for constructing the convex hull of a set of spheres in dimension \(d\)
zbMATH Open document ID: 0849.68125
DOI: 10.1016/0925-7721(95)00024-0
author: Jean-Daniel Boissonnat
author: Olivier Devillers
author: Jacqueline Duquesne
author: Mariette Yvinec
author: André Cerezo
published in: Computational Geometry
publication date: 1996-11-04T00:00:00Z
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 902880
zbMATH Keywords: convex hull
zbMATH Keywords: spheres
MaRDI profile type: Publication
full work available at URL: 0925-7721(95)00024-0
OpenAlex ID: W1967531239
cites work: Applications of random sampling to on-line algorithms in computational geometry
cites work: An optimal convex hull algorithm in any fixed dimension
cites work: Applications of random sampling in computational geometry. II
cites work: The maximum numbers of faces of a convex polytope
cites work: A convex hull algorithm for discs, and applications
cites work: On the two-dimensional Davenport-Schinzel problem
cites work: Small-dimensional linear programming and convex hulls made easy
description: scientific article; zbMATH DE number 902880