scientific article; zbMATH DE number 2084493

zbMath1052.68765MaRDI QIDQ4475319

Ulrich Eckhardt

Publication date: 9 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2243/22430209.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

digital geometrydigital convexitydigital linesTietzes's theorem

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (13)

Lyndon + Christoffel = digitally convex ⋮ A Characterization of Consistent Digital Line Segments in ℤ2 ⋮ Covering a Euclidean line or hyperplane by dilations of its discretization ⋮ Convexity preserving deformations of digital sets: characterization of removable and insertable pixels ⋮ An envelope operator for full convexity to define polyhedral models in digital spaces ⋮ Algorithms for pixelwise shape deformations preserving digital convexity ⋮ Full convexity for polyhedral models in digital spaces ⋮ Geometric preservation of 2D digital objects under rigid motions ⋮ Minimal non-convex words ⋮ Faithful polygonal representation of the convex and concave parts of a digital curve ⋮ An alternative definition for digital convexity ⋮ An alternative definition for digital convexity ⋮ Further steps on the reconstruction of convex polyominoes from orthogonal projections

This page was built for publication: