测绘学报
測繪學報
측회학보
ACTA GEODAETICA ET CARTOGRAPHICA SINICA
2015年
4期
445-452
,共8页
GIS%拓扑关系%线/面单元交线%结点度%细分类型
GIS%拓撲關繫%線/麵單元交線%結點度%細分類型
GIS%탁복관계%선/면단원교선%결점도%세분류형
GIS%topological relationship%unit line/polygon intersection segment%node-degree%refined type
针对线/面细分拓扑关系研究存在的不足,提出了一种基于结点度的线/面细分拓扑关系描述与计算方法。该方法在定义线/面单元交线并分析其特点的基础上,引入结点度来区分线/面单元交线细分类型。根据单元交线端点在线/面目标组成图形结构中结点度的不同,及线目标在度为3和4的交线端点处是否有相连线段、相连线段位于多边形的边界上、内部或外部4个谓词推导出了21种有意义的线/面交线细分拓扑关系类型。在此基础上分析比较了本文方法与现有方法的异同与优势,举例说明本文方法在复杂线/面细分拓扑关系描述中的应用。最后用Visual C#语言编程实现了该方法,并将其应用到线状道路/面状河流目标间的数据质量检查与修正中,验证可行性。
針對線/麵細分拓撲關繫研究存在的不足,提齣瞭一種基于結點度的線/麵細分拓撲關繫描述與計算方法。該方法在定義線/麵單元交線併分析其特點的基礎上,引入結點度來區分線/麵單元交線細分類型。根據單元交線耑點在線/麵目標組成圖形結構中結點度的不同,及線目標在度為3和4的交線耑點處是否有相連線段、相連線段位于多邊形的邊界上、內部或外部4箇謂詞推導齣瞭21種有意義的線/麵交線細分拓撲關繫類型。在此基礎上分析比較瞭本文方法與現有方法的異同與優勢,舉例說明本文方法在複雜線/麵細分拓撲關繫描述中的應用。最後用Visual C#語言編程實現瞭該方法,併將其應用到線狀道路/麵狀河流目標間的數據質量檢查與脩正中,驗證可行性。
침대선/면세분탁복관계연구존재적불족,제출료일충기우결점도적선/면세분탁복관계묘술여계산방법。해방법재정의선/면단원교선병분석기특점적기출상,인입결점도래구분선/면단원교선세분류형。근거단원교선단점재선/면목표조성도형결구중결점도적불동,급선목표재도위3화4적교선단점처시부유상련선단、상련선단위우다변형적변계상、내부혹외부4개위사추도출료21충유의의적선/면교선세분탁복관계류형。재차기출상분석비교료본문방법여현유방법적이동여우세,거례설명본문방법재복잡선/면세분탁복관계묘술중적응용。최후용Visual C#어언편정실현료해방법,병장기응용도선상도로/면상하류목표간적수거질량검사여수정중,험증가행성。
In order to overcome the shortcoming of the current models in discriminating the refined topological relations between line and polygon,a node‐degree based refined line/polygon topological relationship model is presented.In this model,the unit line/polygon intersection segment is defined at first, then node‐degree is introduced to refine the unit intersection segment.21 refinement line/polygon intersec‐tion segment types are differentiated using the degree of the end points of the intersection segment,and the relationship between the polygon and the next segment of the line object at the end point(s)with 3 or 4 degree values.The comparison is carried out between the proposed node‐degree based model and the cur‐rent model.The discrimination of the refined line/polygon relations with multiple intersections is described using an example.The effectiveness of this model is verified by the topological integrity checking between road and river data.