Collinearity and weak collinearity in the digital plane

Authors:
Peter Veelaert
Affiliations:
Hogent, Schoonmeersstraat, 52, 9000 Ghent, Belgium
Venue:
Digital and image geometry
Year:
2001

Citing 6
Cited 3

Three-dimensional object recognition from single two-dimensional images

Artificial Intelligence
Morphological sampling

CVGIP: Image Understanding
Discrete analytical hyperplanes

Graphical Models and Image Processing
Geometric Constructions in the Digital Plane

Journal of Mathematical Imaging and Vision
Classification with Nonmetric Distances: Image Retrieval and Class Representation

IEEE Transactions on Pattern Analysis and Machine Intelligence
A Metric for Line Segments

IEEE Transactions on Pattern Analysis and Machine Intelligence

Consensus sets for affine transformation uncertainty polytopes

Computers and Graphics
Reestablishing consistency of uncertain geometric relations in digital images

Proceedings of the 11th international conference on Theoretical foundations of computer vision
Duality and geometry straightness, characterization and envelope

DGCI'06 Proceedings of the 13th international conference on Discrete Geometry for Computer Imagery

Quantified Score

Hi-index	0.00

Visualization

Abstract

We discuss the optimal grouping of collinear line segments, where we use a digital form of collinearity as the grouping criterion. We also introduce weak collinearity as a new concept to facilitate the design of an efficient line grouping algorithm. This algorithm is based on the use of simplicial elimination orderings, as known in graph theory.