-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathcorrectness.pug
33 lines (31 loc) · 1015 Bytes
/
correctness.pug
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
extends layout.pug
block content
article
h2 Correctness
p
| Computational Geometry is notoriously difficult to get right. The
|
a(href="https://en.wikipedia.org/wiki/Convex_hull_of_a_simple_polygon") convex hull algorithm
|
| is a prime example of this: From 1972 to 1989, 16 solutions were published
| in peer-reviewed journals and 7 of them turned out to be wrong.
p
| So, why should you believe RGeometry is correct?
| To answer this we have to look at RGeometry's design and talk about how it
| leads to strong guarantees and predictable behaviour.
article.feature
h3 Fixed precision vs arbitrary precision
article.feature
h3 Derived Data
article.feature
h3 Property testing
h4 Random Polygons
h4 Convex Polygons
h4 Monotone Polygons
article.feature
h3 Emperical testing
article.feature
h3 Simulation of Simplicity
article.feature
h3 Floating-point
//- http://cgm.cs.mcgill.ca/~athens/cs601/