Skip to Main Content
算法技术手册(原书第2 版)
book

算法技术手册(原书第2 版)

by George T.Heineman, Gary Pollice, Stanley Selkow
August 2017
Intermediate to advanced content levelIntermediate to advanced
360 pages
8h 35m
Chinese
China Machine Press
Content preview from 算法技术手册(原书第2 版)
计算几何
259
计算几何
9-16:代码中使用的类
Fortune 扫描算法小结
最好情况、平均情况和最坏情况:
O
(
n
log
n
)
fortune (P)
PQ = new Priority Queue
LineState = new Binary Tree
foreach p in P do
event = new SiteEvent(p)
insert event into PQ
while PQ is not empty do
event = getMin(PQ)
sweepPt = event.p
if event is site event then
processSite(event)
else
processCircle(event)
260
9
finishEdges()
processSite(e)
leaf = find arc A in beach line bisected by e.p
modify beach line and remove unneeded circle events
detect new potential ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

机器学习实战:基于Scikit-Learn、Keras 和TensorFlow (原书第2 版)

机器学习实战:基于Scikit-Learn、Keras 和TensorFlow (原书第2 版)

Aurélien Géron
Go语言编程

Go语言编程

威廉·肯尼迪
C++语言导学(原书第2版)

C++语言导学(原书第2版)

本贾尼 斯特劳斯特鲁普

Publisher Resources

ISBN: 9787111562221