Minimum convex partitions of multidimensional polyhedrons
type: Item
instance of: scholarly article
title: Minimum convex partitions of multidimensional polyhedrons
zbMATH Open document ID: 1188.68324
author: Ion Băţ
published in: Computer Science Journal of Moldova
publication date: 2010-01-13T00:00:00Z
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 52B11
Mathematics Subject Classification ID: 52B55
zbMATH DE Number: 5657359
zbMATH Keywords: \(d\)-convexity
zbMATH Keywords: oriented polytope
MaRDI profile type: Publication
Recommended article: Minimum Convex Partitions and Maximum Empty Polytopes
Recommended article: Minimum convex partitions and maximum empty polytopes
Recommended article: Minimum \(d\)-convex partition of a multidimensional polyhedron with holes
Recommended article: A Convex Approach to Minimal Partitions
Recommended article: Q4949279
Recommended article: Minimum convex partition of point sets
Recommended article: Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm
Recommended article: Minimum convex partition of a constrained point set
Recommended article: Minimum convex partition of polygonal domains by guillotine cuts
Recommended article: On the honeycomb conjecture for a class of minimal convex partitions
description: scientific article; zbMATH DE number 5657359