Paper
2 August 2007 An extended arc data structure and its applications
Jiechen Wang, Yongquan Li, Chenhui Qian
Author Affiliations +
Abstract
The paper describes an extended arc data structure, it is especially suitable in some vector-based operations. The existing vectorial arc data structure can store and organize coordinate information effectively, but some vector-based calculations are inefficient. Enlightened by the idea of spatial index, the paper proposed to divide arc into subsections, obtain spatial limit information of each segment and build up to arc data structure. The paper also gives realizing method for this modified structure, analyses time efficiency and space efficiency in some frequently used procedures. Taking the computation of the distance between point and arc for example, this paper analyses the relationship between computational efficiency and sub-arc node number, gives practical results using artificial and real arcs from a GIS environment. Tests results indicated that it would improve the efficiency of vector operations, and accelerate some vector-based algorithm practical indirectly with the extended data structure.
© (2007) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Jiechen Wang, Yongquan Li, and Chenhui Qian "An extended arc data structure and its applications", Proc. SPIE 6751, Geoinformatics 2007: Cartographic Theory and Models, 67511H (2 August 2007); https://doi.org/10.1117/12.760101
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Geographic information systems

Data storage

Data modeling

Spatial analysis

Algorithm development

Analytical research

Linear elements

Back to Top