File: MxStdSlim.cpp

package info (click to toggle)
k3d 0.8.0.2-6
  • links: PTS, VCS
  • area: main
  • in suites: squeeze
  • size: 40,692 kB
  • ctags: 39,695
  • sloc: cpp: 171,303; ansic: 24,129; xml: 6,995; python: 5,796; makefile: 726; sh: 22
file content (53 lines) | stat: -rw-r--r-- 1,625 bytes parent folder | download | duplicates (8)
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
// MixKit -- Code library for multiresolution surface modeling
// Copyright (c) 1998, Michael Garland
//
// Contact: http://graphics.cs.uiuc.edu/~garland/software/qslim.html
//
// This library is free software; you can redistribute it and/or
// modify it under the terms of the GNU Library General Public
// License as published by the Free Software Foundation; either
// version 2 of the License, or (at your option) any later version.
//
// This library 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
// Library General Public License for more details.
//
// You should have received a copy of the GNU General Public
// License along with this library; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA

/** \file
		\brief Surface simplification using quadric error metrics
		\author Adapted for K-3D: Romain Behar (romainbehar@yahoo.com)
*/

#include "MxStdSlim.h"

MxStdSlim::MxStdSlim(MxStdModel *m0)
{
	m = m0;

	// Externally visible variables
	placement_policy = MX_PLACE_OPTIMAL;
	weighting_policy = MX_WEIGHT_AREA;
	boundary_weight = 1000.0;
	compactness_ratio = 0.0;
	meshing_penalty = 1.0;
	local_validity_threshold = 0.0;
	vertex_degree_limit = 24;
	will_join_only = false;

	valid_faces = 0;
	valid_verts = 0;

	for(unsigned long i = 0; i < m->face_count(); ++i)
		if(m->face_is_valid(i))
			valid_faces++;

	for(unsigned long i = 0; i < m->vert_count(); ++i)
		if(m->vertex_is_valid(i))
			valid_verts++;
}