[17] 楼梯(Stairs)图形的生成算法

感觉这图形怎么看怎么像搓衣板.

顶点数据的生成

bool                        YfBuildStairsVertices

(

    Yreal                   width,

    Yreal                   length,

    Yreal                   height,

    Yuint                   stacks,

    YeOriginPose            originPose,

    Yuint                   vertexStriding,

    Yuint                   vertexPos,

    void*                   pVerticesBuffer

)

{

    if (stacks <  || !pVerticesBuffer)

    {

        return false;

    }

    Yuint numVertices  =  + stacks * ;

    //Yuint numTriangles = stacks * 8;

    char* vertexPtr = (char*)pVerticesBuffer + vertexPos;

    YsVector3* curVertexPtr = NULL;

    Yuint nOffset = ;

    YsVector3 vOriginOffset(-width / , -height / , -length / );

    if (originPose == YE_ORIGIN_POSE_TOP)

    {

        vOriginOffset.y = -height;

    }

    else if (originPose == YE_ORIGIN_POSE_BOTTOM)

    {

        vOriginOffset.y = 0.0f;

    }

    Yreal fStepLength = length / stacks;

    Yreal fStepHeight = height / stacks;

    for (Yuint i = ; i <= stacks; i++)

    {

        nOffset = i *  * vertexStriding;

        curVertexPtr = (YsVector3*)(vertexPtr + nOffset);

        curVertexPtr->x = vOriginOffset.x;

        curVertexPtr->y = i * fStepHeight + vOriginOffset.y;

        curVertexPtr->z = i * fStepLength + vOriginOffset.z;

        nOffset += vertexStriding;

        curVertexPtr = (YsVector3*)(vertexPtr + nOffset);

        curVertexPtr->x = width + vOriginOffset.x;

        curVertexPtr->y = i * fStepHeight + vOriginOffset.y;

        curVertexPtr->z = i * fStepLength + vOriginOffset.z;

        if (i == stacks)

        {

            continue;

        }

        nOffset += vertexStriding;

        curVertexPtr = (YsVector3*)(vertexPtr + nOffset);

        curVertexPtr->x = vOriginOffset.x;

        curVertexPtr->y = (i+) * fStepHeight + vOriginOffset.y;

        curVertexPtr->z = i * fStepLength + vOriginOffset.z;

        nOffset += vertexStriding;

        curVertexPtr = (YsVector3*)(vertexPtr + nOffset);

        curVertexPtr->x = width + vOriginOffset.x;

        curVertexPtr->y = (i+) * fStepHeight + vOriginOffset.y;

        curVertexPtr->z = i * fStepLength + vOriginOffset.z;

    }

    return true;

}

