国家基础航空摄影成果数据库的设计与建立

通过对国家基础航空摄影成果资料进行分析,从国家基础航空摄影成果资料的集成管理、安全存储、档案管理等方面的需求出发,提出国家基础航空摄影成果数据库建库的数据组织方式和数据存储模式,并通过设计建立国家基础航空摄影成果数据库管理系统,实现国家基础航空摄影成果资料海量、复杂、多样数据的存储管理和分发服务。     

自适应Lp估计及其在SLR数据预处理中的应用

本文简要介绍了自适应Ｌｐ估计的有关理论和求解方法，并对ＳＬＲ数据的测量误差作了统计分析。发现ＳＬＲ数据的测量误差服从ｐ值不定的ｐ范分布。本文ＳＬＲ数据预处理实例表明自适应Ｌｐ估计能给出比ＬＳ估计更为稳健有效的拟合参数。当观测值粗差高达６６％时，自适应Ｌｐ估计仍能给出可靠的拟合参数，效果明显优于传统的ＬＳ估计。     

地形图数字化快速修测系统

本文论述了建立利用多种资料进行地形图数字化快速修测系统的基本原理及其基本功能。利用坐标变换和整体平差的方法，有效地解决了各种控制资料的坐标系不同和精度不一致的问题，确保了修测精度。     

隧道GPS网对横向贯通误差的影响

本文在阐述隧道工程独立坐标系和隧道ＧＰＳ网数据处理方法的基础上推导出ＧＰＳ网对横向贯通误差影响的通用计算公式，分析了隧道ＧＰＳ网基准数据位置对横向贯通误差的影响。     

地理信息系统基础软件吉奥之星NT版的总体设计思想与关键技术

介绍了新一代面向对象的GIS基础软件系统吉奥之星NT版的总体设计思想、系统结构、功能特点和有关关键技术。     

航空摄影最佳曝光量的选择

分解力是评定影象质量的重要指标。本文介绍利用改进后的国产9 w测微密度仪,测定航空软片静态分解力与曝光量的关系。以最大分解力所相应的曝光量作为确定航摄软片感光度的基准,以此为基础,确定航摄底片的最大密度( D _max )、最小密度( D _min )、影象反差(△ D )和平均密度( D _R )本文对国产1022T、1022P、柯达2402、2412等航摄软片进行了研究,其试验结果可作为今后修改航摄规范的基础。     

Tile‐based polygon overlay of vector data in a virtual globe

The demand for analysis of large‐scale data has increased with increased access to spatial vector data. Polygon overlay of vector data in a virtual globe requires proprietary data structures and proprietary analysis algorithms. A vector data structure is designed for rapid polygon overlay in a virtual globe by recording the metadata of the triangles (TriMeta) that constitute polygons. A polygon overlay algorithm is proposed based on this data structure. The overlay of two complex GIS polygons is transformed into the intersection computation of their 3D triangular presentations. The intersection computation of two sets of triangles is reduced considerably by utilizing TriMeta to filter out the disjoint triangle pairs and rapidly identify the contained triangle. The new method improves the overlay efficiency in a virtual globe because the amount of computation required to calculate the intersections of two large polygons and drape the intersections onto a terrain surface is reduced.     

Small‐area patch‐merging method accounting for both local constraints and the overall area balance

Small‐area patch merging is a common operation in land use data generalization. However, existing research on small‐area patch merging has mainly focused on local compatibility measures, which often lead to area imbalances among land use types from a global perspective. To address the shortcomings of previous studies by resolving local and global concerns simultaneously, this article proposes a merging method that considers both local constraints and the overall area balance. First, a local optimization model that considers three constraints—namely, the areas of neighboring patches, the lengths of shared arcs, and semantic similarity—is established. The areas of small patches are first pre‐allocated. Subsequently, in accordance with an area change threshold for individual land use types, land use types with area changes that exceed this threshold are identified. The patches corresponding to these land use types are subjected to iterative adjustments while considering the overall area balance. Based on their area splitting abilities, the split lines for small‐area patches are determined, and small‐area patches are merged. Finally, actual data from Guangdong Province are used for validation. The experimental results demonstrate that the proposed method is capable of preserving the local compatibility of patches while balancing the overall area associated with each land use type.     

Mapping 3D visibility in an urban street environment from mobile LiDAR point clouds

ABSTRACT

Visibility determination is a key requirement in a wide range of national and urban applications, such as national security, landscape management, and urban design. Mobile LiDAR point clouds can depict the urban built environment with a high level of details and accuracy. However, few three-dimensional visibility approaches have been developed for the street-level point-cloud data. Accordingly, an approach based on mobile LiDAR point clouds has been developed to map the three-dimensional visibility at the street level. The method consists of five steps: voxelization of point-cloud data, construction of lines-of-sight, construction of sectors of sight, construction of three-dimensional visible space, and calculation of volume index. The proposed approach is able to automatically measure the volume of visible space and openness at any viewpoint along a street. This approach has been applied to three study areas. The results indicated that the proposed approach enables accurate simulation of visible space as well as high-resolution (1 m × 1 m) mapping of the visible volume index. The proposed approach can make a contribution to the improvement of urban planning and design processes that aim at developing more sustainable built environments.     

A method for the extraction of partition lines from long and narrow patches that account for structural features

The extraction of partition lines for long and narrow patches (LN patches) is an important yet difficult problem in the generalization of thematic data. When current methods are used to process polygons with irregular shapes or complex branch convergence zones, the extracted line structural features tend to be inaccurate and topologically erroneous. In this article, we propose an improved partition lines extraction algorithm of constrained Delaunay triangulation to counter these issues. The proposed method aims to maintain consistency between the extracted line structure characteristics and the actual object structure, especially for complex branch convergence zones. First, we describe three types of aggregation patterns (Type A, B, and C aggregation zones) that occur in partition line extractions for LN patches of complex branch convergence zones using Delaunay triangulation. Then, a partition line extraction algorithm that accounts for the direction between the edges of triangles and the distance of nodes in aggregation zones is proposed. Finally, we test our method for a dataset relating to Guizhou Province, China. Compared with the current method that uses quantitative indicators and visualization, the results indicate that our method not only has applicability for simple situations but also is superior for preserving structural features of complex branch convergence zones.