科研之友
微信
新浪微博
Facebook
分享链接
摘要
Suppose we want to compute the Delaunay triangulation of a set P whose points are restricted to a collection a"> of input regions known in advance. Building on recent work by Loffler and Snoeyink, we show how to leverage our knowledge of a"> for faster Delaunay computation. Our approach needs no fancy machinery and optimally handles a wide variety of inputs, e.g., overlapping disks of different sizes and fat regions.
- 出版日期2011-11
