An improved bound for \(k\)-sets in three dimensions

DOI10.1007/s00454-001-0005-3zbMath0988.52034OpenAlexW2094683955MaRDI QIDQ5946378

Shakhar Smorodinsky, Gábor Tardos, Micha Sharir

Publication date: 10 July 2002

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

Full work available at URL: https://doi.org/10.1007/s00454-001-0005-3

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial complexity of geometric structures (52C45)

Related Items (17)

Some combinatorial and algorithmic applications of the Borsuk-Ulam theorem ⋮ Generalized ham-sandwich cuts ⋮ Minimizing the error of linear separators on linearly inseparable data ⋮ Dense point sets with many halving lines ⋮ On levels in arrangements of surfaces in three dimensions ⋮ The \(k\)-centrum straight-line location problem ⋮ The projection median of a set of points in \({\mathbb{R}}^{d}\) ⋮ Outlier respecting points approximation ⋮ On approximate range counting and depth ⋮ On the complexity of the \(k\)-level in arrangements of pseudoplanes ⋮ Unnamed Item ⋮ The convex dimension of hypergraphs and the hypersimplicial Van Kampen-Flores theorem ⋮ An Improved Bound for k-Sets in Four Dimensions ⋮ Points surrounding the origin ⋮ Nearly Optimal Planar $k$ Nearest Neighbors Queries under General Distance Functions ⋮ On the number of corner cuts ⋮ Algebraic \(k\)-sets and generally neighborly embeddings

This page was built for publication: An improved bound for \(k\)-sets in three dimensions