File: crop_algorithms.h

package info (click to toggle)
epix 1.2.6-3
  • links: PTS
  • area: main
  • in suites: squeeze
  • size: 3,176 kB
  • ctags: 2,623
  • sloc: cpp: 16,442; sh: 4,848; makefile: 205
file content (225 lines) | stat: -rw-r--r-- 5,752 bytes parent folder | download | duplicates (4)
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
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
/* 
 * crop_algorithms.h -- clipping/cropping templates
 *
 * This file is part of ePiX, a C++ library for creating high-quality 
 * figures in LaTeX 
 *
 * Version 1.1.9
 * Last Change: July 31, 2007
 */

/* 
 * Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007
 * Andrew D. Hwang <rot 13 nujnat at zngupf dot ubylpebff dot rqh>
 * 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.,
 * 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
 */

/*
 * This file defines list<edge> manipulating template functions and
 * associated utilities. Each chop function returns a reference to its
 * list<edge> argument.
 *
 * double height(perp, base, arg)
 * PT cut_location(perp, base, tail, head)
 * cull(edges)     // remove edges whose tail and head are equal
 * loopify(edges)  // replace contiguous unseen edges with one seen edge
 * chop_path(perp, base, edges) // cull to a halfspace/halfplane
 * chop_loop(perp, base, edges) // same, for loops
 */

#ifndef EPIX_CROP_ALGO
#define EPIX_CROP_ALGO

#include <list>

#include "constants.h"

namespace ePiX {

  // perp assumed to be *unit*
  template <typename PT>
    double height(const PT& perp, const PT& base, const PT& arg)
    {
      //      return (perp|(operator-(arg, base)));
      return (perp|(arg - base));
    }

  // no check for parallel
  template <typename PT>
    PT cut_location(const PT& perp, const PT& base, const PT& p1, const PT& p2)
    {
      //      PT dir(operator-(p2, p1)); // -dir to base
      //      return p1 + (((operator-(base, p1))|perp)/(dir|perp))*dir;
      PT dir(p2 - p1); // -dir to base
      return p1 + (((base - p1)|perp)/(dir|perp))*dir;
    }

  // remove edges whose tail, head are equal
  template <typename PT>
    std::list<edge_data<PT> >& cull(std::list<edge_data<PT> >& edges)
    {
      typename std::list<edge_data<PT> >::iterator ep(edges.begin());

      while (ep != edges.end())
	{
	  if ((*ep).is_null())
	    ep = edges.erase(ep);

	  else
	    ++ep;
	}

      return edges;
    }

  template <typename PT>
    std::list<edge_data<PT> >& loopify(std::list<edge_data<PT> >& edges)
    {
      if (edges.begin() == edges.end())
	return edges;

      typename std::list<edge_data<PT> >::iterator ep(edges.begin());
      bool in_path(false); // currently in a visible sublist?

      // After first pass, ep points to first visible edge
      while (ep != edges.end())
	{
	  if (!(*ep).is_seen()) // invisible edge
	    {
	      ep=edges.erase(ep);
	      in_path=false;
	      continue;
	    }

	  // else visible edge
	  if (in_path)
	    {
	      ++ep;
	      continue;
	    }

	  // else
	  in_path=true;
	  if (ep != edges.begin()) // join our tail to previous head
	    {
	      typename std::list<edge_data<PT> >::iterator prev(ep);
	      --prev;
	      ep = edges.insert(ep, edge_data<PT>((*prev).head(),
						  (*ep).tail(),
						  true));
	      ++ep;
	      ++ep;
	    }
	}

      // all edges examined; if we contain multiple edges, close final cut
      ep = edges.begin();
      // contains at most one edge
      if (ep == edges.end())
	; // return below

      else if (++ep == edges.end())
	edges.erase(edges.begin());

      else
        {
          ep = edges.end();
	  --ep;
          edges.push_back(edge_data<PT>((*ep).head(),
					(*edges.begin()).tail(),
                                        true));
        }

      return edges;
    } // end of loopify()


  // return result of clipping edges to half space/plane through base
  // with unit inward normal perp
  template <typename PT>
    std::list<edge_data<PT> >& chop_path(const PT& perp, const PT& base,
					 std::list<edge_data<PT> >& edges)
    {
      typename std::list<edge_data<PT> >::iterator ep(edges.begin());

      while(ep != edges.end())
	{
	  if (!(*ep).is_seen())
	    {
	      ++ep;
	      continue;
	    }

	  // else
	  const PT tail((*ep).tail());
	  const PT head((*ep).head());

	  const double ht_tail(height(perp, base, tail));
	  const double ht_head(height(perp, base, head));

	  // non-crossings:
	  // unclipped
	  if (-EPIX_EPSILON < ht_tail && -EPIX_EPSILON < ht_head)
	    {
	      ++ep;
	      continue;
	    }

	  // clipped
	  else if (ht_tail <= 0 && ht_head <= 0)
	    {
	      (*ep).seen(false);
	      ++ep;
	      continue;
	    }

	  // else one end below -EPS, one above 0; split edge
	  const PT crossing(cut_location(perp, base, tail, head));

	  // visibility of segments
	  bool vis_tail(false), vis_head(true);

	  if (0 < ht_tail)
	    {
	      vis_tail=true;
	      vis_head=false;
	    }

	  ep = edges.erase(ep);
	  ep=edges.insert(ep, edge_data<PT>(crossing, head, vis_head));
	  ep=edges.insert(ep, edge_data<PT>(tail, crossing, vis_tail));
	  ++ep;
	  ++ep;
	} // all edges examined

      return cull(edges);
    } // end of chop_path()


  template <typename PT>
    std::list<edge_data<PT> >& chop_loop(const PT& perp, const PT& base,
			    std::list<edge_data<PT> >& edges)
    {
      return loopify(chop_path(perp, base, edges));
    }
} // end of namespace

#endif /* EPIX_CROP_ALGO */