Moka libraries
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros
corefine-2d-tools.hh
Go to the documentation of this file.
1 /*
2  * lib-corefinement : Opérations de corafinement.
3  * Copyright (C) 2004, Moka Team, Université de Poitiers, Laboratoire SIC
4  * http://www.sic.sp2mi.univ-poitiers.fr/
5  * Copyright (C) 2009, Guillaume Damiand, CNRS, LIRIS,
6  * guillaume.damiand@liris.cnrs.fr, http://liris.cnrs.fr/
7  *
8  * This file is part of lib-corefinement
9  *
10  * This program is free software: you can redistribute it and/or modify
11  * it under the terms of the GNU Lesser General Public License as published by
12  * the Free Software Foundation, either version 3 of the License, or
13  * (at your option) any later version.
14  *
15  * This program is distributed in the hope that it will be useful,
16  * but WITHOUT ANY WARRANTY; without even the implied warranty of
17  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
18  * GNU Lesser General Public License for more details.
19  *
20  * You should have received a copy of the GNU Lesser General Public License
21  * along with this program. If not, see <http://www.gnu.org/licenses/>.
22  */
23 
24 #ifndef COREFINE_2D_TOOLS_HH
25 #define COREFINE_2D_TOOLS_HH
26 
27 #include <bitset>
28 #include "general-tools.hh"
29 #include "edge-intersection.hh"
30 
31 class CBoundingBox;
32 
33 namespace GMap3d {
34 
35  class CCorefine2dTools : public CGeneralTools
36  {
37  public:
38 
39  CCorefine2dTools(CGMapVertex * AMap, TCoordinate AEpsilon = 1E-4);
40 
41  bool isVectorInSector(const CVertex & AVector,
42  const CVertex & ASectorVector1,
43  const CVertex & ASectorVector2);
44 
45  bool isVectorInSector(const CVertex & AVector, CDart * ASector,
46  int AVertexDI = -1);
47 
48  virtual bool areVectorsColinear(const CVertex & AVector1,
49  const CVertex & AVector2);
50 
51  virtual TCoordinate pointParameterOnLine(const CVertex & APoint,
52  const CVertex & ALineVertex1,
53  const CVertex & ALineVertex2);
54 
55  virtual CDart * findSectorOfVector(const CVertex & AVector, CDart * AVertex,
56  int AVertexDI = -1);
57 
58  std::list<CDart*> * sortVerticesEdges(CDart * AVertex1, CDart * AVertex2,
59  int AVertexDI = -1);
60 
61  std::list<CDart*> * sortMultipleVerticesEdges(CDart * AVertex1,
62  const std::list<CDart*> & AVertices,
63  int AVertexDI = -1);
64 
65  virtual CDart * findWellOrientedDart(CDart * AVertex, int AVertexDI = -1);
66 
67  virtual TPositionOnEdge localizePointOnEdge(const CVertex & APoint,
68  const CVertex & AVertex1,
69  const CVertex & AVertex2,
70  TCoordinate * AParam);
71 
72  virtual TPositionOnEdge localizeEdgesIntersection(const CVertex & ALinePoint1,
73  const CVertex & ALinePoint2,
74  const CVertex & AEdgePoint1,
75  const CVertex & AEdgePoint2,
76  TCoordinate * ALineParam,
77  TCoordinate * AEdgeParam);
78 
79  CEdgeIntersection findNearestIntersection(const CVertex & AVertex1,
80  const CVertex & AVertex2,
81  CDart * AFace,
82  bool AFaceIsVertex1,
83  int AVertexDI = -1);
84 
85  CDart * localizePointInMesh(const CVertex & APoint, CDart * AMesh,
86  int AVertexDI = -1);
87 
88  void removeDoubleEdges(CDart *& AMesh1, CDart *& AMesh2, std::bitset<NB_MARKS> ACopyMarks, int AVertexDI = -1);
89 
90  protected:
91  };
92 
93 } // namespace GMap3d
94 
95 #endif