From 8b5d9218d5efec5ec4fdff431bd0692f626ea836 Mon Sep 17 00:00:00 2001 From: Pineal Servo Date: Fri, 24 Jan 2014 21:44:35 -0700 Subject: [PATCH] An un-summarized change. --- math/computational_geometry/notes.page | 30 ++++++++++++++++++++++++++ 1 file changed, 30 insertions(+) create mode 100644 math/computational_geometry/notes.page diff --git a/math/computational_geometry/notes.page b/math/computational_geometry/notes.page new file mode 100644 index 0000000..284d925 --- /dev/null +++ b/math/computational_geometry/notes.page @@ -0,0 +1,30 @@ +--- +format: markdown +toc: yes +title: Computational Geometry Study Notes +... + +# Texts + +- *Discrete and Computational Geometry* + +# 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. + + +