三角形索引数据的生成

 bool                        YfBuildStairsTriIndices

 (

     Yuint                   stacks,

     YeIndexType             indexType,

     Yuint                   indexStriding,

     Yuint                   indexPos,

     void*                   pTriIndicesBuffer

 )

 {

     if (stacks <  || !pTriIndicesBuffer)

     {

         return false;

     }

     Yuint numVertices  =  + stacks * ;

     Yuint numTriangles = stacks * ;

     if (indexType == YE_INDEX_16_BIT &&

         numVertices > YD_MAX_UNSIGNED_INT16)

     {

         return false;

     }

     // 索引赋值

     char* indexPtr = (char*)pTriIndicesBuffer + indexPos;

     Yuint nOffset = ;

     if (indexType == YE_INDEX_16_BIT)

     {

         YsTriIndex16* triIndexPtr = NULL;

         for (Yuint i = ; i < stacks; i++)

         {

             nOffset =  * i * indexStriding;

             triIndexPtr = (YsTriIndex16*)(indexPtr + nOffset);

             triIndexPtr->index0 = i* + ;

             triIndexPtr->index1 = i* + ;

             triIndexPtr->index2 = i* + ;

             nOffset += indexStriding;

             triIndexPtr = (YsTriIndex16*)(indexPtr + nOffset);

             triIndexPtr->index0 = i* + ;

             triIndexPtr->index1 = i* + ;

             triIndexPtr->index2 = i* + ;

             nOffset += indexStriding;

             triIndexPtr = (YsTriIndex16*)(indexPtr + nOffset);

             triIndexPtr->index0 = i* + ;

             triIndexPtr->index1 = i* + ;

             triIndexPtr->index2 = i* + ;

             nOffset += indexStriding;

             triIndexPtr = (YsTriIndex16*)(indexPtr + nOffset);

             triIndexPtr->index0 = i* + ;

             triIndexPtr->index1 = i* + ;

             triIndexPtr->index2 = i* + ;

             nOffset += indexStriding;

             triIndexPtr = (YsTriIndex16*)(indexPtr + nOffset);

             triIndexPtr->index0 = i* + ;

             triIndexPtr->index1 = i* + ;

             triIndexPtr->index2 = i* + ;

             nOffset += indexStriding;

             triIndexPtr = (YsTriIndex16*)(indexPtr + nOffset);

             triIndexPtr->index0 = i* + ;

             triIndexPtr->index1 = i* + ;

             triIndexPtr->index2 = i* + ;

             nOffset += indexStriding;

             triIndexPtr = (YsTriIndex16*)(indexPtr + nOffset);

             triIndexPtr->index0 = i* + ;

             triIndexPtr->index1 = i* + ;

             triIndexPtr->index2 = i* + ;

             nOffset += indexStriding;

             triIndexPtr = (YsTriIndex16*)(indexPtr + nOffset);

             triIndexPtr->index0 = i* + ;

             triIndexPtr->index1 = i* + ;

             triIndexPtr->index2 = i* + ;

         }

     }

     else

     {

         YsTriIndex32* triIndexPtr = NULL;

         for (Yuint i = ; i < stacks; i++)

         {

             nOffset =  * i * indexStriding;

             triIndexPtr = (YsTriIndex32*)(indexPtr + nOffset);

             triIndexPtr->index0 = i* + ;

             triIndexPtr->index1 = i* + ;

             triIndexPtr->index2 = i* + ;

             nOffset += indexStriding;

             triIndexPtr = (YsTriIndex32*)(indexPtr + nOffset);

             triIndexPtr->index0 = i* + ;

             triIndexPtr->index1 = i* + ;

             triIndexPtr->index2 = i* + ;

             nOffset += indexStriding;

             triIndexPtr = (YsTriIndex32*)(indexPtr + nOffset);

             triIndexPtr->index0 = i* + ;

             triIndexPtr->index1 = i* + ;

             triIndexPtr->index2 = i* + ;

             nOffset += indexStriding;

             triIndexPtr = (YsTriIndex32*)(indexPtr + nOffset);

             triIndexPtr->index0 = i* + ;

             triIndexPtr->index1 = i* + ;

             triIndexPtr->index2 = i* + ;

             nOffset += indexStriding;

             triIndexPtr = (YsTriIndex32*)(indexPtr + nOffset);

             triIndexPtr->index0 = i* + ;

             triIndexPtr->index1 = i* + ;

             triIndexPtr->index2 = i* + ;

             nOffset += indexStriding;

             triIndexPtr = (YsTriIndex32*)(indexPtr + nOffset);

             triIndexPtr->index0 = i* + ;

             triIndexPtr->index1 = i* + ;

             triIndexPtr->index2 = i* + ;

             nOffset += indexStriding;

             triIndexPtr = (YsTriIndex32*)(indexPtr + nOffset);

             triIndexPtr->index0 = i* + ;

             triIndexPtr->index1 = i* + ;

             triIndexPtr->index2 = i* + ;

             nOffset += indexStriding;

             triIndexPtr = (YsTriIndex32*)(indexPtr + nOffset);

             triIndexPtr->index0 = i* + ;

             triIndexPtr->index1 = i* + ;

             triIndexPtr->index2 = i* + ;

         }

     }

     return true;

 }

