ObjectArx 基于循环链表实现的SimplePolygon

枫叶棋语

2. #pragma once
   
3. #include <vector>
   
4. // AutoCAD几何头文件
   
5. #include <gepnt2d.h>
   
6. #include <gevec2d.h>
   
7. #include <gelnsg2d.h>
   
8. #include <CgalDef.h>
   
9. #include <looplist.h>
   
10. #include <gepnt3d.h>
    
11. #include <dbpl.h>
    
12. #include <getol.h>
    
13. #include <type_traits>
    
14. #include <utility>
    
15. 
    
16. 
    
17. 
    
18. // ======================
    
19. // AutoCAD兼容类型转换 ,使用LoopList 双向链表快速进行节点删增操作
    
20. // ======================
    
21. 
    
22. class VertexData {
    
23. public:
    
24.   union {
    
25.     struct {
    
26.       double x;
    
27.       double y;
    
28.     };
    
29.     AcGePoint2d cadPoint;
    
30.     CgalPoint2d cgalPoint;
    
31.   };
    
32.   // 最简单的构造函数
    
33.   VertexData(const VertexData& other) :x(other.x), y(other.y) {}
    
34.   VertexData(const AcGePoint2d& p) : cadPoint(p) {}
    
35.   VertexData(const CgalPoint2d& p) : cgalPoint(p) {}
    
36.   VertexData(double x, double y) :x(x), y(y) {}
    
37.   // 隐式转换,自动转换类型
    
38.   operator const AcGePoint2d& () const { return cadPoint; }
    
39.   operator const CgalPoint2d& () const { return cgalPoint; }
    
40.   operator const AcGePoint3d& () const { return { x,y,0 }; }
    
41.   // 基本操作
    
42.   void setPoint(const AcGePoint2d& p) { cadPoint = p; }
    
43.   void setPoint(const CgalPoint2d& p) { cgalPoint = p; }
    
44. 
    
45.   bool operator==(const VertexData& other) const {
    
46.     return cadPoint.isEqualTo(other.cadPoint, { 1e-5,1e-5 });
    
47.   }
    
48.   bool operator < (const VertexData& other) const {
    
49.     if (x == other.x) {
    
50.       return  y < other.y;
    
51.     }
    
52.     return x < other.x;
    
53.   }
    
54.   AcGeVector2d  operator - (const VertexData& other)  const {
    
55.     return this->cadPoint - other.cadPoint;
    
56.   }
    
57. };
    
58. 
    
59. class SimplePolygon : public LoopList<VertexData> {
    
60. private:
    
61.   bool m_isclockwise = false;
    
62.   // 多边形处理函数
    
63.   void ensureLockWise(bool clockwise = true);
    
64.   bool isSelfIntersected() const;
    
65.   void removeCollinearVertices(AcGeTol tol = { 1e-5,1e-5 });
    
66. 
    
67.   template<typename ResultType>
    
68.   std::vector<ResultType>  convertSegments() const;
    
69. 
    
70. public:
    
71.   SimplePolygon() = default;
    
72.   SimplePolygon(AcDbPolyline* polyline, bool isclockwise = false);
    
73.   template <typename Container>
    
74.   SimplePolygon(const Container& points, bool isclockwise = false);
    
75. 
    
76.   bool isValid();
    
77.   CgalPolygon2d toCgalPolygon2d() const;
    
78.   auto toCgalLines() const { return convertSegments<CgalSegment2d>(); }
    
79.   auto toCadLines() const { return convertSegments<AcGeLineSeg2d>(); }
    
80.   auto toCgalPointPairs() const { return convertSegments<std::pair<CgalPoint2d, CgalPoint2d>>(); }
    
81.   auto toCadPointPairs() const { return convertSegments<std::pair<AcGePoint2d, AcGePoint2d>>(); }
    
82. 
    
83. };
    
84. 
    
85. // 构造函数
    
86. inline SimplePolygon::SimplePolygon(AcDbPolyline* polyline, bool isclockwise) : m_isclockwise(isclockwise) {
    
87.   if (!polyline) return;
    
88.   AcGePoint2d pnt;
    
89.   for (uint i = 0; i < polyline->numVerts(); ++i) {
    
90.     polyline->getPointAt(i, pnt);
    
91.     push_back(VertexData(pnt));
    
92.   }
    
93.   this->uniqueAdjacent();
    
94.   this->removeCollinearVertices();
    
95.   ensureLockWise(m_isclockwise);
    
96. 
    
97. }
    
