Characterization and generation of straight line segments on triangular cell grid

被引：7

作者：

Dutt, Mousumi ^{[1
]}

Andres, Eric ^{[2
]}

Skapin, Gaelle Largeteau ^{[2
]}

机构：

[1] St Thomas Coll Engn & Technol, Dept Comp Sci & Engn, Kolkata, India

[2] Univ Poitiers, UMR CNRS 7252, Lab XLIM, SIC, BP 30179, F-86962 Futuroscope, France

来源：

PATTERN RECOGNITION LETTERS | 2018年 / 103卷

关键词：

Triangular grid; Digital straight line; Digital straight line segment; Digital plane; Triangular straight line; ALGORITHM;

D O I：

10.1016/j.patrec.2018.01.009

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

In this paper we are considering straight lines and straight line segments defined by two triangle centroids in the triangular cell grid. A generation algorithm determining all the triangles (triangular cells) that are crossed by a straight line segment is proposed. There is the particular case where straight lines or straight line segments cross a vertex of the grid. We propose an arithmetical characterization of such lines and line segments. (c) 2018 Elsevier B.V. All rights reserved.

引用

页码：68 / 74

页数：7

共 50 条

[31] An Arithmetical Characterization of the Convex Hull of Digital Straight Segments
Roussillon, Tristan
[J]. DISCRETE GEOMETRY FOR COMPUTER IMAGERY, DGCI 2014, 2014, 8668 : 150 - 161
[32] ASYMPTOTICS FOR NUMBERS OF LINE SEGMENTS AND LINES IN A SQUARE GRID
Haukkanen, Pentti
Merikoski, Jorma K.
[J]. INTERNATIONAL JOURNAL OF NUMBER THEORY, 2012, 8 (05) : 1145 - 1152
[33] Using Connected Component Decomposition to Detect Straight Line Segments In Documents
Feng, Xiaofan
Youssef, Abdou
[J]. DOCUMENT RECOGNITION AND RETRIEVAL XIX, 2012, 8297
[34] Dynamic Construction of Voronoi Diagram for a Set of Points and Straight Line Segments
Liu, Xin
Zhao, Ye
[J]. INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND SOFTWARE ENGINEERING (AISE 2014), 2014, : 400 - 403
[35] GEOMETRIC METHODS FOR ONLINE RECOGNITION OF DIGITAL STRAIGHT-LINE SEGMENTS
CREUTZBURG, E
HUBLER, A
SYKORA, O
[J]. COMPUTERS AND ARTIFICIAL INTELLIGENCE, 1988, 7 (03): : 253 - 276
[36] A Formula for the Linking Number in Terms of Isometry Invariants of Straight Line Segments
Bright, M.
Anosova, O.
Kurlin, V
[J]. COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS, 2022, 62 (08) : 1217 - 1233
[37] Finding Poly-Curves of Straight Line and Ellipse Segments in Images
Wenzel, Susanne
Foerstner, Wolfgang
[J]. PHOTOGRAMMETRIE FERNERKUNDUNG GEOINFORMATION, 2013, (04): : 297 - 308
[38] Computational Complexity for the Problem of Optimal Intersection of Straight Line Segments by Disks
K. S. Kobylkin
[J]. Proceedings of the Steklov Institute of Mathematics, 2018, 303 : 146 - 155
[39] Segmentation of planar curves into straight-line segments and elliptical arcs
Wan, WH
Ventura, JA
[J]. GRAPHICAL MODELS AND IMAGE PROCESSING, 1997, 59 (06): : 484 - 494
[40] Computational Complexity for the Problem of Optimal Intersection of Straight Line Segments by Disks
Kobylkin, K. S.
[J]. PROCEEDINGS OF THE STEKLOV INSTITUTE OF MATHEMATICS, 2018, 303 : 146 - 155

← 1 2 3 4 5 →