File: Polyline3.cpp

package info (click to toggle)
libwildmagic 5.17%2Bcleaned1-6
  • links: PTS, VCS
  • area: main
  • in suites: bookworm, bullseye
  • size: 90,112 kB
  • sloc: cpp: 215,940; csh: 637; sh: 91; makefile: 39
file content (62 lines) | stat: -rw-r--r-- 1,826 bytes parent folder | download | duplicates (3)
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
// 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.0 (2010/01/01)

#include "Polyline3.h"
#include "VertexCollapse.h"
#include "Wm5Memory.h"

//----------------------------------------------------------------------------
Polyline3::Polyline3 (int numVertices, Vector3f* vertices, bool closed)
    :
    mNumVertices(numVertices),
    mVertices(vertices),
    mClosed(closed)
{
    assertion(vertices && (closed ? numVertices >= 3 : numVertices >= 2),
        "Invalid inputs.\n");

    // Compute the vertex collapses.
    VertexCollapse(mNumVertices, mVertices, mClosed, mIndexMap, mNumEdges,
        mEdges);

    // Polyline initially at full level of detail.
    mVMin = (mClosed ? 3 : 2);
    mVMax = mNumVertices;
}
//----------------------------------------------------------------------------
Polyline3::~Polyline3 ()
{
    delete1(mVertices);
    delete1(mEdges);
    delete1(mIndexMap);
}
//----------------------------------------------------------------------------
void Polyline3::SetLevelOfDetail (int numVertices)
{
    if (numVertices < mVMin || numVertices > mVMax)
    {
        return;
    }

    // Decrease level of detail.
    while (mNumVertices > numVertices)
    {
        --mNumVertices;
        mEdges[mIndexMap[mNumVertices]] = mEdges[2*mNumEdges - 1];
        --mNumEdges;
    }

    // Increase level of detail.
    while (mNumVertices < numVertices)
    {
        ++mNumEdges;
        mEdges[mIndexMap[mNumVertices]] = mNumVertices;
        ++mNumVertices;
    }
}
//----------------------------------------------------------------------------