32 #ifndef ADVANCED_FRONT_H
33 #define ADVANCED_FRONT_H
35 #include "../common/shapes.h"
51 Node(
Point& p) : point(&p), triangle(NULL), next(NULL), prev(NULL), value(p.x)
55 Node(
Point& p,
Triangle& t) : point(&p), triangle(&t), next(NULL), prev(NULL), value(p.x)
70 void set_head(
Node* node);
72 void set_tail(
Node* node);
74 void set_search(
Node* node);
83 Node* head_, *tail_, *search_node_;
85 Node* FindSearchNode(
double x);
88 inline Node* AdvancingFront::head()
92 inline void AdvancingFront::set_head(Node* node)
97 inline Node* AdvancingFront::tail()
101 inline void AdvancingFront::set_tail(Node* node)
106 inline Node* AdvancingFront::search()
111 inline void AdvancingFront::set_search(Node* node)
Definition: advancing_front.h:62
Node * LocateNode(double x)
Locate insertion point along advancing front.
Definition: advancing_front.cpp:44
Sweep-line, Constrained Delauney Triangulation (CDT) See: Domiter, V.
Definition: shapes.cpp:36
Definition: advancing_front.h:42