In between \(k\)-sets, \(j\)-facets, and \(i\)-faces: \((i,j)\)-partitions

DOI10.1007/S00454-002-2778-4zbMath1024.52011DBLPjournals/dcg/AndrzejakW03OpenAlexW2168397817WikidataQ54308860 ScholiaQ54308860MaRDI QIDQ1864131

Artur Andrzejak, Ermo Welzl

Publication date: 17 March 2003

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-002-2778-4

zbMATH Keywords

oriented matroidsupper bound theorempoint sets\(j\)-facets\(k\)-partitions

Mathematics Subject Classification ID

Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35)

Related Items (8)

Divide and Conquer Method for k-Set Polygons ⋮ An effective solution to convex 1-body \(N\)-representability ⋮ On Center Regions and Balls Containing Many Points ⋮ CENTROID TRIANGULATIONS FROM k-SETS ⋮ Separation by convex pseudo-circles ⋮ The convex dimension of hypergraphs and the hypersimplicial Van Kampen-Flores theorem ⋮ Bivariate B-splines from convex configurations ⋮ An Improved Bound for k-Sets in Four Dimensions

This page was built for publication: In between \(k\)-sets, \(j\)-facets, and \(i\)-faces: \((i,j)\)-partitions