| 660 |
khor |
1 |
/* ----------------------------------------------------------------------- *
|
|
|
2 |
* This file is part of GEL, http://www.imm.dtu.dk/GEL
|
|
|
3 |
* Copyright (C) the authors and DTU Informatics
|
|
|
4 |
* For license and list of authors, see ../../doc/intro.pdf
|
|
|
5 |
* ----------------------------------------------------------------------- */
|
|
|
6 |
|
|
|
7 |
/**
|
|
|
8 |
* @file caps_and_needles.h
|
|
|
9 |
* @brief Simple tools for improving polygonal meshes by removing bad triangles.
|
|
|
10 |
*/
|
|
|
11 |
|
|
|
12 |
#ifndef __HMESH_CAPS_AND_NEEDLES_H__
|
|
|
13 |
#define __HMESH_CAPS_AND_NEEDLES_H__
|
|
|
14 |
|
|
|
15 |
namespace HMesh
|
|
|
16 |
{
|
|
|
17 |
class Manifold;
|
|
|
18 |
/** \brief Remove caps from a manifold consisting of only triangles.
|
|
|
19 |
A cap is a triangle with two very small angles and an angle close to pi, however a cap does not necessarily have a very short edge.
|
|
|
20 |
Set the ang_thresh to a value close to pi. The closer to pi the _less_ sensitive the cap removal.
|
|
|
21 |
A cap is removed by flipping the (long) edge E opposite to the vertex V with the angle close to pi.
|
|
|
22 |
However, the function is more complex. Read code and document more carefully !!! */
|
|
|
23 |
void remove_caps(Manifold& m, float thresh);
|
|
|
24 |
|
|
|
25 |
/** \brief Remove needles from a manifold consisting of only triangles.
|
|
|
26 |
A needle is a triangle with a single very short edge. It is moved by collapsing the short edge.
|
|
|
27 |
The thresh parameter sets the length threshold.
|
|
|
28 |
The position of the vertex which survives the collapse is set to one of the two end points.
|
|
|
29 |
Selection is based on what changes the geometry least. */
|
|
|
30 |
void remove_needles(Manifold& m, float thresh);
|
|
|
31 |
|
|
|
32 |
/** \brief Stitch together edges whose endpoints coincide geometrically.
|
|
|
33 |
This function allows you to create a mesh as a bunch of faces and then stitch these together
|
|
|
34 |
to form a coherent whole. What this function adds is a spatial data structure to find out
|
|
|
35 |
which vertices coincide. The return value is the number of edges that could not be stitched.
|
|
|
36 |
Often this is because it would introduce a non-manifold situation.*/
|
|
|
37 |
int stitch_mesh(Manifold& m);
|
|
|
38 |
|
|
|
39 |
/** \brief Stitches the mesh together, splits edges that could not be stitched and goes again.
|
|
|
40 |
This function thereby handles situations where stitch mesh would not have worked. */
|
|
|
41 |
void stitch_more(Manifold& m);
|
|
|
42 |
|
|
|
43 |
/** \brief This function replaces holes by faces.
|
|
|
44 |
It is really a simple function that just finds all loops of edges next to missing faces. */
|
|
|
45 |
void close_holes(Manifold& m);
|
|
|
46 |
|
|
|
47 |
}
|
|
|
48 |
|
|
|
49 |
#endif
|