登入
選單
返回
Google圖書搜尋
Computing the Union of 3-colored Triangles
Jean-Daniel Boissonnat
Institut national de recherche en informatique et en automatique (France)
Olivier Devillers
Franco P. Preparata
出版
Institut National de Recherche en Informatique et en Automatique
, 1990
URL
http://books.google.com.hk/books?id=Kc2iHAAACAAJ&hl=&source=gbs_api
註釋
Abstract: "Given is a set S of n points, each colored with one of k [greater than or equal to] 3 colors. We say that a triangle defined by three points of s is 3-colored if its vertices have distinct colors. 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."
