摘录


This paper provides a unified discussion of the Delaunay triangulation. Its
geometric properties are reviewed and several applications are discussed.
Two algorithms are presented for constructing the triangulation over a
planar set of Npoints. The first algorithm uses a divide-and-conquer approach.
It runs in O(Nlog N) time, which is asymptotically optimal. The second
algorithm is iterative and requires O(N 2) time in the worst case. However,
its average case performance is comparable to that of the first algorithm.
KEY WORDS: Delaunay triangulation; triangulation; divide-and-conquer;
Voronoi tessellation; computational geometry; analysis of algorithms. 

点评

NULL

原文

点击这里查看原文

其它

本帖内容由21QA云收藏工具自动生成,欢迎使用。

系统消息 若觉得内容不错,请点击左上角的"赞"图标,以优化网站的内容呈现。 另外,请及时验证注册邮箱,否则收不到21QA发出的红包。 官方Q群:250203055

asked 14 Sep '17, 21:36

%E8%B7%AF%E4%BA%BA%E7%94%B2's gravatar image

路人甲
131544586654

Be the first one to answer this question!
toggle preview

Follow this question

By Email:

Once you sign in you will be able to subscribe for any updates here

By RSS:

Answers

Answers and Comments

Markdown Basics

  • *italic* or _italic_
  • **bold** or __bold__
  • link: [text](http://url.com/ "title")
  • image: ![alt](/path/img.jpg "title")
  • numbered list: 1. Foo 2. Bar
  • to add a line break simply add two spaces to where you would like the new line to be.
  • basic HTML tags are also supported

Question tags:

×826
×33

question asked: 14 Sep '17, 21:36

question was seen: 472 times

last updated: 14 Sep '17, 21:36

powered by O*S*Q*A

粤ICP备14040061号-1