The following pages link to (Q3922475):
Displaying 7 items.
- On the number of irreducible points in polyhedra (Q343724) (← links)
- On the polyhedral complexity of the integer points in a hyperball (Q952452) (← links)
- Some theoretical challenges in digital geometry: a perspective (Q967394) (← links)
- On integer points in polyhedra (Q1193530) (← links)
- On integer points in polyhedra: A lower bound (Q1196682) (← links)
- Convex digital polygons, maximal digital straight segments and convergence of discrete geometric estimators (Q2384109) (← links)
- Polynomial algorithms for guillotine cutting of a rectangle into small rectangles of two kinds (Q2456409) (← links)