线框索引数据的生成

 bool                        YfBuildStairsWireIndices

 (

     Yuint                   stacks,

     YeIndexType             indexType,

     Yuint                   indexStriding,

     Yuint                   indexPos,

     void*                   pWireIndicesBuffer

 )

 {

     if (stacks <  || !pWireIndicesBuffer)

     {

         return false;

     }

     Yuint numVertices  =  + stacks * ;

     Yuint numLines     =  + stacks * ;

     if (indexType == YE_INDEX_16_BIT &&

         numVertices > YD_MAX_UNSIGNED_INT16)

     {

         return false;

     }

     // 索引赋值

     char* indexPtr = (char*)pWireIndicesBuffer + indexPos;

     Yuint nOffset = ;

     if (indexType == YE_INDEX_16_BIT)

     {

         YsLineIndex16* lineIndexPtr = NULL;

         for (Yuint i = ; i < stacks; i++)

         {

             nOffset = (i * ) * indexStriding;

             lineIndexPtr = (YsLineIndex16*)(indexPtr + nOffset);

             lineIndexPtr->index0 = i *  + ;

             lineIndexPtr->index1 = i *  + ;

             nOffset += indexStriding;

             lineIndexPtr = (YsLineIndex16*)(indexPtr + nOffset);

             lineIndexPtr->index0 = i *  + ;

             lineIndexPtr->index1 = i *  + ;

             nOffset += indexStriding;

             lineIndexPtr = (YsLineIndex16*)(indexPtr + nOffset);

             lineIndexPtr->index0 = i *  + ;

             lineIndexPtr->index1 = i *  + ;

             nOffset += indexStriding;

             lineIndexPtr = (YsLineIndex16*)(indexPtr + nOffset);

             lineIndexPtr->index0 = i *  + ;

             lineIndexPtr->index1 = i *  + ;

             nOffset += indexStriding;

             lineIndexPtr = (YsLineIndex16*)(indexPtr + nOffset);

             lineIndexPtr->index0 = i *  + ;

             lineIndexPtr->index1 = i *  + ;

             nOffset += indexStriding;

             lineIndexPtr = (YsLineIndex16*)(indexPtr + nOffset);

             lineIndexPtr->index0 = i *  + ;

             lineIndexPtr->index1 = i *  + ;

             nOffset += indexStriding;

             lineIndexPtr = (YsLineIndex16*)(indexPtr + nOffset);

             lineIndexPtr->index0 = i *  + ;

             lineIndexPtr->index1 = i *  + ;

             nOffset += indexStriding;

             lineIndexPtr = (YsLineIndex16*)(indexPtr + nOffset);

             lineIndexPtr->index0 = i *  + ;

             lineIndexPtr->index1 = i *  + ;

         }

         nOffset = (stacks * ) * indexStriding;

         lineIndexPtr = (YsLineIndex16*)(indexPtr + nOffset);

         lineIndexPtr->index0 = stacks * ;

         lineIndexPtr->index1 = stacks *  + ;

     }

     else

     {

         YsLineIndex32* lineIndexPtr = NULL;

         for (Yuint i = ; i < stacks; i++)

         {

             nOffset = (i * ) * indexStriding;

             lineIndexPtr = (YsLineIndex32*)(indexPtr + nOffset);

             lineIndexPtr->index0 = i *  + ;

             lineIndexPtr->index1 = i *  + ;

             nOffset += indexStriding;

             lineIndexPtr = (YsLineIndex32*)(indexPtr + nOffset);

             lineIndexPtr->index0 = i *  + ;

             lineIndexPtr->index1 = i *  + ;

             nOffset += indexStriding;

             lineIndexPtr = (YsLineIndex32*)(indexPtr + nOffset);

             lineIndexPtr->index0 = i *  + ;

             lineIndexPtr->index1 = i *  + ;

             nOffset += indexStriding;

             lineIndexPtr = (YsLineIndex32*)(indexPtr + nOffset);

             lineIndexPtr->index0 = i *  + ;

             lineIndexPtr->index1 = i *  + ;

             nOffset += indexStriding;

             lineIndexPtr = (YsLineIndex32*)(indexPtr + nOffset);

             lineIndexPtr->index0 = i *  + ;

             lineIndexPtr->index1 = i *  + ;

             nOffset += indexStriding;

             lineIndexPtr = (YsLineIndex32*)(indexPtr + nOffset);

             lineIndexPtr->index0 = i *  + ;

             lineIndexPtr->index1 = i *  + ;

             nOffset += indexStriding;

             lineIndexPtr = (YsLineIndex32*)(indexPtr + nOffset);

             lineIndexPtr->index0 = i *  + ;

             lineIndexPtr->index1 = i *  + ;

             nOffset += indexStriding;

             lineIndexPtr = (YsLineIndex32*)(indexPtr + nOffset);

             lineIndexPtr->index0 = i *  + ;

             lineIndexPtr->index1 = i *  + ;

         }

         nOffset = (stacks * ) * indexStriding;

         lineIndexPtr = (YsLineIndex32*)(indexPtr + nOffset);

         lineIndexPtr->index0 = stacks * ;

         lineIndexPtr->index1 = stacks *  + ;

     }

     return true;

 }

[17] 楼梯(Stairs)图形的生成算法的更多相关文章

