zoukankan      html  css  js  c++  java
  • 球中的initVertex

    private void initVertex(float r) {
    		// TODO Auto-generated method stub
    		R=r;
    		ArrayList<Float>alVertix=new ArrayList<Float>();
    		for(float vAngle=90;vAngle>-90;vAngle-=angleSpan){
    			for(float hAngle=360;hAngle>0;hAngle-=angleSpan){
    				float x1=getCoor(0, vAngle, hAngle);
    				float y1=getCoor(1, vAngle, hAngle);
    				float z1=getCoor(2, vAngle, hAngle);
    				
    				float x2=getCoor(0, vAngle-angleSpan, hAngle);
    				float y2=getCoor(1, vAngle-angleSpan, hAngle);
    				float z2=getCoor(2, vAngle-angleSpan, hAngle);
    				
    				float x3=getCoor(0, vAngle-angleSpan, hAngle-angleSpan);
    				float y3=getCoor(1, vAngle-angleSpan, hAngle-angleSpan);
    				float z3=getCoor(2, vAngle-angleSpan, hAngle-angleSpan);
    				
    				float x4=getCoor(0, vAngle, hAngle-angleSpan);
    				float y4=getCoor(1, vAngle, hAngle-angleSpan);
    				float z4=getCoor(2, vAngle, hAngle-angleSpan);
    				
    				alVertix.add(x1);alVertix.add(y1);alVertix.add(z1);
            		alVertix.add(x2);alVertix.add(y2);alVertix.add(z2);
            		alVertix.add(x4);alVertix.add(y4);alVertix.add(z4);        		
            		//构建第二三角形
            		alVertix.add(x4);alVertix.add(y4);alVertix.add(z4);
            		alVertix.add(x2);alVertix.add(y2);alVertix.add(z2);
            		alVertix.add(x3);alVertix.add(y3);alVertix.add(z3); 
    			}
    		}
    		 vCount=alVertix.size()/3;
    	        float vertices[]=new float[vCount*3];
    	    	for(int i=0;i<alVertix.size();i++){
    	    		vertices[i]=alVertix.get(i);
    	    	}
    	        ByteBuffer vbb = ByteBuffer.allocateDirect(vertices.length*4);
    	        vbb.order(ByteOrder.nativeOrder());
    	        mVertexBuffer = vbb.asFloatBuffer();
    	        mVertexBuffer.put(vertices);
    	        mVertexBuffer.position(0);
    	}
    

  • 相关阅读:
    J Identical Trees(求俩个树转化所需的最小代价,hash判同构,费用流求转移代价)
    I Tournament(俩人一组,构造最少排队总时间)
    D
    purfer序列(有关度数与生成树个数情况)
    博客园自定义样式
    莫比乌斯知识点整理
    随笔日记
    牛客小白月赛16
    Codeforces Round #555 (Div. 3)
    Codeforces Round #553 (Div. 2)
  • 原文地址:https://www.cnblogs.com/Anzhongliu/p/6092069.html
Copyright © 2011-2022 走看看