songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

idem

This commit is contained in:
Mariette Yvinec 2001-07-25 07:29:02 +00:00
parent 4eeb877e2a
commit e1aa0918c6
2 changed files with 4 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
Packages/Triangulation_2/doc_tex/Triangulation_2/triangulation_user.tex
View File

@ -582,6 +582,7 @@ of these points.
\subsection{Example : Voronoi Diagram}
\label{Subsection_2D_Triangulations_Voronoi}
\ccIndexMainItem{Voronoi diagram}
The following code computes the edges of Voronoi diagram
of a set of data points
and counts the number of finite edges and the number of rays
@ -594,6 +595,7 @@ of this diagram
\subsection{Description}
\label{Subsection_2D_Triangulations_Regular_Description}
\ccIndexMainItem{power diagram}
Let ${ PW} = \{(p_i, w_i), i = 1, \ldots , n \}$ be a set of
weighted points where each $p_i$ is a point and each $w_i$
is a scalar called the weight of point $p_i$.

2
Packages/Triangulation_2/doc_tex/basic/Triangulation_2/triangulation_user.tex
View File

@ -582,6 +582,7 @@ of these points.
\subsection{Example : Voronoi Diagram}
\label{Subsection_2D_Triangulations_Voronoi}
\ccIndexMainItem{Voronoi diagram}
The following code computes the edges of Voronoi diagram
of a set of data points
and counts the number of finite edges and the number of rays
@ -594,6 +595,7 @@ of this diagram
\subsection{Description}
\label{Subsection_2D_Triangulations_Regular_Description}
\ccIndexMainItem{power diagram}
Let ${ PW} = \{(p_i, w_i), i = 1, \ldots , n \}$ be a set of
weighted points where each $p_i$ is a point and each $w_i$
is a scalar called the weight of point $p_i$.