diff options
author | Norbert Preining <norbert@preining.info> | 2019-09-02 13:46:59 +0900 |
---|---|---|
committer | Norbert Preining <norbert@preining.info> | 2019-09-02 13:46:59 +0900 |
commit | e0c6872cf40896c7be36b11dcc744620f10adf1d (patch) | |
tree | 60335e10d2f4354b0674ec22d7b53f0f8abee672 /graphics/epix/screen_crop.cc |
Initial commit
Diffstat (limited to 'graphics/epix/screen_crop.cc')
-rw-r--r-- | graphics/epix/screen_crop.cc | 70 |
1 files changed, 70 insertions, 0 deletions
diff --git a/graphics/epix/screen_crop.cc b/graphics/epix/screen_crop.cc new file mode 100644 index 0000000000..1eb6860266 --- /dev/null +++ b/graphics/epix/screen_crop.cc @@ -0,0 +1,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 <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 + */ +#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 |