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
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
|
/*
* $Revision: 2528 $
*
* last checkin:
* $Author: gutwenger $
* $Date: 2012-07-03 23:05:08 +0200 (Tue, 03 Jul 2012) $
***************************************************************/
/** \file
* \brief Declares EdgeComparer class.
*
* The EdgeComparer compares adjacency entries on base of
* the position of the nodes given by an Attributed Graph's
* layout information.
*
* \author Karsten Klein
*
* \par License:
* This file is part of the Open Graph Drawing Framework (OGDF).
*
* \par
* Copyright (C)<br>
* See README.txt in the root directory of the OGDF installation for details.
*
* \par
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* Version 2 or 3 as published by the Free Software Foundation;
* see the file LICENSE.txt included in the packaging of this file
* for details.
*
* \par
* This program 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 General Public License for more details.
*
* \par
* You should have received a copy of the GNU General Public
* License along with this program; if not, write to the Free
* Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
* Boston, MA 02110-1301, USA.
*
* \see http://www.gnu.org/copyleft/gpl.html
***************************************************************/
#ifdef _MSC_VER
#pragma once
#endif
#ifndef OGDF_EDGECOMPARER_H
#define OGDF_EDGECOMPARER_H
#include <ogdf/planarity/PlanRep.h>
#include <ogdf/basic/GraphAttributes.h>
namespace ogdf {
//! The EdgeComparer compares adjacency entries on base of the position of the nodes given by an Attributed Graph's layout information
/**
* helper function for ordering / sorting
* assumes that PG is a planrep on original AG and that PG is
* not normalized, i.e., if there are bends in AG, they do not
* have a counterpart in PG (all nodes in PG have an original)
* temporary: we assume that we have two adjentries
* at a common point, so we leave the check for now
* if they meet and at which point
*
* \todo check if sorting order fits adjacency list
*/
class OGDF_EXPORT EdgeComparer : public VComparer<adjEntry>
{
public:
//order: clockwise
EdgeComparer(const GraphAttributes& AG, const PlanRep& PR) : m_AG(&AG), m_PR(&PR) { }
//! compare the edges directly in AG
EdgeComparer(const GraphAttributes &AG) : m_AG(&AG), m_PR(0) {}
int compare(const adjEntry &e1, const adjEntry &e2) const;
//! check if vector u->v lies within 180degree halfcircle before vector u->w in clockwise order (i.e. twelve o'clock lies before 1)
bool before(const DPoint u, const DPoint v, const DPoint w) const;
private:
//! returns a value > 0, if vector uv lies "before" vector uw
int orientation(
const DPoint u,
const DPoint v,
const DPoint w) const;
//! compares by angle relative to x-axis
int compareVectors(
const double& x1,
const double& y1,
const double& x2,
const double& y2) const;
//! computes angle between vectors p->q, p->r
double angle(DPoint p, DPoint q, DPoint r) const;
inline int signOf(const double& x) const
{
if ( x == 0 ) return 0;
else if (x > 0 ) return 1;
else return -1;
}
const GraphAttributes *m_AG;
const PlanRep *m_PR;
};//EdgeComparer
}//namespace ogdf
#endif
|
