2
* ***** BEGIN GPL LICENSE BLOCK *****
4
* This program is free software; you can redistribute it and/or
5
* modify it under the terms of the GNU General Public License
6
* as published by the Free Software Foundation; either version 2
7
* of the License, or (at your option) any later version.
9
* This program is distributed in the hope that it will be useful,
10
* but WITHOUT ANY WARRANTY; without even the implied warranty of
11
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12
* GNU General Public License for more details.
14
* You should have received a copy of the GNU General Public License
15
* along with this program; if not, write to the Free Software Foundation,
16
* Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
18
* The Original Code is Copyright (C) 2001-2002 by NaN Holding BV.
19
* All rights reserved.
21
* The Original Code is: all of this file.
23
* Contributor(s): none yet.
25
* ***** END GPL LICENSE BLOCK *****
28
/** \file decimation/intern/LOD_EdgeCollapser.h
33
#ifndef __LOD_EDGECOLLAPSER_H__
34
#define __LOD_EDGECOLLAPSER_H__
36
// This is a helper class that collapses edges of a 2 - manifold mesh.
38
#include "LOD_MeshPrimitives.h"
39
#include "MEM_NonCopyable.h"
45
class LOD_EdgeCollapser
46
: public MEM_NonCopyable
56
// returns via arguments the set of modified
57
// verts,edges and faces.
63
std::vector<LOD_EdgeInd> & degenerate_edges,
64
std::vector<LOD_FaceInd> & degenerate_faces,
65
std::vector<LOD_VertexInd> & degenerate_vertices,
66
std::vector<LOD_EdgeInd> & new_edges,
67
std::vector<LOD_FaceInd> & update_faces,
68
std::vector<LOD_VertexInd> & update_vertices
76
// Test to see if the result of collapsing the
77
// edge produces 2 junctions in the mesh i.e. where
78
// an edge is shared by more than 2 polygons
80
// We count the number of coincedent edge pairs that
81
// result from the collapse of collapse_edge.
83
// If collapse edge is a boundary edge then the number of
84
// coincedent pairs should be 1
85
// else it should be 2.
90
std::vector<LOD_EdgeInd> &e_v0v1,
91
LOD_EdgeInd collapse_edge
94
// here's the definition of the sort function
95
// we use to determine coincedent edges
97
// assumes the edges are normalized i.e. m_verts[0] <= m_verts[1]
99
struct less : std::binary_function<LOD_Edge, LOD_Edge, bool> {
106
if (int(a.m_verts[0]) == int(b.m_verts[0])) {
107
return (int(a.m_verts[1]) < int(b.m_verts[1]));
109
return (int(a.m_verts[0]) < int(b.m_verts[0]));