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
|
/*
* screen_crop.cc -- ePiX functions for cropping 2D paths and loops
*
* This file is part of ePiX, a C++ library for creating high-quality
* figures in LaTeX
*
* Version 1.1.8
* Last Change: July 17, 2007
*
*
* Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007
* 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 "functions.h"
#include "pairs.h"
#include "edge_data.h"
#include "screen_crop.h"
#include "crop_algorithms.h"
namespace ePiX {
typedef std::list<edge2d>::const_iterator CLI;
static pair unit_perp(const edge2d& E)
{
pair N(J(E.head() - E.tail()));
return N *= recip(norm(N));
}
// O(n^2) algorithm seems necessary since edge_list needn't be convex
std::list<edge2d>& crop_path_2nd(const std::list<edge2d>& bord,
std::list<edge2d>& edge_list)
{
for (CLI ep=bord.begin(); ep != bord.end(); ++ep)
chop_path<pair>(unit_perp(*ep), (*ep).tail(), edge_list);
return cull<pair>(edge_list);
}
std::list<edge2d>& crop_loop_2nd(const std::list<edge2d>& bord,
std::list<edge2d>& edge_list)
{
for (CLI ep=bord.begin(); ep != bord.end(); ++ep)
{
chop_path<pair>(unit_perp(*ep), (*ep).tail(), edge_list);
loopify<pair>(edge_list);
}
return cull<pair>(edge_list);
}
} // end of namespace
|
