搜索结果: 1-13 共查到“测绘科学技术 Delaunay”相关记录13条 . 查询时间(0.046 秒)
Delaunay三角网约束下的影像稳健匹配方法
数字摄影测量 影像匹配 Delaunay三角网 线段描述子
2020/5/11
影像匹配是数字摄影测量和计算机视觉领域的关键问题。本文主要研究基于Delaunay三角网约束下的稳健影像匹配方法。首先利用Delaunay三角网对随机初始匹配点进行组织，构建分布均匀、结构稳定的局部连接关系；其次利用线段描述子和空间角度顺序建立了局部辐射和几何约束模型，并将粗差剔除问题转换为分析Delaunay三角网和对应匹配图的相似性问题；然后利用对应三角形局部约束实现匹配扩展；最后在分层策略和...
Research on Models Mergence Algorithm Based on Delaunay Triangulation
DEM Triangulation Digital photogrammetry Spatial modeling Topographic mapping Algorithms
2015/11/23
Model merging is widely used in many domains such as geography modeling, 3D design of highway and railway route and so on, so it is essential to design an efficient model merging algorithm. The object...
Updating Algorithms for Constraint Delaunay TIN
Updating Algorithm Constraint Delaunay TIN Integral Ear Elimination Influence Domain Re-Triangulation Polymorphism
2015/10/12
Present algorithms for D-TIN are far insufficient for the dynamic updating of CD-TIN in different applications. This paper,
based on improvement to present insertion and deletion algorithms for D-TI...
Dynamic Cartography Using Voronoi/Delaunay Methods
Voronoi Delaunay kinetic data structures dynamic topology interactive cartography
2015/10/9
We describe two reversible line-drawing methods for cartographic applications based on the kinetic (moving-point)
Voronoi diagram. Our objectives were to optimize the user’s ability to draw and edit...
ENCODING AND DECODING OF PLANAR MAPS THROUGH CONFORMING DELAUNAY TRIANGULATIONS
Planer Maps Conforming Delaunay Triangulations
2015/8/17
This paper describes a method to represent a Planar Map (PM) through a Conforming Delaunay Triangulation (CDT) with applications in a server-client environment. At the server a CDT of the edges of the...
The STIN method: 3D-Surface Reconstruction by Observation Lines and Delaunay TENs
Conforming Delaunay Tetrahedronized Networks Surface Reconstruction Data Dependent Triangulations
2015/5/26
A proper representation of the surface of the earth and the man-made object build upon it is needed as a data source for
environmental modelling and planning. One way to represent the terrain given ...
Scanline forced Delaunay TENs for surface representation
Delaunay Tetrahedron Networks (TEN) TIN Surface reconstruction
2015/3/10
The general idea that a Delaunay TIN (DT) is more appropriate than non-Delaunay TINs, due to ‘better’ shaped triangles, might be true for many applications, but not for height dependent analytical que...
A complete solution of cartographic displacement based on elastic beams model and Delaunay triangulation
Cartographic generalization Displacement Conflict Elastic beams model Delaunay triangulation Skeleton Proximity graph
2014/7/23
In map production and generalization, it is inevitable to arise some spatial conflicts, but the detection and resolution of these spatial conflicts still requires manual operation. It is become a bott...
DELAUNAY TRIANGULATION PARALLEL CONSTRUCTION METHOD AND ITS APPLICATION IN MAP GENERALIZATION
Delaunay Triangulated Irregular Network parallel computing data partitioning dynamic strip mesh simplification
2014/4/25
Delaunay triangulated irregular network (D-TIN) has been widely used in various fields and also played an increasingly important role on map generalization. But for massive data processing, current D-...
DELAUNAY TETRAHEDRALIZATIONS: HONOR DEGENERATED CASES
Delaunay triangulation Delaunay tetrahedralization degeneracies
2014/6/11
The definition of a Delaunay tetrahedralization (DT) of a set Sof points is well known: a DT is a tetrahedralization of Sin which every simplex (tetrahedron, triangle, or edge) is Delaunay. A simplex ...
LARGE SCALE CONSTRAINT DELAUNAY TRIANGULATION FOR VIRTUAL GLOBE RENDERING
Virtual Globe Graphics data structures TIN Data processing
2014/6/11
A technique to create a Delaunay triangulation for terrain visualization on a virtual globe is presented. This method can be used to process large scale elevation datasets with billions of points by u...
Delaunay 三角形构网的分治扫描线算法
Delaunay三角网 合成算法 扫描线算法 分治算法
2009/11/18
Delaunay 三角网作为一种主要的DTM 表示法, 具有极其广泛的用途。基于分治算法和逐点插入法的合成算法是目前研究较多的用于生成Delaunay 三角网的合成算法。简要介绍和评价扫描线算法和分治算法后, 提出一种新的基于这两种算法的合成算法。该方法兼顾空间与时间性能, 稳定性较高, 分别较扫描线算法和分治算法, 运行效率和鲁棒性更优。
约束Delaunay三角网生成算法研究
DTM Delaunay三角网 约束数据
2009/8/5
对约束Delaunay三角网的构建算法进行研究,并提出一种约束Delaunay 三角网生成算法,它充分利用分治算法与生长算法的优点,对离散点、构网中实时生成的边及三角形采用分块进行网格索引,有效地减少了搜索目标点、边及三角形的时间,从而提高构网速度.