scientific article; zbMATH DE number 742976

zbMath0829.68122MaRDI QIDQ4763415

Joseph S. B. Mitchell, Subhash Suri

Publication date: 11 April 1995

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

separating familiesfacet-complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (7)

On the complexity of approximating and illuminating three-dimensional convex polyhedra ⋮ Algorithms for polytope covering and approximation ⋮ Efficient piecewise-linear function approximation using the uniform metric ⋮ Almost optimal set covers in finite VC-dimension ⋮ On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees ⋮ Convex piecewise-linear fitting ⋮ Encoding shortest paths in spatial networks

This page was built for publication: