From 7d93823e165f32c5dcb7e440aa7dfe8f801fb140 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= Date: Thu, 14 Jan 2010 10:16:17 +0000 Subject: [PATCH] typos --- .../doc_tex/Segment_Delaunay_graph_2/Sdg_2.tex | 6 +++--- .../doc_tex/Segment_Delaunay_graph_2/Sdg_2_examples.tex | 2 +- 2 files changed, 4 insertions(+), 4 deletions(-) diff --git a/Segment_Delaunay_graph_2/doc_tex/Segment_Delaunay_graph_2/Sdg_2.tex b/Segment_Delaunay_graph_2/doc_tex/Segment_Delaunay_graph_2/Sdg_2.tex index 0ff7450d347..87910ee24f7 100644 --- a/Segment_Delaunay_graph_2/doc_tex/Segment_Delaunay_graph_2/Sdg_2.tex +++ b/Segment_Delaunay_graph_2/doc_tex/Segment_Delaunay_graph_2/Sdg_2.tex @@ -117,7 +117,7 @@ diagram are one-dimensional and that all Voronoi cells are simply connected. Moreover, we further distinguish between two cases, according to the type of intersecting pair that our input data set contains. A pair of sites is called \emph{weakly intersecting} if they -a single common point and this common point does not lie in the +have a single common point and this common point does not lie in the interior of any of the two sites. A pair of sites is called \emph{strongly intersecting} if they intersect and they either have more than one common point or their common point lies in the interior @@ -284,12 +284,12 @@ boolean is equal to \ccc{true}. The segment $s_1q_1$ will also be represented by two segments, a point, and a boolean, namely, $t_1$ (the supporting segment of $s_1q_1$), $t_2$ and \ccc{false} (it is the second endpoint of $s_1q_1$ that is an input point). Subsegments -$p_2s_2$ and $s_2q_2$ are represented analogously. +$p_2s_1$ and $s_1q_2$ are represented analogously. Consider now what happens when we insert $t_3$. The point $s_2$ will again be represented by two segments, but not $s_1q_1$ and $t_3$. In fact, it will be represented by $t_1$ (the supporting segment of $s_1q_1$) and $t_3$. $s_2q_1$ will be represented -by two segments, a point, and a boolean ($t_1$, $t_3$ and +by two segments, a point, and a boolean ($t_1$, $t_3$, $q1$ and \ccc{false}), and similarly for $p_3s_2$ and $s_2q_3$. On the other hand, both endpoints of $s_1s_2$ are non-input points. In such a case we represent the segment by three input segments. diff --git a/Segment_Delaunay_graph_2/doc_tex/Segment_Delaunay_graph_2/Sdg_2_examples.tex b/Segment_Delaunay_graph_2/doc_tex/Segment_Delaunay_graph_2/Sdg_2_examples.tex index 9783c036085..7656f8f686b 100644 --- a/Segment_Delaunay_graph_2/doc_tex/Segment_Delaunay_graph_2/Sdg_2_examples.tex +++ b/Segment_Delaunay_graph_2/doc_tex/Segment_Delaunay_graph_2/Sdg_2_examples.tex @@ -21,7 +21,7 @@ \subsection{First Example} -The following example shows to use the segment Delaunay graph traits +The following example shows how to use the segment Delaunay graph traits in conjunction with the \ccc{Filtered_exact} mechanism. In addition it shows how to use a few of the iterators provided by the \ccc{Segment_Delaunay_graph_2} class in order to count a few