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

Added \cite

This commit is contained in:
Andreas Fabri 2003-10-21 13:37:21 +00:00
parent ce04232eec
commit 3c2b839dc3
2 changed files with 12 additions and 10 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

11
Packages/Interval_skip_list/doc_tex/Interval_skip_list_ref/intro.tex
View File

@ -49,9 +49,10 @@
%\section{Reference Pages for Interval Skip List}
\chapter{Interval Skip List}
\label{chap:interval_skip_list_ref}
This chapter presents the interval skip list introduced by Hanson~\cite{},
and derived from the skip list data structure~\cite{}.
This chapter presents the interval skip list introduced by Hanson~\cite{h-islds-91},
and derived from the skip list data structure~\cite{p-slpab-90}.
The data structure stores intervals and allows to perform stabbing queries,
that is to test wether a point is covered by any of the intervals.
@ -60,14 +61,14 @@ It further allows to find all intervals that contain a point.
The interval skip list is, as far as its functionality is concerned,
related to the \ccc{Segment_tree}. Both allow to do stabbing queries
and both allow to find all intervals that contain a given point. The
implementation of segment trees in {\sc Cgal} works in higher
implementation of segment trees in \cgal\ works in higher
dimensions, whereas the interval skip list is limited to the 1D
case. However, this interval skip list implementation is fully
dynamic, whereas the segment tree implementation in {\sc Cgal} is
dynamic, whereas the segment tree implementation in \cgal\ is
static, that is all intervals must be known in advance.
This package has one concept, namely for the interval with which
the interval skip list lass is parameterized.
the interval skip list class is parameterized.
\subsection*{Concepts}

11
Packages/Interval_skip_list/doc_tex/basic/Interval_skip_list_ref/intro.tex
View File

@ -49,9 +49,10 @@
%\section{Reference Pages for Interval Skip List}
\chapter{Interval Skip List}
\label{chap:interval_skip_list_ref}
This chapter presents the interval skip list introduced by Hanson~\cite{},
and derived from the skip list data structure~\cite{}.
This chapter presents the interval skip list introduced by Hanson~\cite{h-islds-91},
and derived from the skip list data structure~\cite{p-slpab-90}.
The data structure stores intervals and allows to perform stabbing queries,
that is to test wether a point is covered by any of the intervals.
@ -60,14 +61,14 @@ It further allows to find all intervals that contain a point.
The interval skip list is, as far as its functionality is concerned,
related to the \ccc{Segment_tree}. Both allow to do stabbing queries
and both allow to find all intervals that contain a given point. The
implementation of segment trees in {\sc Cgal} works in higher
implementation of segment trees in \cgal\ works in higher
dimensions, whereas the interval skip list is limited to the 1D
case. However, this interval skip list implementation is fully
dynamic, whereas the segment tree implementation in {\sc Cgal} is
dynamic, whereas the segment tree implementation in \cgal\ is
static, that is all intervals must be known in advance.
This package has one concept, namely for the interval with which
the interval skip list lass is parameterized.
the interval skip list class is parameterized.
\subsection*{Concepts}