The following pages link to (Q4011309):
Displayed 14 items.
- On the diameter of lattice polytopes (Q282757) (← links)
- The number of different digital \(N\)-discs (Q333607) (← links)
- Convergence of binomial-based derivative estimation for \(C^{2}\) noisy discretized curves (Q638560) (← links)
- The layer number of \(\alpha \)-evenly distributed point sets (Q785830) (← links)
- Comparison and improvement of tangent estimators on digital curves (Q1023439) (← links)
- An improved construction of progression-free sets (Q1758902) (← links)
- Short simplex paths in lattice polytopes (Q2117352) (← links)
- Distance between vertices of lattice polytopes (Q2174873) (← links)
- The convex hull of the lattice points inside a curve (Q2453822) (← links)
- Approximation of convex sets by polytopes (Q2519248) (← links)
- Random points and lattice points in convex bodies (Q3518215) (← links)
- Sublinear Bounds for a Quantitative Doignon--Bell--Scarf Theorem (Q4602859) (← links)
- Grid peeling and the affine curve-shortening flow (Q5232728) (← links)
- Computational determination of the largest lattice polytope diameter (Q5918843) (← links)