Pages that link to "Item:Q2403743"

The following pages link to About the decidability of polyhedral separability in the lattice \(\mathbb {Z}^d\). Recognizing digital polyhedra with a prescribed number of faces (Q2403743):

Displaying 2 items.

• A characterization of 2-threshold functions via pairs of prime segments (Q2136278) (← links)
• Efficiently testing digital convexity and recognizing digital convex polygons (Q2203347) (← links)