From 3169b235285337e3b48eb8f5c8e0862c1a04ed90 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 24 Apr 2014 14:56:33 +0200
Subject: [PATCH] doc fix: use cgalExample macro

---
 AABB_tree/doc/AABB_tree/aabb_tree.txt | 10 +++++-----
 Polygon/doc/Polygon/Polygon.txt       |  6 +++---
 2 files changed, 8 insertions(+), 8 deletions(-)

diff --git a/AABB_tree/doc/AABB_tree/aabb_tree.txt b/AABB_tree/doc/AABB_tree/aabb_tree.txt
index 6e01df094ff..805b41e2aee 100644
--- a/AABB_tree/doc/AABB_tree/aabb_tree.txt
+++ b/AABB_tree/doc/AABB_tree/aabb_tree.txt
@@ -123,7 +123,7 @@ hence faster than computing all intersections. We also compute the
 first encountered intersection with a plane query, which is generally
 a segment.
 
-\include AABB_polyhedron_facet_intersection_example.cpp
+\cgalExample{AABB_tree/AABB_polyhedron_facet_intersection_example.cpp}
 
 \subsection aabb_tree_examples_3 Tree of Polyhedron Triangle Facets for Distance Queries
 
@@ -134,7 +134,7 @@ squared distance, the closest point as well as the closest point and
 primitive id. The latter returns a pair composed of a point and a face
 handle.
 
-\include AABB_polyhedron_facet_distance_example.cpp
+\cgalExample{AABB_tree/AABB_polyhedron_facet_distance_example.cpp}
 
 \subsection aabb_tree_examples_4 Tree of Segments for Intersection and Distance Queries
 
@@ -142,7 +142,7 @@ handle.
 AABB primitive wraps a segment as `datum` and an iterator in the
 list as `id`. We compute the number of intersections with plane
 and triangles queries, and the closest point from a point query.
-\include AABB_segment_3_example.cpp
+\cgalExample{AABB_tree/AABB_segment_3_example.cpp}
 
 \subsection aabb_tree_examples_5 Tree of Polyhedron Edge Segments for Intersection and Distance Queries
 
@@ -150,7 +150,7 @@ In the following example the AABB primitive wraps a halfedge handle as
 `id` and generates a 3D segment on the fly, each time its method
 `datum` is called. We compute the number of intersections with a
 triangle query and the closest point from a point query.
-\include AABB_polyhedron_edge_example.cpp
+\cgalExample{AABB_tree/AABB_polyhedron_edge_example.cpp}
 
 \subsection aabb_tree_examples_6 Incremental Insertion of Primitives
 
@@ -159,7 +159,7 @@ primitives, and will internally rebuild triggered by the first query,
 or because the user calls the `AABB_tree::build()` method.  The following
 example illustrates this for two polyhedral surfaces.
 
-\include AABB_insertion_example.cpp
+\cgalExample{AABB_tree/AABB_insertion_example.cpp}
 
 \subsection aabb_tree_examples_7 Trees of Custom Primitives
 
diff --git a/Polygon/doc/Polygon/Polygon.txt b/Polygon/doc/Polygon/Polygon.txt
index 0d1dc5a4262..4fd7e5956d8 100644
--- a/Polygon/doc/Polygon/Polygon.txt
+++ b/Polygon/doc/Polygon/Polygon.txt
@@ -44,7 +44,7 @@ twice or more, the result is computed each time anew.
 The following example creates a polygon and illustrates the usage of
 some member functions.
 
-\include Polygon.cpp
+\cgalExample{Polygon/Polygon.cpp}
 
 \cgalFigureBegin{polygon2_algo,pgn_algos.png}
 A polygon and some points
@@ -55,7 +55,7 @@ A polygon and some points
 The following example creates a polygon and illustrates the usage of
 some global functions that operate on sequences of points.
 
-\include polygon_algorithms.cpp
+\cgalExample{Polygon/polygon_algorithms.cpp}
 
 \subsection Polygons in 3D Space
 
@@ -68,7 +68,7 @@ In order to avoid an explixit projection on the \c xy plane, one can
 use the traits class `Projection_traits_xy_3` which is part of the 2D
 and 3D Linear Geometric %Kernel.
 
-\include projected_polygon.cpp
+\cgalExample{Polygon/projected_polygon.cpp}
 
 */