Duality and Dimensionality Reduction Discrete Line Generation Algorithm for a Triangular Grid
Vectors are a key type of geospatial data, and their discretization, which involves solving the problem of generating a discrete line, is particularly important. In this study, we propose a method for constructing a discrete line mathematical model for a triangular grid based on a “weak du...
Main Authors: | Lingyu Du, Qiuhe Ma, Jin Ben, Rui Wang, Jiahao Li |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2018-09-01
|
Series: | ISPRS International Journal of Geo-Information |
Subjects: | |
Online Access: | http://www.mdpi.com/2220-9964/7/10/391 |
Similar Items
-
Bidirectional mapping between rhombic triacontahedron and icosahedral hexagonal discrete global grid systems
by: Xinhai Huang, et al.
Published: (2024-12-01) -
A Continuous Coordinate System for the Plane by Triangular Symmetry
by: Benedek Nagy, et al.
Published: (2019-02-01) -
Lattice Quad-Tree Indexing Algorithm for a Hexagonal Discrete Global Grid System
by: Jianbin Zhou, et al.
Published: (2020-01-01) -
Hexagonal Convolutional Neural Networks for Hexagonal Grids
by: Junren Luo, et al.
Published: (2019-01-01) -
Construction of rhombic triacontahedron discrete global grid systems
by: Xiaoyu Liang, et al.
Published: (2022-12-01)