From 6f60be121bf6f3ec8b4964e8779fb99849924db4 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= Date: Thu, 24 Jan 2013 08:56:09 +0100 Subject: [PATCH] fix wrong figure ref --- .../doc/TDS_2/Concepts/TriangulationDataStructure_2.h | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/Triangulation_2/doc/TDS_2/Concepts/TriangulationDataStructure_2.h b/Triangulation_2/doc/TDS_2/Concepts/TriangulationDataStructure_2.h index 1f3c21f0f62..0e256531d50 100644 --- a/Triangulation_2/doc/TDS_2/Concepts/TriangulationDataStructure_2.h +++ b/Triangulation_2/doc/TDS_2/Concepts/TriangulationDataStructure_2.h @@ -30,7 +30,7 @@ is opposite to the vertex with the same index. Each edge has two implicit representations : the edge of a face `f` which is opposed to the vertex indexed `i`, can be represented as well as an edge of the `neighbor(i)` of -`f`. See Figure \ref Triangulation_2D_Fig_neighbors1 +`f`. See Figure \ref fig__TDS_2D_Fig_neighbors1. The triangulation data structure is responsible for the combinatorial integrity of the triangulation.