Share Email Print

Proceedings Paper

An extended arc data structure and its applications
Author(s): Jiechen Wang; Yongquan Li; Chenhui Qian
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 2 August 2007
PDF: 9 pages
Proc. SPIE 6751, Geoinformatics 2007: Cartographic Theory and Models, 67511H (2 August 2007); doi: 10.1117/12.760101
Show Author Affiliations
Jiechen Wang, Nanjing Univ. (China)
Yongquan Li, Nanjing Univ. (China)
Chenhui Qian, Nanjing Univ. (China)

Published in SPIE Proceedings Vol. 6751:
Geoinformatics 2007: Cartographic Theory and Models

© SPIE. Terms of Use
Back to Top