COMPUTING THE UNION OF 3-COLORED TRIANGLES

被引：5
|
作者：
Boissonnat, Jean-Daniel [1 ]
Devillers, Olivier [1 ]
Preparata, Franco P. [1 ,2 ]
机构：
[1] INRIA, F-06561 Valbonne, France
[2] Brown Univ, Dept Comp Sci, Providence, RI 02912 USA
来源：
INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS | 1991年 / 1卷 / 02期
关键词：
Convex hull; Legged robot; Motion planning; Stability;
D O I：
10.1142/S021819599100013X
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Given is a set S of n points, each colored with one of k >= 3 colours. We say that a triangle defined by three points of S is 3-colored if its vertices have distinct colours. We prove in this paper that the problem of constructing the boundary of the union T(S) of all such 3-colored triangles can be done in optimal O(n log n) time.
引用
收藏
页码：187 / 196
页数：10
相关论文
共 50 条
12345