[18] 螺旋楼梯(Spiral Stairs)图形的生成算法
顶点数据的生成 bool YfBuildSpiralStairsVertices ( Yreal radius, Yreal assistRadius, Yreal height, Yuint sli ...
[20] 鼓状物(Drum)图形的生成算法
顶点数据的生成 bool YfBuildDrumVertices ( Yreal radius, Yreal assistRadius, Yuint slices, Yuint stacks, YeO ...
[19] 半球形(Hemisphere)图形的生成算法
顶点数据的生成 bool YfBuildHemisphereVertices ( Yreal radius, Yuint slices, Yuint stacks, YeOriginPose orig ...
[16] 螺旋面(Spire)图形的生成算法
顶点数据的生成 bool YfBuildSpireVertices ( Yreal radius, Yreal assistRadius, Yreal height, Yuint slices, Yu ...
[15] 星星(Star)图形的生成算法
顶点数据的生成 bool YfBuildStarVertices ( Yreal radius, Yreal assistRadius, Yreal height, Yuint slices, YeO ...
[14] 齿轮(Gear Wheel)图形的生成算法
顶点数据的生成 bool YfBuildGearwheelVertices ( Yreal radius, Yreal assistRadius, Yreal height, Yuint slices ...
[13] 弧面(Arc)图形的生成算法
顶点数据的生成 bool YfBuildArcVertices ( Yreal radius, Yreal degree, Yreal height, Yuint slices, Yuint stac ...
[12] 扇形体(Fan)图形的生成算法
顶点数据的生成 bool YfBuildFunVertices ( Yreal radius, Yreal degree, Yreal height, Yuint slices, YeOriginPo ...
[11] 楔形体(Wedge)图形的生成算法
顶点数据的生成 bool YfBuildWedgeVertices ( Yreal width, Yreal length, Yreal height, YeOriginPose originPose ...

随机推荐

使用 Web 服务为 ECS Linux 实例配置网站及绑定域名
Nginx 服务绑定域名 https://help.aliyun.com/knowledge_detail/41091.html?spm=a2c4e.11155515.0.0.4lvCpF 以 YUM ...
虚拟机Ubuntu16.04 The system is running in low-graphics mode解决方法！！
虚拟机Ubuntu16.04无法进入图形界面 The system is running in low-graphics mode 安装的虚拟机Ubuntu16.04 64位本可以正常使用,在安装了许 ...
openwrt安装tcpdump
打开openwrt路由器的ssh功能 System->administration Ssh登陆 opkg update 会报很多错误措施如下: 备份 /etc/opkg.conf Cp /et ...
react篇章-React State(状态)-数据自顶向下流动
<!DOCTYPE html> <html> <head> <meta charset="UTF-8" /> <title&g ...
有了这套flex页面布局方案，页面什么的，那都不是事。
一.CSS3弹性盒子弹性盒子是CSS3的一种新布局模式.CSS3 弹性盒( Flexible Box 或 flexbox),是一种当页面需要适应不同的屏幕大小以及设备类型时确保元素拥有恰当的行为的布局 ...
CLR基础
一.各个语言的长处 ①非托管C/C++可对系统进行低级控制.可完全按照自己的想法管理内存,必要时方便地创建线程②使用Microsoft Visual Basic 6.0可以快速生成UI应用程序,并可以 ...
SQLSERVER——查看阻塞信息（sp_who_lock优化无误版）
经常会需要分析SQLSERVER的阻塞情况,尤其是某些SQL操作异常缓慢从而怀疑是有人在搞事情的情况下.网上有许多一模一样的帖子,是关于sp_who_lock这个存储过程的,然而,网上流传的这个是略有 ...
BZOJ1597 USACO2008土地购买
斜率优化DP. #include<bits/stdc++.h> using namespace std; ; long long f[N],n,cnt,q[N]; ; bool v[N]; ...
[BZOJ3638 && BZOJ3272]带修区间不相交最大K子段和(线段树模拟费用流)
https://www.cnblogs.com/DaD3zZ-Beyonder/p/5634149.html k可重区间集问题有两种建图方式,可能这一种才可以被线段树优化. 换个角度看,这也是一个类似 ...
Loj #6560 小奇取石子
题面分类讨论一波,n小的暴力2^n,n大的背包. #include<bits/stdc++.h> #define ll long long using namespace std; co ...

[17] 楼梯(Stairs)图形的生成算法

[17] 楼梯(Stairs)图形的生成算法的更多相关文章

随机推荐

热门专题