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
|
/*
* segment.cc -- ePiX::Segment class and mathematical operators
*
* This file is part of ePiX, a C++ library for creating high-quality
* figures in LaTeX
*
* Version 1.2.5
* Last Change: May 04, 2008
*/
/*
* Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008
* Andrew D. Hwang <ahwang -at- holycross -dot- edu>
* Department of Mathematics and Computer Science
* College of the Holy Cross
* Worcester, MA, 01610-2395, USA
*/
/*
* ePiX is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* ePiX 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.
*
* You should have received a copy of the GNU General Public License
* along with ePiX; if not, write to the Free Software Foundation, Inc.,
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*/
#include "triples.h"
#include "path.h"
#include "segment.h"
namespace ePiX {
Segment::Segment(const P& p1, const P& p2)
: m_endpt1(p1), m_endpt2(p2), m_malformed(false) { }
Segment::Segment(bool tag) : m_malformed(true) { }
P Segment::end1() const
{
return m_endpt1;
}
P Segment::end2() const
{
return m_endpt2;
}
bool Segment::malformed() const
{
return m_malformed;
}
// translate
Segment& Segment::shift(const P& arg)
{
if (!m_malformed)
{
m_endpt1 += arg;
m_endpt2 += arg;
}
return *this;
}
Segment& Segment::move_to(const P& arg)
{
if (!m_malformed)
{
const P dX(arg - 0.5*(m_endpt1 + m_endpt2));
m_endpt1 += dX;
m_endpt2 += dX;
}
return *this;
}
Segment& Segment::scale(double c)
{
if (!m_malformed)
{
const P ctr(0.5*(m_endpt1 + m_endpt2));
m_endpt1 = ctr + c*(m_endpt1 - ctr);
m_endpt2 = ctr + c*(m_endpt2 - ctr);
}
return *this;
}
P Segment::midpoint(double t) const
{
return m_endpt1 + t*(m_endpt2 - m_endpt1);
}
void Segment::draw(double stretch) const
{
if (m_malformed)
return;
// else
path temp(m_endpt1, m_endpt2, stretch);
temp.draw();
}
} // end of namespace
|
