On the polyhedral complexity of the integer points in a hyperball

DOI10.1016/J.TCS.2008.07.014MaRDI QIDQ952452zbMATH OpenOpenAlexFDO

Authors Valentin E. Brimkov, Reneta P. Barneva

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)

Recommendations

• The convex hull of the integer points in a large ball
• scientific article; zbMATH DE number 1305341
• On integer points in polyhedra: A lower bound
• Publication:4714496
• On integer points in polyhedra

Cites work

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

Cited in

(11)

• Point searching in real singularcomplete intersection varieties: algorithms of intrinsic complexity
• On the structure of the set of integral points inside a ball
• On the intrinsic complexity of point finding in real singular hypersurfaces
• On the polyhedra of graceful spheres and circular geodesics
• Digital straightness, circularity, and their applications to image analysis
• Some theoretical challenges in digital geometry: a perspective
• On different topological classes of spherical geodesic paths and circles in \(\mathbb{Z}^3\)
• On the characterization of absentee-voxels in a spherical surface and volume of revolution in \({\mathbb Z}^3\)
• From prima quadraginta octant to lattice sphere through primitive integer operations
• Determining digital circularity using integer intervals
• On some local topological properties of naive discrete sphere

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)