Graph-theoretical properties of parallelism in the digital plane

Authors:
Peter Veelaert
Affiliations:
Department of INWE, Hogeschool Gent, University of Gent, Schoonmeersstraat 52, B-9000 Gent, Belgium
Venue:
Discrete Applied Mathematics
Year:
2003

Citing 10
Cited 4

Three-dimensional object recognition from single two-dimensional images

Artificial Intelligence
A survey of the Hough transform

Computer Vision, Graphics, and Image Processing
Uncertain geometry

Geometric reasoning
Morphological sampling

CVGIP: Image Understanding
Three-dimensional computer vision: a geometric viewpoint

Three-dimensional computer vision: a geometric viewpoint
Preserving Topology by a Digitization Process

Journal of Mathematical Imaging and Vision
Geometric Constructions in the Digital Plane

Journal of Mathematical Imaging and Vision
Discretization in Hausdorff Space

Journal of Mathematical Imaging and Vision
Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography

Communications of the ACM
Introductory Techniques for 3-D Computer Vision

Introductory Techniques for 3-D Computer Vision

Consensus sets for affine transformation uncertainty polytopes

Computers and Graphics
Reconstruction of concurrent lines from leaning points

IWCIA'11 Proceedings of the 14th international conference on Combinatorial image analysis
Duality and geometry straightness, characterization and envelope

DGCI'06 Proceedings of the 13th international conference on Discrete Geometry for Computer Imagery
Uncertain geometry in computer vision

DGCI'05 Proceedings of the 12th international conference on Discrete Geometry for Computer Imagery

Quantified Score

Hi-index	0.04

Visualization

Abstract

We propose different graph-theoretical algorithms to partition a set of digitized lines into parallel groups, i.e., subsets in which each line is parallel to the other lines in the subset. The slope of a digitized line is not a fixed real number, but is represented by an interval. Likewise, the parallel relations of a collection of lines are represented by an interval graph. The extraction of parallel groups is then equivalent to the detection of cliques in the interval graph. We also consider other partitioning methods, for example, methods based on minimum dominating sets, and on simplicial elimination orderings. In addition, we compute the number of ways in which we can divide a set into parallel groups.