blob: d14f1d3db9d1196ccc1db29852f408170c6b2eba (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
|
//
// libavg - Media Playback Engine.
// Copyright (C) 2003-2014 Ulrich von Zadow
//
// This library is free software; you can redistribute it and/or
// modify it under the terms of the GNU Lesser General Public
// License as published by the Free Software Foundation; either
// version 2 of the License, or (at your option) any later version.
//
// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
// Lesser General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public
// License along with this library; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
//
// Current versions can be found at www.libavg.de
//
//
// Based on Poly2Tri algorithm.
// Poly2Tri Copyright (c) 2009-2010, Poly2Tri Contributors
// http://code.google.com/p/poly2tri/
//
#include "AdvancingFront.h"
namespace avg {
AdvancingFront::AdvancingFront(Node& head, Node& tail)
{
m_Head = &head;
m_Tail = &tail;
m_SearchNode = &head;
}
Node* AdvancingFront::locateNode(const double& x)
{
Node* node = m_SearchNode;
if (x < node->m_Value) {
while ((node = node->m_Prev) != NULL) {
if (x >= node->m_Value) {
m_SearchNode = node;
return node;
}
}
} else {
while ((node = node->m_Next) != NULL) {
if (x < node->m_Value) {
m_SearchNode = node->m_Prev;
return node->m_Prev;
}
}
}
return NULL;
}
Node* AdvancingFront::findSearchNode(const double& x)
{
// TO DO: implement BST index
return m_SearchNode;
}
Node* AdvancingFront::locatePoint(const Point* point)
{
const double px = point->m_X;
Node* node = findSearchNode(px);
const double nx = node->m_Point->m_X;
if (px == nx) {
if (point != node->m_Point) {
// We might have two nodes with same x value for a short time
if (point == node->m_Prev->m_Point) {
node = node->m_Prev;
} else if (point == node->m_Next->m_Point) {
node = node->m_Next;
} else {
assert(0);
}
}
} else if (px < nx) {
while ((node = node->m_Prev) != NULL) {
if (point == node->m_Point) {
break;
}
}
} else {
while ((node = node->m_Next) != NULL) {
if (point == node->m_Point)
break;
}
}
if (node)
m_SearchNode = node;
return node;
}
AdvancingFront::~AdvancingFront() {}
}
|
