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

随机推荐

Bootstrap--响应式图片轮播
<div class="row"> <div class="span12"> <section id="carousel ...
004 爬虫（最初的爬虫方式，以及urllib2)
一:最初的爬取方式 1.代码示例 # coding=utf-8 import urllib2 request=urllib2.Request("http://www.baidu.com&qu ...
Mongodb C#客户端数据关联数据，使用Linq语法进行关联
在Mongodb C# drivers 文档官方地址:https://docs.mongodb.com/ecosystem/drivers/csharp/ 基础的使用请参考<c# Mongod ...
QString::arg()//用字符串变量参数依次替代字符串中最小数值
QString i = "iTest"; // current file's number QString total = "totalTest&qu ...
CTF实验吧让我进去writeup
初探题目两个表单,我们用burp抓包试试这时候我们发现Cookie值里有个很奇怪的值是source,这个单词有起源的意思,我们就可以猜测这个是判断权限的依据,让我们来修改其值为1,发送得到如下显示 ...
@react-native-community/async-storage在Android上的手动link问题
PS C:\Users\linjin\Desktop\RN_APP> react-native link @react-native-community/async-storage error ...
APP的UI自动化测试框架及平台化探索
顾铮,10年+测试及测试开发相关经验,2014年加入京东,曾主导设计开发UI测试框架,参与CI测试平台建设,现负责iOS侧的工具,框架建设.在UI自动化,性能测试,单元测试方面有较深入研究,在App, ...
BZOJ.2339.[HNOI2011]卡农(思路 DP 组合容斥)
题目链接 \(Description\) 有\(n\)个数,用其中的某些数构成集合,求构造出\(m\)个互不相同且非空的集合(\(m\)个集合无序),并满足每个数总共出现的次数为偶数的方案数. \(S ...
Android源码目录结构详解
Android 4.0|-- Makefile|-- bionic (bionic C库)|-- bootable (启动引导相关代码)|-- build (存放系统编译规则及generic等基础开发 ...
hdu 1150 Machine Schedule 最少点覆盖
Machine Schedule Time Limit: 1 Sec Memory Limit: 256 MB 题目连接 http://acm.hdu.edu.cn/showproblem.php? ...

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

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

随机推荐

热门专题