The following pages link to (Q3514517):
Displaying 9 items.
- Moving out the edges of a lattice polygon (Q411406) (← links)
- Elementary geometry on the integer lattice (Q1662428) (← links)
- On the combinatorial complexity of approximating polytopes (Q1688856) (← links)
- Digital convex + unimodular mapping = 8-connected (all points but one 4-connected) (Q2061794) (← links)
- Efficiently testing digital convexity and recognizing digital convex polygons (Q2203347) (← links)
- Tight bounds on discrete quantitative Helly numbers (Q2360726) (← links)
- Sublinear Bounds for a Quantitative Doignon--Bell--Scarf Theorem (Q4602859) (← links)
- Efficient Algorithms to Test Digital Convexity (Q5237086) (← links)
- Testing convexity of figures under the uniform distribution (Q5381051) (← links)
