libwildmagic-dev 5.13-1ubuntu3 / usr / include / libwildmagic / Wm5ExtractSurfaceTetra.h

This file is indexed.

/usr/include/libwildmagic/Wm5ExtractSurfaceTetra.h is in libwildmagic-dev 5.13-1ubuntu3.

This file is owned by root:root, with mode 0o644.

The actual contents of the file can be viewed below. 

  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
// Geometric Tools, LLC
// Copyright (c) 1998-2014
// Distributed under the Boost Software License, Version 1.0.
// http://www.boost.org/LICENSE_1_0.txt
// http://www.geometrictools.com/License/Boost/LICENSE_1_0.txt
//
// File Version: 5.0.1 (2010/10/01)

#ifndef WM5EXTRACTSURFACETETRA_H
#define WM5EXTRACTSURFACETETRA_H

#include "Wm5ImagicsLIB.h"
#include "Wm5Vector3.h"
#include "Wm5EdgeKey.h"
#include "Wm5TriangleKey.h"

namespace Wm5
{

class WM5_IMAGICS_ITEM ExtractSurfaceTetra
{
public:
    // The input is a 3D image with lexicographically ordered voxels in
    // (x,y,z) stored in a linear array.  Voxel (x,y,z) is stored in the
    // array at location x+xbound*(y+ybound*z).  The caller is responsible
    // for deleting data if it was dynamically allocated.
    ExtractSurfaceTetra (int xBound, int yBound, int zBound, int* data);

    // The extraction assumes linear interpolation (decomposition of image
    // domain into tetrahedra).  The triangle ordering is selected so that
    // the triangle is counterclockwise with respect to the triangle normal
    // chosen to form an acute angle with the negative gradient of the
    // image at the centroid of the triangle.
    void ExtractContour (int level, std::vector<Vector3f>& vertices,
        std::vector<TriangleKey>& triangles);

    // The extraction has duplicate vertices on edges shared by voxels.  This
    // function will eliminate the duplication.
    void MakeUnique (std::vector<Vector3f>& vertices,
        std::vector<TriangleKey>& triangles);

    // The extraction does not use any topological information about the level
    // surface.  The triangles can be a mixture of clockwise-ordered and
    // counterclockwise-ordered.  This function is an attempt to give the
    // triangles a consistent ordering by selecting a normal in approximately
    // the same direction as the average gradient at the vertices (when
    // sameDir is true), or in the opposite direction (when sameDir is
    // false).  This might not always produce a consistent order, but is
    // fast.  A consistent order can be computed if you build a table of
    // vertex, edge, and face adjacencies, but the resulting data structure
    // is very expensive to process to reorient triangles.
    void OrientTriangles (std::vector<Vector3f>& vertices,
        std::vector<TriangleKey>& triangles, bool sameDir);

    // In case you want vertex normals for dynamic lighting of the mesh.
    void ComputeNormals (const std::vector<Vector3f>& vertices,
        const std::vector<TriangleKey>& triangles,
        std::vector<Vector3f>& normals);

protected:
    class Vertex
    {
    public:
        Vertex (int xNumer = 0, int xDenom = 0, int yNumer = 0,
            int yDenom = 0, int zNumer = 0, int zDenom = 0);

        // For STL maps.
        bool operator< (const Vertex& vertex) const;

        void GetTriple (Vector3f& meshVertex) const;

        // Vertices stored as rational numbers:
        //   (xnumer/xdenom, ynumer/ydenom, znumer/zdenom)
        int XNumer, XDenom, YNumer, YDenom, ZNumer, ZDenom;
    };

    // Support for extraction of level sets.
    typedef std::map<Vertex,int> VtxMap;
    typedef VtxMap::iterator VtxMapIterator;
    typedef std::set<EdgeKey> ESet;
    typedef ESet::iterator ESetIterator;
    typedef std::set<TriangleKey> TriSet;
    typedef TriSet::iterator TSetIterator;

    int AddVertex (VtxMap& vertexMap, int xNumer, int xDenom, int yNumer,
        int yDenom, int zNumer, int zDenom);

    void AddEdge (VtxMap& vertexMap, ESet& edgeSet, int xNumer0,
        int xDenom0, int yNumer0, int yDenom0, int zNumer0, int zDenom0,
        int xNumer1, int xDenom1, int yNumer1, int yDenom1, int zNumer1,
        int zDenom1);

    void AddTriangle (VtxMap& vertexMap, ESet& edgeSet, TriSet& triangleSet,
        int xNumer0, int xDenom0, int yNumer0, int yDenom0, int zNumer0,
        int zDenom0, int xNumer1, int xDenom1, int yNumer1, int yDenom1,
        int zNumer1, int zDenom1, int xNumer2, int xDenom2, int yNumer2,
        int yDenom2, int zNumer2, int zDenom2);

    // Support for extraction with linear interpolation.
    void ProcessTetrahedron (VtxMap& vertexMap, ESet& edgeSet,
        TriSet& triangleSet, int x0, int y0, int z0, int f0, int x1, int y1,
        int z1, int f1, int x2, int y2, int z2, int f2, int x3, int y3,
        int z3, int f3);

    // Function and gradient evaluated using trilinear interpolation.
    float GetFunction (const Vector3f& P) const;
    Vector3f GetGradient (const Vector3f& P) const;

    // For unique indexing of vertices.
    int mNextIndex;

    int mXBound, mYBound, mZBound, mXYBound, mXYZBound;
    int* mData;
};

}

#endif

APT Browse - Built by Thomas Orozco.