Salient and Reentrant Points of Discrete Sets
From MaRDI portal
Publication:3438920
DOI10.1016/S1571-0653(04)00487-1zbMath1115.52300MaRDI QIDQ3438920
Publication date: 29 May 2007
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Computational aspects related to convexity (52B55) Computing methodologies for image processing (68U10) Discrete geometry (52C99)
Related Items (11)
Lyndon + Christoffel = digitally convex ⋮ Combinatorial properties of double square tiles ⋮ A parallelogram tile fills the plane by translation in at most two distinct ways ⋮ A measure of \(Q\)-convexity for shape analysis ⋮ Shuffle operations on discrete paths ⋮ Algorithms for polyominoes based on the discrete Green theorem ⋮ An algorithm for deciding if a polyomino tiles the plane ⋮ On the tiling by translation problem ⋮ A Spatial Convexity Descriptor for Object Enlacement ⋮ Convex and Concave Vertices on a Simple Closed Curve in the Triangular Grid ⋮ The discrete Green theorem and some applications in discrete geometry
Cites Work
This page was built for publication: Salient and Reentrant Points of Discrete Sets
