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 duality” hexagonal grid, to overcome the drawbacks of existing discrete line generation algorithms for a triangular grid. First, a weak duality relationship between triangular and hexagonal grids is explored. Second, an equivalent triangular grid model is established based on the hexagonal grid, using this weak duality relationship. Third, the two-dimensional discrete line model is solved by transforming it into a one-dimensional optimal wandering path model. Finally, we design and implement the dimensionality reduction generation algorithm for a discrete line in a triangular grid. The results of our comparative experiment indicate that the proposed algorithm has a computation speed that is approximately 10 times that of similar existing algorithms; in addition, it has better fitting effectiveness. Our proposed algorithm has broad applications, and it can be used for real-time grid transformation of vector data, discrete global grid system (DGGS), and other similar applications.

[1]  Ali Mahdavi-Amiri,et al.  Hierarchical grid conversion , 2016, Comput. Aided Des..

[2]  Krzysztof Maurin.  Duality (polarity) in mathematics, physics and philosophy , 1988 .

[3]  Li Yan.  Study of Auto-vectorization Based on Scan-thinning Algorithm , 2012 .

[4]  Xiaolin Wu,et al.  Double-step incremental generation of lines and circles , 1987, Comput. Vis. Graph. Image Process..

[5]  Jack Bresenham,et al.  Algorithm for computer control of a digital plotter , 1965, IBM Syst. J..

[6]  P. W. Baker,et al.  On Digital Differential Analyzer (DDA) Circle Generation for Computer Graphics , 1975, IEEE Transactions on Computers.

[7]  Wang Zhi-peng.  An Adaptive Visualized Model of the Global Terrain Based on QTM , 2007 .

[8]  Arindam Biswas,et al.  Finding Shortest Triangular Path in a Digital Object , 2016, DGCI.

[9]  Geoffrey H. Dutton.  A Hierarchical Coordinate System for Geoprocessing and Cartography , 1998 .

[10]  Ali Mahdavi-Amiri,et al.  Offsetting spherical curves in vector and raster form , 2018, The Visual Computer.

[11]  Ma Ting.  Progresses of Geographical Grid Systems Researches , 2009 .

[12]  Lloyd A. Treinish,et al.  Sphere quadtrees: a new data structure to support the visualization of spherically distributed data , 1990, Other Conferences.

[13]  Gaëlle Largeteau-Skapin,et al.  Characterization and generation of straight line segments on triangular cell grid , 2018, Pattern Recognit. Lett..

[14]  Benedek Nagy,et al.  Shortest Paths in Triangular Grids with Neighbourhood Sequences , 2003 .

[15]  HERBERT FREEMAN.  Algorithm for Generating a Digital Straight Line on a Triangular Grid , 1979, IEEE Transactions on Computers.

[16]  Zhang Li.  Self-adaptive step straight-line algorithms , 2006 .

[17]  Geoffrey H. Dutton.  DIGITAL MAP GENERALIZATION USING A HIERARCHICAL COORDINATE SYSTEM , 2008 .

[18]  Tom Davis,et al.  Opengl programming guide: the official guide to learning opengl , 1993 .

[19]  John J. Bartholdi,et al.  Continuous indexing of hierarchical subdivisions of the globe , 2001, Int. J. Geogr. Inf. Sci..

[20]  Jia Yin.  A six-step algorithm for line drawing , 2007 .

[21]  Keith S. Reid-Green.  Three Early Algorithms , 2002, IEEE Ann. Hist. Comput..

[22]  A. Vince.  Discrete Lines and Wandering Paths , 2007, SIAM J. Discret. Math..