Collinearity and Weak Collinearity in the Digital Plane

Authors:
Peter Veelaert
Affiliations:
-
Venue:
Digital and Image Geometry, Advanced Lectures [based on a winter school held at Dagstuhl Castle, Germany in December 2000]
Year:
2001

Citing 7
Cited 2

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
Parallel Line Grouping Based on Interval Graphs

DGCI '00 Proceedings of the 9th International Conference on Discrete Geometry for Computer Imagery

Concurrency of Line Segments in Uncertain Geometry

DGCI '02 Proceedings of the 10th 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.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.