On the polyhedral complexity of the integer points in a hyperball

DOI10.1016/J.TCS.2008.07.014zbMATH Open1151.52010OpenAlexW1991389996MaRDI QIDQ952452FDOQ952452

Reneta P. Barneva, Valentin E. Brimkov

Publication date: 12 November 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.07.014

zbMATH Keywords

lower boundconvex polytopehyperballpolyhedral facet complexitypolyhedral vertex complexity

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) (n)-dimensional polytopes (52B11)

Cites Work

• Title not available (Why is that?)
• Decomposition of a three-dimensional discrete object surface into discrete plane pieces
• Title not available (Why is that?)
• The maximum numbers of faces of a convex polytope
• The vertices of the knapsack polytope
• On integer points in polyhedra: A lower bound
• Title not available (Why is that?)
• Integer points on curves and surfaces
• The convex hull of the integer points in a large ball
• On the maximal number of edges of convex digital polygons included into an \(m \times m\)-grid
• Title not available (Why is that?)
• Real data-integer solution problems within the Blum-Shub-Smale computational model
• Optimization Schemes for the Reversible Discrete Volume Polyhedrization Using Marching Cubes Simplification
• On the Unlimited Number of Faces in Integer Hulls of Linear Programs with a Single Constraint

Cited In (10)

• From prima quadraginta octant to lattice sphere through primitive integer operations
• Some theoretical challenges in digital geometry: a perspective
• On Some Local Topological Properties of Naive Discrete Sphere
• On the intrinsic complexity of point finding in real singular hypersurfaces
• Determining digital circularity using integer intervals
• On the characterization of absentee-voxels in a spherical surface and volume of revolution in \({\mathbb Z}^3\)
• On the polyhedra of graceful spheres and circular geodesics
• On different topological classes of spherical geodesic paths and circles in \(\mathbb{Z}^3\)
• Point searching in real singularcomplete intersection varieties: algorithms of intrinsic complexity
• Digital Straightness, Circularity, and Their Applications to Image Analysis

   Recommendations

• The convex hull of the integer points in a large ball 👍 👎
• Title not available (Why is that?) 👍 👎
• On integer points in polyhedra: A lower bound 👍 👎
• Title not available (Why is that?) 👍 👎
• On integer points in polyhedra 👍 👎

This page was built for publication: On the polyhedral complexity of the integer points in a hyperball

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q952452)