KiCad PCB EDA Suite
advancing_front.h
Go to the documentation of this file.
1 /*
2  * Poly2Tri Copyright (c) 2009-2010, Poly2Tri Contributors
3  * http://code.google.com/p/poly2tri/
4  *
5  * All rights reserved.
6  *
7  * Redistribution and use in source and binary forms, with or without modification,
8  * are permitted provided that the following conditions are met:
9  *
10  * * Redistributions of source code must retain the above copyright notice,
11  * this list of conditions and the following disclaimer.
12  * * Redistributions in binary form must reproduce the above copyright notice,
13  * this list of conditions and the following disclaimer in the documentation
14  * and/or other materials provided with the distribution.
15  * * Neither the name of Poly2Tri nor the names of its contributors may be
16  * used to endorse or promote products derived from this software without specific
17  * prior written permission.
18  *
19  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
20  * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
21  * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
22  * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
23  * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
24  * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
25  * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
26  * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
27  * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
28  * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
29  * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
30  */
31 
32 #ifndef ADVANCED_FRONT_H
33 #define ADVANCED_FRONT_H
34 
35 #include "../common/shapes.h"
36 
37 namespace p2t {
38 struct Node;
39 
40 // Advancing front node
41 struct Node
42 {
45 
48 
49  double value;
50 
51  Node( Point& p ) : point( &p ), triangle( NULL ), next( NULL ), prev( NULL ), value( p.x )
52  {
53  }
54 
55  Node( Point& p, Triangle& t ) : point( &p ), triangle( &t ), next( NULL ), prev( NULL ), value(
56  p.x )
57  {
58  }
59 };
60 
61 // Advancing front
63 {
64 public:
65 
67 // Destructor
69 
70  Node* head();
71  void set_head( Node* node );
72  Node* tail();
73  void set_tail( Node* node );
74  Node* search();
75  void set_search( Node* node );
76 
78  Node* LocateNode( const double& x );
79 
80  Node* LocatePoint( const Point* point );
81 
82 private:
83 
85 
86  Node* FindSearchNode( const double& x );
87 };
88 
90 {
91  return head_;
92 }
93 
94 
95 inline void AdvancingFront::set_head( Node* node )
96 {
97  head_ = node;
98 }
99 
100 
102 {
103  return tail_;
104 }
105 
106 
107 inline void AdvancingFront::set_tail( Node* node )
108 {
109  tail_ = node;
110 }
111 
112 
114 {
115  return search_node_;
116 }
117 
118 
119 inline void AdvancingFront::set_search( Node* node )
120 {
121  search_node_ = node;
122 }
123 }
124 
125 #endif
Node(Point &p)
Point * point
Node * LocatePoint(const Point *point)
void set_tail(Node *node)
AdvancingFront(Node &head, Node &tail)
Triangle * triangle
Node * LocateNode(const double &x)
Locate insertion point along advancing front.
void set_head(Node *node)
Node(Point &p, Triangle &t)
double value
Sweep-line, Constrained Delauney Triangulation (CDT) See: Domiter, V.
Definition: shapes.h:41
void set_search(Node *node)
Node * FindSearchNode(const double &x)