Graph-theoretical properties of parallelism in the digital plane

DOI10.1016/S0166-218X(02)00228-7zbMath1010.68191MaRDI QIDQ1861556

Peter Veelaert

Publication date: 9 March 2003

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

perceptual groupinginterval graphsdigital geometrydigital parallelism

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (2)

Reconstruction of Concurrent Lines from Leaning Points ⋮ Recognition of concurrency relations between inaccurate lines

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Geometric algorithms and combinatorial optimization.
• Preserving topology by a digitization process
• Discretization in Hausdorff space
• Geometric constructions in the digital plane
• Morphological sampling
• Solvability and Consistency for Linear Equations and Inequalities
• Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph

This page was built for publication: Graph-theoretical properties of parallelism in the digital plane