コード例 #1
0
ファイル: QuadTree.cs プロジェクト: longde123/xLODGen
        public QuadTree(ShapeDesc shapedesc, int quadLevel)
        {
            this.sampleSize = Game.sampleSize;
            // terrain/water
            if (shapedesc.name.ToLower(CultureInfo.InvariantCulture).Contains("land") || !shapedesc.textures[0].Contains("default.dds"))
            {
                isLand = true;
            }
            else
            {
                this.sampleSize = 1;
                this.isLand     = false;
            }
            this.vertices    = shapedesc.geometry.GetVertices();
            this.boundingBox = new BBox();
            this.boundingBox.Set(float.MaxValue, float.MinValue, float.MaxValue, float.MinValue, float.MaxValue, float.MinValue);
            this.segments = new QuadTreeLeaf[(int)(this.sampleSize * quadLevel * this.sampleSize * quadLevel)];
            for (int index = 0; index < (this.sampleSize * quadLevel) * (this.sampleSize * quadLevel); index++)
            {
                this.segments[index] = this.CreateSegment(index, quadLevel, shapedesc.geometry.GetTriangles(), shapedesc.geometry.GetVertices());
                boundingBox.GrowByBox(this.segments[index].boundingBox);
            }
            QuadTreeLeaf    quadTreeLeaf = new QuadTreeLeaf();
            List <Triangle> triangles    = shapedesc.geometry.GetTriangles();

            quadTreeLeaf.boundingBox.GrowByBox(boundingBox);
            quadTreeLeaf.triangles = triangles;
            this.entirequad        = quadTreeLeaf;
        }
コード例 #2
0
        private QuadTreeLeaf FindLeaf(QuadTreeNode node, Vector3 pt)
        {
            if (node.leaf != null)
            {
                return(node.leaf);
            }
            QuadTreeLeaf quadTreeLeaf = (QuadTreeLeaf)null;

            if ((double)pt[0] > (double)node.children[0].boundingBox.px1 && (double)pt[0] < (double)node.children[0].boundingBox.px2 && ((double)pt[1] > (double)node.children[0].boundingBox.py1 && (double)pt[1] < (double)node.children[0].boundingBox.py2))
            {
                quadTreeLeaf = this.FindLeaf(node.children[0], pt);
            }
            if ((double)pt[0] > (double)node.children[1].boundingBox.px1 && (double)pt[0] < (double)node.children[1].boundingBox.px2 && ((double)pt[1] > (double)node.children[1].boundingBox.py1 && (double)pt[1] < (double)node.children[1].boundingBox.py2))
            {
                quadTreeLeaf = this.FindLeaf(node.children[1], pt);
            }
            if ((double)pt[0] > (double)node.children[2].boundingBox.px1 && (double)pt[0] < (double)node.children[2].boundingBox.px2 && ((double)pt[1] > (double)node.children[2].boundingBox.py1 && (double)pt[1] < (double)node.children[2].boundingBox.py2))
            {
                quadTreeLeaf = this.FindLeaf(node.children[2], pt);
            }
            if ((double)pt[0] > (double)node.children[3].boundingBox.px1 && (double)pt[0] < (double)node.children[3].boundingBox.px2 && ((double)pt[1] > (double)node.children[3].boundingBox.py1 && (double)pt[1] < (double)node.children[3].boundingBox.py2))
            {
                quadTreeLeaf = this.FindLeaf(node.children[3], pt);
            }
            return(quadTreeLeaf);
        }
コード例 #3
0
ファイル: QuadTree.cs プロジェクト: longde123/xLODGen
        private QuadTreeLeaf CreateSegment(int segmentnumber, int quadLevel, List <Triangle> triangles, List <Vector3> vertices)
        {
            quadLevel = (int)(this.sampleSize * quadLevel);
            QuadTreeLeaf    quadTreeLeaf = new QuadTreeLeaf();
            List <Triangle> triangles1   = new List <Triangle>();
            int             segmentx     = segmentnumber / quadLevel;
            int             segmenty     = segmentnumber - (segmentx * quadLevel);

            quadTreeLeaf.boundingBox.Set(float.MaxValue, float.MinValue, float.MaxValue, float.MinValue, float.MaxValue, float.MinValue);
            BBox bbox = new BBox();

            bbox.Set((float)segmentx / quadLevel * 4096, ((float)segmentx + 1) / quadLevel * 4096, (float)segmenty / quadLevel * 4096, ((float)segmenty + 1) / quadLevel * 4096, 0f, 0f);
            for (int index = 0; index < triangles.Count; index++)
            {
                BBox tbox = new BBox(float.MaxValue, float.MinValue, float.MaxValue, float.MinValue, float.MaxValue, float.MinValue);
                for (int index2 = 0; index2 < 3; index2++)
                {
                    Vector3 vertex = vertices[triangles[index][index2]];
                    tbox.GrowByVertex(vertex);
                }
                if (tbox.px2 >= bbox.px1 && tbox.px1 <= bbox.px2 && tbox.py2 >= bbox.py1 && tbox.py1 <= bbox.py2)
                {
                    triangles1.Add(triangles[index]);
                    quadTreeLeaf.boundingBox.GrowByBox(tbox);
                }
            }
            quadTreeLeaf.triangles = triangles1;
            return(quadTreeLeaf);
        }
