Computational Geometry Algorithms Library  1.0
Computational Geometry Algorithms Library Documentation
DCELHalfEdge.h
Go to the documentation of this file.
1 #include <iostream>
2 #include <bits/stdc++.h>
3 using namespace std;
4 
5 class DCELFace;
6 class DCELVertex;
7 
9 {
10 public:
11  DCELHalfEdge();
12  ~DCELHalfEdge();
13 
19  DCELHalfEdge* getPrev();
20  int meta;
21 };
22 
24 twin(NULL), next(NULL), face(NULL), origin(NULL), meta(0), helper(NULL)
25 {
26 }
27 
29 {
30 
31 }
33 
37 {
38  DCELHalfEdge* rval = twin->next->twin;
39 
40  while (rval->next != this) {
41  rval = rval->next->twin;
42  }
43 
44  return rval;
45 }
DCELHalfEdge * twin
Definition: DCELHalfEdge.h:14
DCELHalfEdge * next
Definition: DCELHalfEdge.h:15
DCELHalfEdge()
Definition: DCELHalfEdge.h:23
~DCELHalfEdge()
Definition: DCELHalfEdge.h:28
Definition: DCELFace.h:1
DCELVertex * origin
Definition: DCELHalfEdge.h:17
DCELFace * face
Definition: DCELHalfEdge.h:16
Definition: DCELVertex.h:2
DCELHalfEdge * getPrev()
Half Edges.
Definition: DCELHalfEdge.h:36
DCELVertex * helper
Definition: DCELHalfEdge.h:18
Definition: DCELHalfEdge.h:8
int meta
Definition: DCELHalfEdge.h:20