pinealservo/wiki
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Some more notes

Browse Source
This commit is contained in:
Levi Pearson
2014-01-25 00:10:01 -07:00
parent 233d87a585
commit 84af95d818
1 changed files with 13 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

13
math/computational_geometry/notes.page
View File

@@ -32,3 +32,16 @@ parallel to an edge passes through an odd number of edges.
A point $x$ is *exterior* if a ray through it ... etc ... passes A point $x$ is *exterior* if a ray through it ... etc ... passes
through an even number of edges. through an even number of edges.
These two facts form the basis of an algorithm for determining whether
a point is inside a polygon.
*diagonal*
: A line segment of $P$ connecting two vertices and lying in the interior of
$P$, not touching $\partial P$ except at endpoints. Two diagonals are
*noncrossing* if they share no interior points.
*triangulation*
: A decomposition of $P$ into triangles by a maximal set of
noncrossing diagonals. Maximal means that no more diagonals may be
added without crossing.