What Does Digital Straightness Tell about Digital Convexity?

DOI10.1007/978-3-642-10210-3_4zbMath1267.68276OpenAlexW1510655933MaRDI QIDQ3651601

Isabelle Sivignon, Tristan Roussillon, Laure Tougne

Publication date: 11 December 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-10210-3_4

zbMATH Keywords

digital geometrydigital convexityconvex and concave partsdigital straightnessmaximal segment

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (6)

A polygonal approximation for general 4-contours corresponding to weakly simple curves ⋮ A linear time and space algorithm for detecting path intersection in \(\mathbb Z^d\) ⋮ Dynamic Minimum Length Polygon ⋮ Faithful polygonal representation of the convex and concave parts of a digital curve ⋮ Two linear-time algorithms for computing the minimum length polygon of a digital contour ⋮ On Three Constrained Versions of the Digital Circular Arc Recognition Problem

This page was built for publication: What Does Digital Straightness Tell about Digital Convexity?