Doc ref fix

ChangeLog.md

@@ -54,6 +54,10 @@
     (Mohamad ONAYSSI, Bibiana MARTINEZ, Mohamed MELLOULI, Kacper PLUTA,
     [#1199](https://github.com/DGtal-team/DGtal/pull/1199))
 
+- *Documentation*
+ - Fixing various bib references.
+   (Bertrand Kerautret, [##1237](https://github.com/DGtal-team/DGtal/pull/1237))
+
 # DGtal 0.9.2
 
 ## New Features / Critical Changes

src/DGtal/doc/global.bib

@@ -655,6 +655,33 @@ @Article{Debled_1995_ijprai
   pages =	 {635-662}
 }
 
+
+@inproceedings{Lachaud:1998-icip,
+	title = {Digital surfaces as a basis for building isosurfaces},
+	volume = {2},
+	doi = {10.1109/ICIP.1998.723717},
+	booktitle = {Proceedings 1998 {International} {Conference} on {Image} {Processing}. {ICIP}98},
+	author = {Lachaud, J. O. and Montanvert, A.},
+	month = oct,
+	year = {1998},
+	pages = {977--981 vol.2}
+}
+
+@article{Lachaud:2000-gmod,
+	title = {Continuous {Analogs} of {Digital} {Boundaries}: {A} {Topological} {Approach} to {Iso}-{Surfaces}},
+	volume = {62},
+	issn = {1524-0703},
+	shorttitle = {Continuous {Analogs} of {Digital} {Boundaries}},
+	url = {//www.sciencedirect.com/science/article/pii/S1524070300905228},
+	doi = {10.1006/gmod.2000.0522},
+	number = {3},
+	urldate = {2017-01-24},
+	journal = {Graphical Models},
+	author = {Lachaud, Jacques-Olivier and Montanvert, Annick},
+	month = may,
+	year = {2000},
+	pages = {129--164}
+}
 @inproceedings{Charrier_2008_dgci,
 author={E. Charrier and L. Buzer},
 title={An efficient and quasi-linear worst-case time algorithm for digital plane recognition},
@@ -803,6 +830,22 @@ @article{Gerard_2005_dam
 keywords = "Linear programming "
 }
 
+@article{Bertrand:1994,
+	title = {A new characterization of three-dimensional simple points},
+	volume = {15},
+	issn = {0167-8655},
+	url = {http://www.sciencedirect.com/science/article/pii/0167865594900469},
+	doi = {10.1016/0167-8655(94)90046-9},
+	number = {2},
+	urldate = {2017-01-24},
+	journal = {Pattern Recognition Letters},
+	author = {Bertrand, Gilles and Malandain, Grégoire},
+	month = feb,
+	year = {1994},
+	keywords = {digital topology, Simple points, thinning algorithms, three dimensions},
+	pages = {169--175}
+}
+
 @InBook{Bertrand2007a,
   author = 	 {G. Bertrand and M. Couprie},
   editor = 	 {D. Coeurjolly and A. Montanvert and J.-M. Chassery},

src/DGtal/doc/moduleBuildDGtal.dox

@@ -67,8 +67,12 @@ package name and versions.
 
 An important feature of cmake is the "out-of-source" build
 process. Let us suppose that DGtal sources are in the DGTALSOURCES
-folder. Hence, in a terminal you can create a build folder: @code cd
-DGTALSOURCES mkdir build cd build @endcode
+folder. Hence, in a terminal you can create a build folder:
+@code
+cd DGTALSOURCES
+mkdir build
+cd build
+@endcode
 
 Next, use the cmake command to generate your Unix Makefile project
 (default generator on Unix/Linux) like below for the minimal DGtal configuration:
@@ -146,7 +150,7 @@ tools with recent Visual Studio target. During the project generation,
 you would have to specify the path to @e boost headers (or paths
 needed for any optional dependency such as GMP, CGAL, Cairo...).
 
-@note Do not forget to set @e BUILD_SHARED_LIBS cmake to falqse (static DGtal lib target).
+@note Do not forget to set @e BUILD_SHARED_LIBS cmake to false (static DGtal lib target).
 
 
 @advanced When working on DGtal within github, we have set up a Windows

src/DGtal/topology/doc/moduleDigitalSurfaces.dox

@@ -499,12 +499,11 @@ We have shown before that a digital surface has a dual structure
 that is the graph whose vertices are n-1-cells and whose arcs are
 (almost) n-2-cells. We can go further and use n-3-cells to define
 faces on this graph. This is related to the concept of \b umbrellas
-in 3D (see [Françon]). More precisely, given a start surfel, an
+in 3D (see \cite papier1998). More precisely, given a start surfel, an
 incident n-2-cell (the separator) and an incident n-3-cell (the
 pivot), one can turn around the pivot progressively to get a
 face. This gives precisely in 3D the dual to a digital surface that
-is a kind of marching-cube surface (see [Lachaud:1998-icip,
-Lachaud:2000-gmod]).
+is a kind of marching-cube surface (see \cite Lachaud:1998-icip, \cite Lachaud:2000-gmod).
 
 The main class for computing umbrellas is the class
 UmbrellaComputer.  Turning around the pivot means moving the face

src/DGtal/topology/doc/moduleDigitalTopology.dox

@@ -342,7 +342,7 @@ see example: <a href="3dBorderExtractionImg_8cpp-example.html"> 3dBorderExtracti
 
    A basic mechanism for simple points is implemented in the Object
    class. It relies on the well-known definition of simple points of
-   [Bertrand:1994], based on the number of connected components in a
+   \cite Bertrand:1994 , based on the number of connected components in a
    geodesic neighborhood of the point. It is valid in 2D and 3D. It
    should not be sufficient in nD, since toric connected components
    may appear. However, you can use it anyway as a kind of