[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 ...

随机推荐

Vue中directives的用法
关于 vue 中 directives 的用法问题,详细可以参考vue官方对directives的解释当前文章主要讲述directives怎么用,directives做权限按钮的功能 ###1. d ...
eschop购物实现立即购买和加入购物车
后台=>平台=>商店设置=>购物流程是否一步购物设置为否 2:修改代码 .js/common.js function addToCartShowDivResponse(result ...
php利用root权限执行shell脚本（转）
转一篇博客,之前搞这个东西搞了好久,结果今天晚上看到了一篇救命博客,瞬间开心了...转载转载利用sudo来赋予Apache的用户root的执行权限,下面记录一下: 利用PHP利用root权限执行sh ...
rabbitmq学习（二） —— helloword!
rabbitmq学习当然是跟着官网走最好了,官网的教程写的很好,跟着官网教程走一遍就会有个初步了解了下面的教程转自http://cmsblogs.com/?p=2768,该博客对官网的翻译还不错介 ...
Elasticsearch源码分析 | 单节点的启动和关闭
本文主要简要介绍Elasticsearch单节点的启动和关闭流程.Elasticsearch版本:6.3.2 相关文章 1.Google Guice 快速入门 2.Elasticsearch 中的 G ...
Django url 标签和reverse()函数的使用（转）
使用url标签和reverse()函数,可以避免在模板和view中对url进行硬编码,这样即使url改变了,对模板和view也没有影响, 其实在模板, view中,如果想获取当前访问的url,那用re ...
UVA1378 A funny stone game
博弈论. 就是有一堆石子你拿走一堆中的一个,然后再向后面两堆中加两个问胜负 i<j<=k 所以我们可以直接通过sg函数计算,考虑问题的奇偶性,如果这一位是奇的我们才考虑,偶的可以模仿然后 ...
luoguP2490 [SDOI2011]黑白棋博弈论 + 动态规划
博弈部分是自己想出来的,$dp$的部分最后出了点差错QAQ 从简单的情况入手比如$k = 2$ 如果有这样的局面:$\circ \bullet $,那么先手必输,因为不论先手怎样移动,对手都 ...
C++ tuple类型
前言最近在看C++ Primer的时候,对于对象移动一直不太懂,所以在查找各种资料,仔细研究代码后,打算写篇博客记录下来,果然还是不要得过且过,看见不懂的就查,弄懂为止最好了. 对象移动很多时候都 ...
PAT甲级1131. Subway Map
PAT甲级1131. Subway Map 题意: 在大城市,地铁系统对访客总是看起来很复杂.给你一些感觉,下图显示了北京地铁的地图.现在你应该帮助人们掌握你的电脑技能!鉴于您的用户的起始位置,您的任 ...

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

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

随机推荐

热门专题