コード例 #4
0
 public List<Triangle> GetSegment(Vector3 vertex, int quadLevel)
 {
     int cursegment = 0;
     float x = vertex[0];
     float y = vertex[1];
     float z = vertex[2];
     QuadTreeLeaf quadTreeLeaf = new QuadTreeLeaf();
     quadLevel = (int)(this.sampleSize * quadLevel);
     int num1 = (int)(x / (4096 / quadLevel));
     int num2 = (int)(y / (4096 / quadLevel));
     if (num1 >= quadLevel)
         num1 = quadLevel - 1;
     if (num1 < 0)
         num1 = 0;
     if (num2 >= quadLevel)
         num2 = quadLevel - 1;
     if (num2 < 0)
         num2 = 0;
     cursegment = (quadLevel * num1) + num2;
     quadTreeLeaf = this.segments[cursegment];
     List<Triangle> triangles = new List<Triangle>();
     triangles = quadTreeLeaf.triangles;
     // x/y inside box
     if (x >= quadTreeLeaf.boundingBox.px1 && x <= quadTreeLeaf.boundingBox.px2 && y >= quadTreeLeaf.boundingBox.py1 && y <= quadTreeLeaf.boundingBox.py2)
     {
         if (isLand && z < quadTreeLeaf.boundingBox.pz1)
         {
             // z under box
             return null;
         }
         return triangles;
     }
     return new List<Triangle>();
     //return this.entirequad.triangles;
 }
コード例 #5
0
 public QuadTree(NiTriShapeData data, int quadLevel)
 {
     this.sampleSize = Game.sampleSize;
     // water
     if (data.GetBSNumUVSets() == 0)
     {
         this.sampleSize = 1;
         this.isLand = false;
     }
     else
     {
         isLand = true;
     }
     this.vertices = data.GetVertices();
     this.boundingBox = new BBox();
     this.boundingBox.Set(float.MaxValue, float.MinValue, float.MaxValue, float.MinValue, float.MaxValue, float.MinValue);
     this.segments = new QuadTreeLeaf[(int)(this.sampleSize * quadLevel * this.sampleSize * quadLevel)];
     for (int index = 0; index < (this.sampleSize * quadLevel) * (this.sampleSize * quadLevel); index++)
     {
         this.segments[index] = this.CreateSegment(index, quadLevel, data.GetTriangles(), data.GetVertices());
         boundingBox.GrowByBox(this.segments[index].boundingBox);
     }
     QuadTreeLeaf quadTreeLeaf = new QuadTreeLeaf();
     List<Triangle> triangles = data.GetTriangles();
     quadTreeLeaf.boundingBox.GrowByBox(boundingBox);
     quadTreeLeaf.triangles = triangles;
     this.entirequad = quadTreeLeaf;
 }
コード例 #6
0
ファイル: QuadTree.cs プロジェクト: longde123/xLODGen
 public QuadTree()
 {
     this.vertices    = new List <Vector3>();
     this.boundingBox = new BBox();
     this.segments    = new QuadTreeLeaf[0];
     this.entirequad  = new QuadTreeLeaf();
     this.sampleSize  = Game.sampleSize;
 }