98. // 容器转换
    
99. template<typename Container>
    
100. inline SimplePolygon::SimplePolygon(const Container& points, bool)
     
101. {
     
102.   static_assert(
     
103.     std::is_same_v<typename Container::value_type, AcGePoint2d>,
     
104.     "Container must contain AcGePoint2d"
     
105.     );
     
106.   for (const auto& pnt : points) {
     
107.     push_back(VertexData(pnt));
     
108.   }
     
109.   this->uniqueAdjacent();
     
110.   this->removeCollinearVertices();
     
111.   ensureLockWise(m_isclockwise);
     
112. }
     
113. 
     
114. // 确保多边形方向
     
115. inline void SimplePolygon::ensureLockWise(bool clockwise) {
     
116.   if (size() < 3) return;
     
117. 
     
118.   double area = 0.0;
     
119.   auto* current = front();
     
120.   auto* next = current->next;
     
121. 
     
122.   do {
     
123.     const auto& pt1 = current->data;
     
124.     const auto& pt2 = next->data;
     
125.     area += (pt2.x - pt1.x) * (pt2.y + pt1.y);
     
126.     current = next;
     
127.     next = next->next;
     
128. 
     
129.   } while (current != front());
     
130. 
     
131.   bool isCurrentlyClockwise = area > 0;
     
132.   if (isCurrentlyClockwise != clockwise) {
     
133.     reverse();
     
134.   }
     
135.   m_isclockwise = clockwise;
     
136. }
     
137. 
     
138. //移除共线点
     
139. inline void SimplePolygon::removeCollinearVertices(AcGeTol tol) {
     
140.   acutPrintf(L"移除共线点开始，原始length = %d", length);
     
141. 
     
142.   if (length < 3) return;
     
143. 
     
144.   Node* start = front()->next; // 从第二个节点开始操作
     
145.   Node* current = start;
     
146.   int process = 0;
     
147.   do {
     
148.     Node* prev = current->prev;
     
149.     Node* next = current->next;
     
150. 
     
151.     // 计算方向向量（修正向量方向）
     
152.     AcGeVector2d v1 = current->data - prev->data;
     
153.     AcGeVector2d v2 = next->data - current->data;
     
154. 
     
155.     if (v1.isParallelTo(v2, tol)) {
     
156.       Node* toRemove = current;
     
157.       current = next; // 先移动到下一节点
     
158.       removeNode(toRemove);
     
159.       continue;
     
160.     }
     
161. 
     
162.     current = next;
     
163.     process++;
     
164. 
     
165.   } while (length > 2 && process < length + 1);
     
166.   acutPrintf(L"移除共线点结束，还剩length = %d", length);
     
167. 
     
168. }
     
169. 
     
170. // 检查自相交，偷个懒，直接调用CGAL 方法
     
171. inline bool SimplePolygon::isSelfIntersected() const {
     
172.   if (length < 4) return false;
     
173.   // 转换为CGAL多边形
     
174.   auto cgalPoly = toCgalPolygon2d();
     
175.   return cgalPoly.is_simple() == false;
     
176. }
     
177. 
     
178. 
     
179. // 判断是否符合条件
     
180. inline bool SimplePolygon::isValid() {
     
181.   if (size() < 3) return false;
     
182.   if (isSelfIntersected()) return false;
     
183.   return true;
     
184. }
     
185. 
     
186. 
     
187. //获取边
     
188. template<typename ResultType>
     
189. inline std::vector<ResultType> SimplePolygon::convertSegments() const {
     
190.   std::vector<ResultType> result;
     
191. 
     
192.   if (length < 2) return result;
     
193.   if (length == 2) {
     
194.     result.reserve(1);
     
195.     result.emplace_back(head->data, head->next->data);
     
196.     return result;
     
197.   }
     
198.   result.reserve(length);
     
199.   auto* current = head;
     
200.   do {
     
201.     result.emplace_back(current->data, current->next->data);
     
202.     current = current->next;
     
203.   } while (current != head);
     
204. 
     
205.   return result;
     
206. }
     
