The following pages link to (Q4475319):
Displaying 25 items.
- Minimal non-convex words (Q544886) (← links)
- Lyndon + Christoffel = digitally convex (Q834259) (← links)
- Digital lines with irrational slopes (Q884472) (← links)
- Boundaries in digital planes (Q910043) (← links)
- On the flatness of digital hyperplanes (Q1318579) (← links)
- Study on the digitization dual combinatorics and convex case (Q1690423) (← links)
- Geometric preservation of 2D digital objects under rigid motions (Q1722617) (← links)
- Further steps on the reconstruction of convex polyominoes from orthogonal projections (Q2084620) (← links)
- Faithful polygonal representation of the convex and concave parts of a digital curve (Q2276012) (← links)
- Covering a Euclidean line or hyperplane by dilations of its discretization (Q2405479) (← links)
- Digital Jordan curves (Q2433687) (← links)
- Interactions between digital geometry and combinatorics on words (Q2789507) (← links)
- Constructing Consistent Digital Line Segments (Q2802946) (← links)
- A Characterization of Consistent Digital Line Segments in ℤ2 (Q3452798) (← links)
- Chord properties of digital straight line segments (Q3561077) (← links)
- (Q3725559) (← links)
- Translation of a Digital Line into another according to various Digitization Processes (Q4638262) (← links)
- Efficient Algorithms to Test Digital Convexity (Q5237086) (← links)
- Discrete Geometry for Computer Imagery (Q5902433) (← links)
- An alternative definition for digital convexity (Q5918416) (← links)
- An alternative definition for digital convexity (Q5925581) (← links)
- Convexity preserving deformations of digital sets: characterization of removable and insertable pixels (Q6069173) (← links)
- An envelope operator for full convexity to define polyhedral models in digital spaces (Q6078193) (← links)
- Algorithms for pixelwise shape deformations preserving digital convexity (Q6160791) (← links)
- Full convexity for polyhedral models in digital spaces (Q6160792) (← links)
