⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 wmlbisect3.cpp

📁 Wild Math Library数值计算库
💻 CPP
📖 第 1 页 / 共 2 页
字号:
// Magic Software, Inc.
// http://www.magic-software.com
// http://www.wild-magic.com
// Copyright (c) 2004.  All Rights Reserved
//
// The Wild Magic Library (WML) source code is supplied under the terms of
// the license agreement http://www.magic-software.com/License/WildMagic.pdf
// and may not be copied or disclosed except in accordance with the terms of
// that agreement.

#include "WmlBisect3.h"
#include "WmlMath.h"
using namespace Wml;

//----------------------------------------------------------------------------
template <class Real>
Bisect3<Real>::Bisect3 (Function oF, Function oG, Function oH, int iMaxLevel,
    Real fTolerance)
{
    m_oF = oF;
    m_oG = oG;
    m_oH = oH;
    m_iMaxLevel = iMaxLevel;
    m_iLevel = 0;
    m_fTolerance = fTolerance;
}
//----------------------------------------------------------------------------
#define ZeroTest(fX,fY,fZ,fF,fG,fH,fXRoot,fYRoot,fZRoot)\
    fF = m_oF(fX,fY,fZ); \
    fG = m_oG(fX,fY,fZ); \
    fH = m_oH(fX,fY,fZ); \
    if ( Math<Real>::FAbs(fF) <= m_fTolerance \
    &&   Math<Real>::FAbs(fG) <= m_fTolerance \
    &&   Math<Real>::FAbs(fH) <= m_fTolerance ) \
    { \
        fXRoot = fX; \
        fYRoot = fY; \
        fZRoot = fZ; \
        m_iLevel--; \
        return true; \
    }
//----------------------------------------------------------------------------
#define AddNode(fX,fY,fZ,fF,fG,fH)\
    m_pkTemp = new BisectNode; \
    m_pkTemp->m_fX = fX; \
    m_pkTemp->m_fY = fY; \
    m_pkTemp->m_fZ = fZ; \
    m_pkTemp->m_fF = fF; \
    m_pkTemp->m_fG = fG; \
    m_pkTemp->m_fH = fH;
