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

cite cdgp-icms-2014 in the SDG Linf doc

This commit is contained in:
Panagiotis Cheilaris 2015-02-03 22:03:13 +01:00
parent e217500791
commit 2d82e9d2c8
1 changed files with 3 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
Segment_Delaunay_graph_Linf_2/doc/Segment_Delaunay_graph_Linf_2/Segment_Delaunay_graph_Linf_2.txt
View File

@ -18,7 +18,7 @@ Delaunay graph algorithm and traits under the Euclidean (or \f$ L_{2} \f$)
distance.
Segment Voronoi diagrams in the \f$ L_{\infty} \f$ metric have applications
in VLSI design \cite pl-svdlinf-2001.
in VLSI design \cite pl-svdlinf-2001, \cite cdgp-icms-2014.
In Section \ref secsdglinfdefinitions we give some definitions.
In Section \ref secsdglinfdesign we explain the design of the
@ -53,7 +53,7 @@ the input sites are rational, then the coordinates of the vertices of
the diagram are also rational, which is not true for the
\f$ L_{2} \f$ diagram.
For more details on \f$ L_{\infty} \f$ bisectors and the diagram,
see \cite pl-svdlinf-2001.
see \cite cdgp-icms-2014.
\cgalFigureBegin{figbislinf,bislinf.svg}
The \f$ L_{\infty} \f$ bisectors between two points and
@ -105,6 +105,7 @@ subclasses of corresponding \f$ L_{2} \f$ classes from the
package \ref PkgSegmentDelaunayGraph2Summary.
The names of the \f$ L_{\infty} \f$ classes contain an additional `_Linf` after
`graph`, in comparison with the corresponding \f$ L_{2} \f$ classes.
For more details, see \cite cdgp-icms-2014.
The order of complexity of the construction of the \f$ L_{\infty}
\f$ diagram is the same as the one of the \f$ L_{2} \f$ diagram