登入
選單
返回
Google圖書搜尋
An Upper Bound for Conforming Delaunay Triangulations
Herbert Edelsbrunner
Tiow Seng Tan
University of Illinois at Urbana-Champaign. Department of Computer Science
出版
Department of Computer Science, University of Illinois at Urbana-Champaign
, 1992
URL
http://books.google.com.hk/books?id=IaxOEhIhHhkC&hl=&source=gbs_api
註釋
Abstract: "A plane geometric graph C in R℗ conforms to another such graph G if each edge of G is the union of some edges of C. It is provedthat for every G with n vertices and m edges, there is a completion of a Delaunay triangulation of O(m℗N) points that conforms to G. The algorithm that constructs the points is also described."
