Finding the convex hull facet by facet
type: Item
instance of: scholarly article
title: Finding the convex hull facet by facet
zbMATH Open document ID: 0563.68041
DOI: 10.1016/0196-6774(85)90017-3
author: Garret Swart
published in: Journal of Algorithms
publication date: 1985-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 52Bxx
zbMATH DE Number: 3898237
zbMATH Keywords: convex hull
zbMATH Keywords: computational geometry
zbMATH Keywords: facet enumeration
zbMATH Keywords: algorithm
zbMATH Keywords: facial lattice of a d-dimensional polytope
zbMATH Keywords: boundary points
zbMATH Keywords: combinatorial equivalence problem
MaRDI profile type: MaRDI publication profile
full work available at URL: 0196-6774(85)90017-3
OpenAlex ID: W2079789648
Recommended article: How good are convex hull algorithms?
Recommended article: Combinatorial face enumeration in convex polytopes
Recommended article: A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
Recommended article: Q4401009
Recommended article: Q4323618
description: scientific article