48 lines
1.5 KiB
Plaintext
48 lines
1.5 KiB
Plaintext
---
|
|
format: markdown
|
|
toc: yes
|
|
title: Computational Geometry Study Notes
|
|
...
|
|
|
|
# Texts
|
|
|
|
- *Discrete and Computational Geometry*, Devadoss
|
|
|
|
# Reading Notes
|
|
|
|
## *Devadoss*, 24 Jan 2014
|
|
|
|
Computational Geometry is *discrete* rather than *continuous*
|
|
|
|
Fundamental building blocks are the *point* and line *segment*.
|
|
|
|
*polygon*
|
|
: the closed region of the plane bounded by a finite collection of
|
|
line segments forming a closed curve that does not intersect
|
|
itself. The segments are called *edges* and the points where they meet
|
|
are *vertices*. The set of vertices and edges is the *boundary*.
|
|
|
|
**Theorem 1.1: Polygonal Jordan Curve**
|
|
:The boundary $\partial P$ of a polygon $P$ partitions the plane into
|
|
two parts. In particular, the two components of $\Bbb{R}^2\setminus
|
|
\partial P$ are the bounded interior and the unbounded exterior.
|
|
|
|
A point $x$ is *interior* if a ray through it in a fixed direction not
|
|
parallel to an edge passes through an odd number of edges.
|
|
|
|
A point $x$ is *exterior* if a ray through it ... etc ... passes
|
|
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.
|