摘要
约束数据域三角剖分一直是近年来网格剖分技术中的一个研究热点。本文简要介绍现有约束Delaunay三角网,并分析其优缺点,在此基础上考虑某些存在大量约束边的现实情况(如城市地形),提出更有效的约束数据分步法构建约束Delaunay三角网的方法。
The constrained Delaunay triangulation has been a research hotspot in recent years.This article has introduced the existing Delaunay triangulation bound briefly and analyze its strengths and weaknesses.On this basis,this article support a more effective solution applied to the existence of a large number of constraints of the realities of edges(such as urban terrain).
出处
《测绘科学》
CSCD
北大核心
2009年第S1期117-118,28,共3页
Science of Surveying and Mapping
