The following pages link to (Q3318142):
Displaying 14 items.
- Computing efficiently the lattice width in any dimension (Q638564) (← links)
- An algorithm to find the lineality space of the positive hull of a set of vectors (Q662122) (← links)
- Lyndon + Christoffel = digitally convex (Q834259) (← links)
- An efficient convex hull algorithm using affine transformation in planar point set (Q900582) (← links)
- Digital straightness -- a review (Q1827822) (← links)
- Detection of the discrete convexity of polyominoes (Q1861555) (← links)
- An effective method to determine whether a point is within a convex hull and its generalized convex polyhedron classifier (Q2225169) (← links)
- (Q3153053) (← links)
- Efficient Lattice Width Computation in Arbitrary Dimension (Q3648771) (← links)
- (Q4606269) (← links)
- Construction of some computational algorithms on finite sets of points in the plane (Q4884269) (← links)
- Digital Straightness (Q4917088) (← links)
- An alternative definition for digital convexity (Q5918416) (← links)
- An alternative definition for digital convexity (Q5925581) (← links)