コード例 #7
0
ファイル: QuadTree.cs プロジェクト: longde123/xLODGen
        public List <Triangle> GetSegment(Vector3 vertex, int quadLevel)
        {
            int          cursegment   = 0;
            float        x            = vertex[0];
            float        y            = vertex[1];
            float        z            = vertex[2];
            QuadTreeLeaf quadTreeLeaf = new QuadTreeLeaf();

            quadLevel = (int)(this.sampleSize * quadLevel);
            int num1 = (int)(x / (4096 / quadLevel));
            int num2 = (int)(y / (4096 / quadLevel));

            if (num1 >= quadLevel)
            {
                num1 = quadLevel - 1;
            }
            if (num1 < 0)
            {
                num1 = 0;
            }
            if (num2 >= quadLevel)
            {
                num2 = quadLevel - 1;
            }
            if (num2 < 0)
            {
                num2 = 0;
            }
            cursegment   = (quadLevel * num1) + num2;
            quadTreeLeaf = this.segments[cursegment];
            List <Triangle> triangles = new List <Triangle>();

            triangles = quadTreeLeaf.triangles;
            // x/y inside box
            if (x >= quadTreeLeaf.boundingBox.px1 && x <= quadTreeLeaf.boundingBox.px2 && y >= quadTreeLeaf.boundingBox.py1 && y <= quadTreeLeaf.boundingBox.py2)
            {
                if (isLand && z < quadTreeLeaf.boundingBox.pz1)
                {
                    // z under box
                    return(null);
                }
                if (isLand && z > quadTreeLeaf.boundingBox.pz2)
                {
                    return(new List <Triangle>());
                }
                return(triangles);
            }
            return(new List <Triangle>());
            //return this.entirequad.triangles;
        }
コード例 #8
0
        public QuadTreeLeaf FindLeaf(Vector3 pt)
        {
            QuadTreeLeaf quadTreeLeaf = (QuadTreeLeaf)null;

            if ((double)pt[0] > (double)this.nodes[0].boundingBox.px1 && (double)pt[0] < (double)this.nodes[0].boundingBox.px2 && ((double)pt[1] > (double)this.nodes[0].boundingBox.py1 && (double)pt[1] < (double)this.nodes[0].boundingBox.py2))
            {
                quadTreeLeaf = this.FindLeaf(this.nodes[0], pt);
            }
            if ((double)pt[0] > (double)this.nodes[1].boundingBox.px1 && (double)pt[0] < (double)this.nodes[1].boundingBox.px2 && ((double)pt[1] > (double)this.nodes[1].boundingBox.py1 && (double)pt[1] < (double)this.nodes[1].boundingBox.py2))
            {
                quadTreeLeaf = this.FindLeaf(this.nodes[1], pt);
            }
            if ((double)pt[0] > (double)this.nodes[2].boundingBox.px1 && (double)pt[0] < (double)this.nodes[2].boundingBox.px2 && ((double)pt[1] > (double)this.nodes[2].boundingBox.py1 && (double)pt[1] < (double)this.nodes[2].boundingBox.py2))
            {
                quadTreeLeaf = this.FindLeaf(this.nodes[2], pt);
            }
            if ((double)pt[0] > (double)this.nodes[3].boundingBox.px1 && (double)pt[0] < (double)this.nodes[3].boundingBox.px2 && ((double)pt[1] > (double)this.nodes[3].boundingBox.py1 && (double)pt[1] < (double)this.nodes[3].boundingBox.py2))
            {
                quadTreeLeaf = this.FindLeaf(this.nodes[3], pt);
            }
            return(quadTreeLeaf);
        }
コード例 #9
0
 private QuadTreeLeaf CreateSegment(int segmentnumber, int quadLevel, List<Triangle> triangles, List<Vector3> vertices)
 {
     quadLevel = (int)(this.sampleSize * quadLevel);
     QuadTreeLeaf quadTreeLeaf = new QuadTreeLeaf();
     List<Triangle> triangles1 = new List<Triangle>();
     int segmentx = segmentnumber / quadLevel;
     int segmenty = segmentnumber - (segmentx * quadLevel);
     quadTreeLeaf.boundingBox.Set(float.MaxValue, float.MinValue, float.MaxValue, float.MinValue, float.MaxValue, float.MinValue);
     BBox bbox = new BBox();
     bbox.Set((float)segmentx / quadLevel * 4096, ((float)segmentx + 1) / quadLevel * 4096, (float)segmenty / quadLevel * 4096, ((float)segmenty + 1) / quadLevel * 4096, 0f, 0f);
     for (int index = 0; index < triangles.Count; index++)
     {
         BBox tbox = new BBox(float.MaxValue, float.MinValue, float.MaxValue, float.MinValue, float.MaxValue, float.MinValue);
         for (int index2 = 0; index2 < 3; index2++)
         {
             Vector3 vertex = vertices[triangles[index][index2]];
             tbox.GrowByVertex(vertex);
         }
         if (tbox.px2 >= bbox.px1 && tbox.px1 <= bbox.px2 && tbox.py2 >= bbox.py1 && tbox.py1 <= bbox.py2)
         {
             triangles1.Add(triangles[index]);
             quadTreeLeaf.boundingBox.GrowByBox(tbox);
         }
     }
     quadTreeLeaf.triangles = triangles1;
     return quadTreeLeaf;
 }