//----------------------------------------------------------------------------
template <class Real>
bool Bisect3<Real>::Bisect (Real fX0, Real fY0, Real fZ0, Real fX1,
    Real fY1, Real fZ1, Real& rfXRoot, Real& rfYRoot, Real& rfZRoot)
{
    // test eight corner values
    ZeroTest(fX0,fY0,fZ0,m_fF000,m_fG000,m_fH000,rfXRoot,rfYRoot,rfZRoot);
    ZeroTest(fX1,fY0,fZ0,m_fF100,m_fG100,m_fH100,rfXRoot,rfYRoot,rfZRoot);
    ZeroTest(fX0,fY1,fZ0,m_fF010,m_fG010,m_fH010,rfXRoot,rfYRoot,rfZRoot);
    ZeroTest(fX1,fY1,fZ0,m_fF110,m_fG110,m_fH110,rfXRoot,rfYRoot,rfZRoot);
    ZeroTest(fX0,fY0,fZ1,m_fF001,m_fG001,m_fH001,rfXRoot,rfYRoot,rfZRoot);
    ZeroTest(fX1,fY0,fZ1,m_fF101,m_fG101,m_fH101,rfXRoot,rfYRoot,rfZRoot);
    ZeroTest(fX0,fY1,fZ1,m_fF011,m_fG011,m_fH011,rfXRoot,rfYRoot,rfZRoot);
    ZeroTest(fX1,fY1,fZ1,m_fF111,m_fG111,m_fH111,rfXRoot,rfYRoot,rfZRoot);

    // build initial oct

    // add pkN000
    m_pkGraph = new BisectNode;
    m_pkGraph->m_fX = fX0;
    m_pkGraph->m_fY = fY0;
    m_pkGraph->m_fZ = fZ0;
    m_pkGraph->m_fF = m_fF000;
    m_pkGraph->m_fG = m_fG000;
    m_pkGraph->m_fH = m_fH000;

    // add pkN100
    AddNode(fX1,fY0,fZ0,m_fF100,m_fG100,m_fH100);
    m_pkTemp->m_pkXNext = NULL;
    m_pkGraph->m_pkXNext = m_pkTemp;

    // add pkN010
    AddNode(fX0,fY1,fZ0,m_fF010,m_fG010,m_fH010);
    m_pkTemp->m_pkYNext = NULL;
    m_pkGraph->m_pkYNext = m_pkTemp;

    // add pkN110
    AddNode(fX1,fY1,fZ0,m_fF110,m_fG110,m_fH110);
    m_pkTemp->m_pkXNext = NULL;
    m_pkTemp->m_pkYNext = NULL;
    m_pkGraph->m_pkXNext->m_pkYNext = m_pkTemp;
    m_pkGraph->m_pkYNext->m_pkXNext = m_pkTemp;

    // add pkN001
    AddNode(fX0,fY1,fZ1,m_fF001,m_fG001,m_fH001);
    m_pkTemp->m_pkZNext = NULL;
    m_pkGraph->m_pkZNext = m_pkTemp;

    // add pkN101
    AddNode(fX1,fY0,fZ1,m_fF101,m_fG101,m_fH101);
    m_pkTemp->m_pkXNext = NULL;
    m_pkTemp->m_pkZNext = NULL;
    m_pkGraph->m_pkXNext->m_pkZNext = m_pkTemp;
    m_pkGraph->m_pkZNext->m_pkXNext = m_pkTemp;

    // add pkN011
    AddNode(fX0,fY1,fZ1,m_fF011,m_fG011,m_fH011);
    m_pkTemp->m_pkYNext = NULL;
    m_pkTemp->m_pkZNext = NULL;
    m_pkGraph->m_pkYNext->m_pkZNext = m_pkTemp;
    m_pkGraph->m_pkZNext->m_pkYNext = m_pkTemp;

    // add pkN111
    AddNode(fX1,fY1,fZ1,m_fF111,m_fG111,m_fH111);
    m_pkGraph->m_pkXNext->m_pkYNext->m_pkZNext = m_pkTemp;
    m_pkGraph->m_pkYNext->m_pkXNext->m_pkZNext = m_pkTemp;
    m_pkGraph->m_pkXNext->m_pkZNext->m_pkYNext = m_pkTemp;

    bool bResult = BisectRecurse(m_pkGraph);
    if ( bResult )
    {
        rfXRoot = m_fXRoot;
        rfYRoot = m_fYRoot;
        rfZRoot = m_fZRoot;
    }

    // remove remaining oct from m_pkGraph
    delete m_pkGraph->m_pkXNext->m_pkYNext->m_pkZNext;
    delete m_pkGraph->m_pkXNext->m_pkZNext;
    delete m_pkGraph->m_pkYNext->m_pkZNext;
    delete m_pkGraph->m_pkZNext;
    delete m_pkGraph->m_pkXNext->m_pkYNext;
    delete m_pkGraph->m_pkXNext;
    delete m_pkGraph->m_pkYNext;
    delete m_pkGraph;

    return bResult;
}
//----------------------------------------------------------------------------
template <class Real>
bool Bisect3<Real>::BisectRecurse (BisectNode* pkN000)
{
    if ( ++m_iLevel == m_iMaxLevel )
    {
        m_iLevel--;
        return false;
    }

    BisectNode* pkN100 = pkN000->m_pkXNext;
    BisectNode* pkN010 = pkN000->m_pkYNext;
    BisectNode* pkN110 = pkN100->m_pkYNext;
    BisectNode* pkN001 = pkN000->m_pkZNext;
    BisectNode* pkN101 = pkN001->m_pkXNext;
    BisectNode* pkN011 = pkN001->m_pkYNext;
    BisectNode* pkN111 = pkN101->m_pkYNext;

    m_iNetSign = (int)(
        Math<Real>::Sign(pkN000->m_fF) +
        Math<Real>::Sign(pkN010->m_fF) +
        Math<Real>::Sign(pkN100->m_fF) +
        Math<Real>::Sign(pkN110->m_fF) +
        Math<Real>::Sign(pkN001->m_fF) +
        Math<Real>::Sign(pkN011->m_fF) +
        Math<Real>::Sign(pkN101->m_fF) +
        Math<Real>::Sign(pkN111->m_fF));

    if ( abs(m_iNetSign) == 8 )
    {
        // F has same sign at corners
        m_iLevel--;
        return false;
    }

    m_iNetSign = (int)(
        Math<Real>::Sign(pkN000->m_fG) +
        Math<Real>::Sign(pkN010->m_fG) +
        Math<Real>::Sign(pkN100->m_fG) +
        Math<Real>::Sign(pkN110->m_fG) +
        Math<Real>::Sign(pkN001->m_fG) +
        Math<Real>::Sign(pkN011->m_fG) +
        Math<Real>::Sign(pkN101->m_fG) +
        Math<Real>::Sign(pkN111->m_fG));

    if ( abs(m_iNetSign) == 8 )
    {
        // G has same sign at corners
        m_iLevel--;
        return false;
    }

    m_iNetSign = (int)(
        Math<Real>::Sign(pkN000->m_fH) +
        Math<Real>::Sign(pkN010->m_fH) +
        Math<Real>::Sign(pkN100->m_fH) +
        Math<Real>::Sign(pkN110->m_fH) +
        Math<Real>::Sign(pkN001->m_fH) +
        Math<Real>::Sign(pkN011->m_fH) +
        Math<Real>::Sign(pkN101->m_fH) +
        Math<Real>::Sign(pkN111->m_fH));

    if ( abs(m_iNetSign) == 8 )
    {
        // H has same sign at corners
        m_iLevel--;
        return false;
    }

    // bisect the oct
    m_fX0 = pkN000->m_fX;
    m_fY0 = pkN000->m_fY;
    m_fZ0 = pkN000->m_fZ;
    m_fX1 = pkN111->m_fX;
    m_fY1 = pkN111->m_fY;
    m_fZ1 = pkN111->m_fZ;
    m_fXm = 0.5f*(m_fX0+m_fX1);
    m_fYm = 0.5f*(m_fY0+m_fY1);
    m_fZm = 0.5f*(m_fZ0+m_fZ1);

    ZeroTest(m_fXm,m_fY1,m_fZ1,m_fFm11,m_fGm11,m_fHm11,
        m_fXRoot,m_fYRoot,m_fZRoot);  // edge 011,111

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -