ON SORTING TRIANGLES IN A DELAUNAY TESSELLATION

被引：13

作者：

DEFLORIANI, L ^{[1
]}

FALCIDIENO, B ^{[1
]}

NAGY, G ^{[1
]}

PIENOVI, C ^{[1
]}

机构：

[1] RENSSELAER POLYTECH INST,DEPT ELECT COMP & SYST ENGN,TROY,NY 12180

来源：

ALGORITHMICA | 1991年 / 6卷 / 04期

关键词：

DELAUNAY TRIANGULATION; SORTING; VISIBILITY;

D O I：

10.1007/BF01759057

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

In a two-dimensional Delaunay-triangulated domain, there exists a partial ordering of the triangles (with respect to a vertex) that is consistent with the two-dimensional visibility of the triangles from that vertex. An equivalent statement is that a polygon that is star-shaped with respect to a given vertex can be extended, one triangle at a time, until it includes the entire domain. Arbitrary planar triangulations do not possess this useful property which allows incremental processing of the triangles.

引用

页码：522 / 532

页数：11