Geostatistical simulation of random fields with bivariate isofactorial distributions by adding mosaic models

This work deals with the geostatistical simulation of a family of stationary random field models with bivariate isofactorial distributions. Such models are defined as the sum of independent random fields with mosaic-type bivariate distributions and infinitely divisible univariate distributions. For practical applications, dead leaf tessellations are used since they provide a wide range of models and allow conditioning the realizations to a set of data via an iterative procedure (simulated annealing). The model parameters can be determined by comparing the data variogram and madogram, and enable to control the spatial connectivity of the extreme values in the realizations. An illustration to a forest dataset is presented, for which a negative binomial model is used to characterize the distribution of coniferous trees over a wooded area.     

一种高阶Delaunay三角网生成算法

Delaunay三角剖分是构建数字地形模型的有效方法,但是该方法可能产生人工大坝和局部极小问题,使得地形模型不能很好地反映原始地形的真实面貌。本文在Delaunay三角网的基础上引入了高阶Delaunay三角网,并给出了一种高阶Delaunay三角网生成算法。实验表明,高阶Delaunay三角网能够有效地减少地形的局部极小数量,是建立数字高程模型的一种新方法。因此,采用高阶Delaunay三角网建立的地形模型更接近于实际地形。     

一种改进的Delaunay三角化算法研究

Delaunay三角化在诸多应用领域具有极其广泛用途,也一直是计算机图形图像学和科学计算可视化技术的重要研究内容。针对二维约束Delaunay三角化问题,提出一种快速生成算法。该算法首先建立环形矩形,分环分治平面散乱点;然后依据Delaunay三角形的性质,从外环到内环分治逐步插入新点,一环插入完毕后,整理有效Delaunay三角形;依次循环快速生成二维约束Delaunay三角网格。本算法计算过程简单,计算效率高,程序编写十分容易无需复杂的递归过程,技巧性地解决了二维约束Delaunay三角化问题。实例证明,该算法具有较好的应用效果。     

Tessellations in GIS: Part II–making changes

Abstract

We attempt to describe the role of tessellated models of space within the discipline of Geographic Information Systems (GIS) – a speciality coming largely out of Geography and Land Surveying, where there was a strong need to represent information about the land’s surface within a computer system rather than on the original paper maps. We look at some of the basic operations in GIS, including dynamic and kinetic applications. We examine issues of topology and data structures, and produced a tessellation model that may be widely applied both to traditional “object” and “field” data types. The Part I of this study examined object and field spatial models, the Voronoi extension of objects, and the graphs that express the resulting adjacencies. The required data structures were also briefly described, along with 2D and 3D structures and hierarchical indexing. The importance of graph duality was emphasized. Here, this second paper builds on the structures described in the first, and examines how these may be modified: change may often be associated with either viewpoint or time. Incremental algorithms permit additional point insertion, and applications involving the addition of skeleton points, for map scanning, contour enrichment or watershed delineation and simulation. Dynamic algorithms permit skeleton smoothing, and higher order Voronoi diagram applications, including Sibson interpolation. Kinetic algorithms allow collision detection applications, free-Lagrange flow modeling, and pen movement simulation for map drawing. If desired these methods may be extended to 3D. Based on this framework, it can be argued that tessellation models are fundamental to our understanding and processing of geographical space, and provide a coherent framework for understanding the “space” in which we exist.     

一种快速二维 Delaunay 三角网点定位算法

在构建二维Delaunay三角网的逐点插入法中,定位待插点所在三角形的快慢是影响整个算法构网速度的关键因素。针对目前已有算法存在的搜索路径长、搜索路径求解计算量大等问题,结合三角形重心的几何性质,对点定位算法进行改进,避免求三角形重心和相交边的过程。实验结果表明,文中算法较目前其他点定位算法能够有效地缩短搜索路径,减少点定位的计算时间,提高Delaunay三角网构网过程中点定位的效率。     

联合Delaunay三角网的等高线群综合研究

采用"联合Delaunay三角网"来提取成组等高线的弯曲,在弯曲处利用平三角形连接法进行局部地形结构线的连接,并建立起地形结构线的树状结构。运用方根模型确定谷地选取的数量指标,并提出了一种新的数学模型以确定谷地选取的质量指标,完成等高线群的自动综合。研究和实验表明,该方法充分顾及了地貌形态特征,谷地选取合理,概括程度适当,并完全避免了相邻等高线相交,综合效果较好。     

室内楼层平面导航路网模型的自动生成

室内路网模型作为室内导航研究的基础,如何自动生成室内路网模型成为近年的研究热点.对于目前自动路网模型研究中出现的复杂环境适应度不够的问题,本文提出了一种室内楼层平面路网模型的自动提取方法.它将室内空间分为公共空间和专属空间两类,从而形成公共空间路径和专属空间路径,并用转换点将两类路径进行衔接;最终利用提取的公共空间路径...     

Determination of the constriction size distribution of granular filters by filtration tests

This paper presents the calibration of an experiment based on filtration tests, able to provide the cumulative constriction size distribution of granular materials. Here, simulations of these tests are performed using a discrete element method. Filters of same density but different thicknesses are created with a poly‐sized spherical material. Lateral periodic boundaries for the samples are used, and their size is calibrated so that a representative elementary volume is obtained. Fine particles are released on the created samples, and the particle size distribution of the collected material that successfully crossed the filters is computed. These particle size distributions are related to the underlying cumulative constriction size distribution (CSD) of the granular material involved in the samples. The CSD is derived using a probabilistic approach for the path length of individual particles through a granular material. We settle all the requisites related to the technique and to the fine particles that are released to allow reaching a correct CSD for the filter. The reference CSD used for the calibration of the experiment is obtained after a radical partition of the void space into Delaunay tetrahedra and a geometrical characterisation of constrictions on each tetrahedron face. Copyright © 2012 John Wiley & Sons, Ltd.     

基于约束Delaunay三角网的线、面群目标分布边界计算

群组目标的分布边界在空间方向关系判断、相似度计算以及地图自动综合等领域有着重要的应用,但目前的分布边界计算主要是针对空间点群目标,鲜有涉及空间线、面群目标。在约束Delaunay三角网的基础上,利用动态阈值"剥皮"法实现线、面群目标的分布边界计算。方法得到的分布边界多边形符合人们的空间认知习惯,能够较好地描述线、面群目标的空间形态和分布范围。