207. 
     
208. //转换为CGAL Polygon2d
     
209. inline CgalPolygon2d SimplePolygon::toCgalPolygon2d() const
     
210. {
     
211.   const std::vector<VertexData>& cadPoints = toVector();
     
212.   return CgalPolygon2d(cadPoints.begin(), cadPoints.end());
     
213. }
     
214. 
     

#pragma once<br /> #include <vector><br /> // <a href="http://bbs.mjtd.com/forum-41-1.html" target="_blank" class="relatedlink">AutoCAD</a>几何头文件<br /> #include <gepnt2d.h><br /> #include <gevec2d.h><br /> #include <gelnsg2d.h><br /> #include <CgalDef.h><br /> #include <looplist.h><br /> #include <gepnt3d.h><br /> #include <dbpl.h><br /> #include <getol.h><br /> #include <type_traits><br /> #include <utility><br /> <br /> <br /> <br /> // ======================<br /> // AutoCAD兼容类型转换 ,使用LoopList 双向链表快速进行节点删增操作<br /> // ======================<br /> <br /> class VertexData {<br /> public:<br />   union {<br />     struct {<br />       double x;<br />       double y;<br />     };<br />     AcGePoint2d cadPoint;<br />     CgalPoint2d cgalPoint;<br />   };<br />   // 最简单的构造函数 <br />   VertexData(const VertexData& other) :x(other.x), y(other.y) {}<br />   VertexData(const AcGePoint2d& p) : cadPoint(p) {}<br />   VertexData(const CgalPoint2d& p) : cgalPoint(p) {}<br />   VertexData(double x, double y) :x(x), y(y) {}<br />   // 隐式转换,自动转换类型<br />   operator const AcGePoint2d& () const { return cadPoint; }<br />   operator const CgalPoint2d& () const { return cgalPoint; }<br />   operator const AcGePoint3d& () const { return { x,y,0 }; }<br />   // 基本操作 <br />   void setPoint(const AcGePoint2d& p) { cadPoint = p; }<br />   void setPoint(const CgalPoint2d& p) { cgalPoint = p; }<br /> <br />   bool operator==(const VertexData& other) const {<br />     return cadPoint.isEqualTo(other.cadPoint, { 1e-5,1e-5 });<br />   }<br />   bool operator < (const VertexData& other) const {<br />     if (x == other.x) {<br />       return  y < other.y;<br />     }<br />     return x < other.x;<br />   }<br />   AcGeVector2d  operator - (const VertexData& other)  const {<br />     return this->cadPoint - other.cadPoint;<br />   }<br /> };<br /> <br /> class SimplePolygon : public LoopList<VertexData> {<br /> private:<br />   bool m_isclockwise = false;<br />   // 多边形处理函数 <br />   void ensureLockWise(bool clockwise = true);<br />   bool isSelfIntersected() const;<br />   void removeCollinearVertices(AcGeTol tol = { 1e-5,1e-5 });<br /> <br />   template<typename ResultType><br />   std::vector<ResultType>  convertSegments() const;<br /> <br /> public:<br />   SimplePolygon() = default;<br />   SimplePolygon(AcDbPolyline* polyline, bool isclockwise = false);<br />   template <typename Container><br />   SimplePolygon(const Container& points, bool isclockwise = false);<br /> <br />   bool isValid();<br />   CgalPolygon2d toCgalPolygon2d() const;<br />   auto toCgalLines() const { return convertSegments<CgalSegment2d>(); }<br />   auto toCadLines() const { return convertSegments<AcGeLineSeg2d>(); }<br />   auto toCgalPointPairs() const { return convertSegments<std::pair<CgalPoint2d, CgalPoint2d>>(); }<br />   auto toCadPointPairs() const { return convertSegments<std::pair<AcGePoint2d, AcGePoint2d>>(); }<br /> <br /> };<br /> <br /> // 构造函数 <br /> inline SimplePolygon::SimplePolygon(AcDbPolyline* polyline, bool isclockwise) : m_isclockwise(isclockwise) {<br />   if (!polyline) return;<br />   AcGePoint2d pnt;<br />   for (uint i = 0; i < polyline->numVerts(); ++i) {<br />     polyline->getPointAt(i, pnt);<br />     push_back(VertexData(pnt));<br />   }<br />   this->uniqueAdjacent();<br />   this->removeCollinearVertices();<br />   ensureLockWise(m_isclockwise);<br /> <br /> }<br /> // 容器转换<br /> template<typename Container><br /> inline SimplePolygon::SimplePolygon(const Container& points, bool)<br /> {<br />   static_assert(<br />     std::is_same_v<typename Container::value_type, AcGePoint2d>,<br />     "Container must contain AcGePoint2d"<br />     );<br />   for (const auto& pnt : points) {<br />     push_back(VertexData(pnt));<br />   }<br />   this->uniqueAdjacent();<br />   this->removeCollinearVertices();<br />   ensureLockWise(m_isclockwise);<br /> }<br /> <br /> // 确保多边形方向 <br /> inline void SimplePolygon::ensureLockWise(bool clockwise) {<br />   if (size() < 3) return;<br /> <br />   double area = 0.0;<br />   auto* current = front();<br />   auto* next = current->next;<br /> <br />   do {<br />     const auto& pt1 = current->data;<br />     const auto& pt2 = next->data;<br />     area += (pt2.x - pt1.x) * (pt2.y + pt1.y);<br />     current = next;<br />     next = next->next;<br /> <br />   } while (current != front());<br /> <br />   bool isCurrentlyClockwise = area > 0;<br />   if (isCurrentlyClockwise != clockwise) {<br />     reverse();<br />   }<br />   m_isclockwise = clockwise;<br /> }<br /> <br /> //移除共线点<br /> inline void SimplePolygon::removeCollinearVertices(AcGeTol tol) {<br />   acutPrintf(L"移除共线点开始，原始length = %d", length);<br /> <br />   if (length < 3) return;<br /> <br />   Node* start = front()->next; // 从第二个节点开始操作 <br />   Node* current = start;<br />   int process = 0;<br />   do {<br />     Node* prev = current->prev;<br />     Node* next = current->next;<br /> <br />     // 计算方向向量（修正向量方向）<br />     AcGeVector2d v1 = current->data - prev->data;<br />     AcGeVector2d v2 = next->data - current->data;<br /> <br />     if (v1.isParallelTo(v2, tol)) {<br />       Node* toRemove = current;<br />       current = next; // 先移动到下一节点 <br />       removeNode(toRemove);<br />       continue;<br />     }<br /> <br />     current = next;<br />     process++;<br /> <br />   } while (length > 2 && process < length + 1);<br />   acutPrintf(L"移除共线点结束，还剩length = %d", length);<br /> <br /> }<br /> <br /> // 检查自相交，偷个懒，直接调用CGAL 方法<br /> inline bool SimplePolygon::isSelfIntersected() const {<br />   if (length < 4) return false;<br />   // 转换为CGAL多边形 <br />   auto cgalPoly = toCgalPolygon2d();<br />   return cgalPoly.is_simple() == false;<br /> }<br /> <br /> <br /> // 判断是否符合条件<br /> inline bool SimplePolygon::isValid() {<br />   if (size() < 3) return false;<br />   if (isSelfIntersected()) return false;<br />   return true;<br /> }<br /> <br /> <br /> //获取边<br /> template<typename ResultType><br /> inline std::vector<ResultType> SimplePolygon::convertSegments() const {<br />   std::vector<ResultType> result;<br /> <br />   if (length < 2) return result;<br />   if (length == 2) {<br />     result.reserve(1);<br />     result.emplace_back(head->data, head->next->data);<br />     return result;<br />   }<br />   result.reserve(length);<br />   auto* current = head;<br />   do {<br />     result.emplace_back(current->data, current->next->data);<br />     current = current->next;<br />   } while (current != head);<br /> <br />   return result;<br /> }<br /> <br /> //转换为CGAL Polygon2d<br /> inline CgalPolygon2d SimplePolygon::toCgalPolygon2d() const<br /> {<br />   const std::vector<VertexData>& cadPoints = toVector();<br />   return CgalPolygon2d(cadPoints.begin(), cadPoints.end());<br /> }<br /> <br />

代码包括判断是否自相交，回环方向，获取边以及兼容CAD 和 CGAL 的二维坐标隐式转换，可以接入CGAL 的应用