Parallel, overlapped, and intersected digital straight lines
From MaRDI portal
A digital straight line is represented by a chain code of directions which satisfy Freeman's three criteria. Given two chain codes of digital straight lines and their starting pixels where their equations are not known, the paper will describe how to determine if they are parallel, overlapped, or intersected. An algorithm with only integer arithmetic is also implemented to find the intersection.
Recommendations
Cites work
- Digital Straight Line Segments
- Digital Straight Lines and Convexity of Digital Regions
- Discrete Representation of Straight Lines
- scientific article; zbMATH DE number 4016245 (Why is no real title available?)
- scientific article; zbMATH DE number 3290785 (Why is no real title available?)
- On cellular straight line segments
- On the Chain Code of a Line
- Picture processing grammar and its applications
- Spirograph Theory: A Framework for Calculations on Digitized Straight Lines
Cited in
(9)- Analytical description of digital intersections: minimal parameters and multiscale representation
- Detecting digital intersections using line approximation
- Discrete Representation of Straight Lines
- Spirograph Theory: A Framework for Calculations on Digitized Straight Lines
- Parallel line search
- scientific article; zbMATH DE number 16592 (Why is no real title available?)
- scientific article; zbMATH DE number 2084507 (Why is no real title available?)
- A study on the properties of 3D digital straight line segments
- A linear time and space algorithm for detecting path intersection in \(\mathbb Z^d\)
This page was built for publication: Parallel, overlapped, and intersected digital straight lines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1112630)
