• <tr id="yyy80"></tr>
  • <sup id="yyy80"></sup>
  • <tfoot id="yyy80"><noscript id="yyy80"></noscript></tfoot>
  • 99热精品在线国产_美女午夜性视频免费_国产精品国产高清国产av_av欧美777_自拍偷自拍亚洲精品老妇_亚洲熟女精品中文字幕_www日本黄色视频网_国产精品野战在线观看 ?

    Collision detection of virtual plant based on bounding volume hierarchy: A case study on virtual wheat

    2018-02-05 07:10:42TANGLiangSONGWeiguoHOUTianchengLIULeileiCAOWeixingZHUYan
    Journal of Integrative Agriculture 2018年2期

    TANG Liang, SONG Wei-guo, HOU Tian-cheng, LIU Lei-lei, CAO Wei-xing, ZHU Yan

    National Engineering and Technology Center for Information Agriculture/Key Laboratory for Crop System Analysis and Decision Making, Ministry of Agriculture/Jiangsu Key Laboratory for Information Agriculture/Jiangsu Collaborative Innovation Center for Modern Crop Production/Nanjing Agricultural University, Nanjing 210095, P.R.China

    1. Introduction

    Collision detection in virtual environments is of considerable importance in computer animation, physical simulation, and robotics (Lin and Gottschalk 1998; Jimenezet al. 2001).Several collision detection methods have been proposed,such as space partitioning tree (Nayloret al. 1990; Vaně?ek 1991), biomimetic pattern recognition (Xiaoet al. 2015),distance computations between convex objects (Van Den Bergen 1999), bounding volume hierarchy (BVH) (Van Den Bergen 1997; Klosowskiet al. 1998; Wilsonet al. 1999), and interference detection using graphics hardware and image space (Knot and Pai 2003). BVH is considered an effective collision detection algorithm due to its extensive application and robustness. Different methods have been used for the development of BVHs such as sphere (Wilsonet al. 1999),Axis-Aligned Bounding Box (AABB) (Van Den Bergen 1997),Oriented Bounding Box (OBB) (Gottschalket al. 1996), and K-Discrete Orientation Polytopes (Klosowskiet al. 1998).These BVH methods have strengths and weaknesses, and should be selected according to the intended application(M?lleret al. 2008).

    The use of virtual plants was first proposed approximately 20 years ago and can be applied in research, education/extension, and decision support in relation to plant breeding and management, landscape architecture, entertainment,and art (Roomet al. 1996; DeJonget al. 2011). Currently,many studies on plant visualization focus on the development of organ geometric models and 3D visualization (Zhanget al.2013, 2017). The phenomenon of plant organ intersection often occurs during the process of 3D visualization of plant morphology and reduces the realism of plant visualization.Thus, collision detection of plant organs is very important for accurate visualization of the characteristics of plant morphology and canopy structure.

    Several previous studies on collision detection of virtual plants that avoid intersection of plant organs have been proposed. Fowleret al. (1992) presented a collision-based model of spiral phyllotaxis for detecting and eliminating collisions between neighboring primordia, however this method cannot be used in a complex plant canopy. Wuet al.(2011) studied collision detection of leaves in gramineous crop using the K-Discrete Orientation Polytopes method,but detection precision still should be improved. Qinet al.(2012) presented a collision detection method for maize using a combined OBB based on triangular data obtained from a digitizer to improve the accuracy and reliability.However, the methods for OBB construction and intersection detection are generally time-consuming. Thus, methods on collision detection among plants canopy need to be improved with regard to accuracy, computing speed, and practical application.

    The objectives of this study are: 1) to optimize computing efficiency and detection accuracy by developing a collision detection method based on BVH for plant visualization according to the characteristics of 3D plant morphology and canopy structure; 2) to apply the method of collision detection to wheat visualization at the organ, individual and population scales, and evaluate the effects on the visualization.

    2. Materials and methods

    2.1. Visualization of wheat crop

    The morphological models of wheat used in this study were developed based on simulation dynamics of leaves (Chenet al. 2007), leaf sheaths and internodes (Zhuet al. 2009),panicle morphology (Tanet al. 2006) and stem-sheath angle (Zhanget al. 2011), and leaf color in relation to thermal time (Zhuet al. 2008). Using the OpenGL library,geometric models for visualization of different organs were developed using geometric shapes (e.g., cylinder) and nonuniform rational B-splines (Wuet al. 2009). The dynamic visualization of wheat at the organ, tiller, and population scales was developed (Tanget al. 2008; Wuet al. 2009; Leiet al. 2011) and improved (Tanget al. 2011) by integration of morphological models and geometric models.

    2.2. An overview of the procedures of wheat collision detection

    A overview of the procedures of wheat collision detection in this study is presented in Fig. 1. First, the triangular data of leaves are generated with the tessellation of non-uniform rational B-splines surfaces (Wuet al. 2009). Second,triangle-triangle intersection detection is performed by the interval overlap method (M?ller 1997), and then BVs and BVHs of leaves were constructed based on the leaf morphological characteristics using the Separating Axis Theorem (Ericson 2004). Third, the collision detection of two leaves was performed by using the depth-first search algorithm (Ericson 2004). Finally, the BVs of other organs(ear, stem, and leaf sheath) in virtual wheat plant were constructed based on their geometric morphology, and the collision detections were conducted at the organ, individual,and population levels.

    2.3. Leaf tessellation

    Tessellation, also called surface subdivision, is the subdivision of concave polygons or polygons with intersecting edges into convex polygons (M?lleretet al.2008; Shreiner 2009). Using the OpenGL utility library, nonuniform rational B-splines objects are compartmentalized into lines and triangles (or polygons). Vertices data can be obtained through non-uniform rational B-splines surface mesh division with a callback function in OpenGL. Fig. 2-A and B show a normal wheat leaf and a meshed leaf based on existing leaf morphological modeling (Wuet al. 2009).

    2.4. Efficiency of triangle-triangle intersection detection

    Collisions among leaves detected by meshed triangles on the leaf surface are highly accurate at the final stage of collision detection based on BVHs. The interval overlap method presented by M?ller (1997) is used to detect triangletriangle collision. However, the detection efficiency between plant organs still needs to be improved. For two leaves,supposing that the numbers of triangles are N1and N2after tessellation and the detection time for a pair of triangles is Costi, the total detection time (TDT) is calculated by the following equation:

    Fig. 1 An overview of the procedures of collision detection in this study. BVs, bounding volumes; BVHs, bounding volume hierarchies.

    Fig. 2 Tessellation of leaf. A, a normal wheat leaf. B, a meshed wheat leaf.

    If the value of Costi is fixed, the speed of collision detection is limited by N1and N2. To enhance the efficiency of collision detection, the number of triangles is minimized after tessellation. The reduced number of triangles is checked and non-intersecting triangles are removed.

    2.5. Bounding volume hierarchy of leaf

    The leaf-nodes in BVH wrap all geometric models in the space and each parent node contains the geometric spacing of successor nodes. In the process, BV detection is performed before conducting triangle detection, which can improve detection efficiency by significantly reducing the time complexity by incorporating BVs into the tree structure(Ericson 2004).

    2.6. Selection of bounding volume hierarchy method

    The type of BVH to select depends upon the characteristics of the object being visualized. The basic cost function wasfirst formulated by Weghorstet al. (1984), first applied by Gottschalket al. (1996) and later enhanced by Klosowskiet al. (1998):

    Where, T is the total execution time for detecting interference,NVis the number of BV pairs for intersection tests,CVis the time required for testing a pair of bounding volume intersections,NPis number of primitive pairs overlapping in the tests,CPis the time required for testing a pair of primitives for interference;NUis the number of nodes that need to be updated, andCUis the time cost of updating each node.

    In the process of plant organ assembly, different organs(leaf, stem, and ear) and their BVs rotate and move one or more times. Hence, the preferred BV should have: (1) a relatively low calculation of creation; (2) low calculation of updating after rotation; (3) better tightness; and (4) faster overlap testing.

    2.7. Development of BVs and BVHs for leaves

    BVH development requires two steps: 1) building a BV for each triangle; and 2) building a tree structure and incorporating BVs into the tree structure. AABBs are created for triangles or organs by taking the maximum and minimum extents of these objects along each axis. A rotation matrix is used for the BVs rotation in order to reduce the computation time of the AABB.

    The algorithm for tree structure development used in this study is the top-down algorithm (M?lleret al. 2008). After leaf tessellation, the BVs of triangles (S) are calculated to determine whether the BV is a leaf-node (minimum BV). If it is, we set the node type and save the triangle data of that node. Otherwise, the cutting point is computed to divide the set S into two subsets, and then a cutting point is computed for each subset (Fig. 3).

    We assumed that a set (Si) with a number (j) of triangles is obtained from leaf tessellation. Among thejtriangles there are a certain number (k) of the mass points which have differentx-coordinates. The two segmented triangle setsSi′ andSi′′ derived fromSiare as follows:

    Where,p1,p2, andp3are thex-coordinates of the vertices of the triangle set and t is the average value of thosex-coordinates of thektriangles.

    2.8. Collision detection and response

    After leaf BVH development, BVs of root-node (the largest BV) need to be traversed to detect collisions. The traversal method used in this study is the depth-first search algorithm,which traverses or searches a tree or graph. The algorithm begins at the root (selecting some node as the root in the graph case) and explores as far as possible along each branch before backtracking (Knuth 2005). The 2 BVs maintain the same depth during the traverse, which is also called synchronous depth-first traversal (Ericson 2004).Separating Axis Theorem is used to detect the intersection of leaf BVs (Gottschalket al. 1996; Ericson 2004). The response method after collision is to redraw the model by rotating the leaf by a certain angle around the stem according to the positions of leaves, which would not change the morphology of organs (Wuet al. 2011).

    Fig. 3 Building bounding volume hierarchy of a leaf.

    3. Results

    3.1. Collision detection between leaves

    Based on an existing wheat morphological model and visualization technique (Wuet al. 2009; Tanget al. 2011),a virtual experiment is conducted for evaluation of the new collision detection method using the cultivar Yangmai 9 and weather data from 1997 to 1998 in Nanjing, China under the condition of potential growth (assuming no water or nutrient limitation). The row spacing was 18 cm×18 cm. A pair of identical triangular data obtained from the fourth leaf on the main stem is to apply the collision detection algorithm. Two normal leaves (light and deep black for clear distinction)are used for the collision detection process (Fig. 4-A).First, the BVHs are built for the two leaves (Fig. 4-B), then intersecting BVs are detected (Fig. 4-C). All triangles in leaf-nodes of the intersecting BVs are obtained (Fig. 4-D)providing a pair of intersecting triangles (Fig. 4-E). When intersecting triangles are detected (Fig. 3-F), we conclude that the leaves intersect.

    3.2. Performance test for collision detection between leaves

    Intersection detection speedThe performance of the proposed Leaf Collision Detection (LCD) method was tested on the graphic workstation HPZ600 (HP, USA) and compared with the traditional AABB tree algorithm (M?lleret al. 2008), and with the package of Robust and Accurate Polygon Interference Detection based on the OBB tree algorithm (Gottschalket al. 1996). The test results are listed in Table 1.

    AABB tree is the traditional Axis-Aligned Bounding Box hierarchy algorithm; OBB is Oriented Bounding Boxes tree algorithm; LCD is the algorithm of leaf collision detection developed in this study.

    Initialization time is the time for building BVs and BVHs.Intersection detection time is for traversing two BVHs and intersection detection of the BVs. Update re-computation after collision and response is the time for one more collision test after building the BVH by rotating the leaf once. Nonintersection detection time is the time for one intersection detection computation of the root nodes of two BVHs.

    Overall, LCD detection speed is faster than the original AABB tree and OBB tree methods (Table 1). During the initialization phase, the original AABB tree and LCD required more time to calculate the longest axis of the triangle set and dividing the set into two subsets. OBB took more time to calculate the minimum BV of the triangle set.

    The LCD and AABB tree take the longest axis of a BV as thex-axis when creating the BV. Although LCD and AABB tree lose some tightness compared with OBB, their initialization times are reduced by about two thirds of OBB.In the intersection test stage, LCD and AABB have the same number of leaf-node triangles which are greater than OBB.Therefore, the speed of intersection detection of AABB and LCD is slightly slower than that of OBB, respectively. In the process of updating and detection after collision, the LCD and OBB are faster than AABB because neither is required to build hierarchies again.

    With regard to the non-intersection detection, AABB tree requires detection of two intersecting BVs at XYZ axes. The BVs in LCD perpendicular to the plane XOY requires five potential separating axes, which is more complex than that in AABB tree and less than that in OBB tree which requires 15 potential separating axes (Gottschalket al. 1996).

    Overall, LCD has better initialization time and recomputation time after collision as well as similar performance on intersection detection time and noninterception detection time. These factors make LCD faster than the AABB and OBB methods.

    Tightness of bounding volume The volume of the leaf in question reflects the tightness of the BV of that leaf (M?lleret al. 2008). Unlike OBB and LCD, the volume of AABB varies with the leaf’s rotation angle around thez-axis. For example, a leaf has a length of 19.67 cm, a maximum breadth of 1.60 cm, and an angle between the stem and leaf of 30°. When the leaf rotates to 45°, the volume is 14.6 cm3as calculated by the minimum OBB computation method proposed by Barequet and Har-Peled (2001) compared with 104.1 and 25.5 cm3for AABB and LCD, respectively(Fig. 5). Thus, from the characteristics of the three detection methods, the order of the BV tightness of LCD is significantly higher than that of AABB and slightly lower than that of OBB.However, LCD does not compute the minimum BV which is commonly used for OBB. The speed of building a BV and BVH in LCD was faster than that in OBB tree, respectively.Overall, the LCD method had a better balance between tightness and efficiency.

    Fig. 4 Collision detection of leaf-leaf. A, two intersecting leaves. B, the bounding volumes and hierarchies of two leaves. C, the intersecting bounding volume of two leaves. D, the intersecting bounding volumes in leaf-node. E, a pair of intersecting triangles.F, all the intersecting triangles.

    Table 1 Performance comparisons of different algorithms for leaf collision detection

    3.3. Building hierarchies for all organs on a single tiller of wheat

    According to the wheat canopy structure, most of collisions happen between leaves and other organs (leaf sheath,stem, and ear). Collisions between leaf sheaths, ears,and stems are infrequent. Based on the output parameters from the morphological model (Tanet al. 2006; Zhuet al.2009), the BVs are simply built for wheat ears (Fig. 6-A),internodes (Fig. 6-B), and leaf sheaths (Fig. 6-C). No BVHs are built for them. Therefore, the intersection detection between leaf and other organs is the intersection detection of BVHs and BVs.

    Bounding volumes of ears, stems, and leaf sheaths and the hierarchies of leaves in tillers are created to detect collision between tillers (Fig. 7-A and B). In order to rapidly determine a potential collision between organs, BVHs of tiller is created which regards different organs as basic graphic elements, and the longest axis hierarchy classification method is used to create the BVs of different organs on a tiller (Fig. 7-C and D) (M?lleret al. 2008).

    Fig. 5 Bounding volumes with the methods of Axis-Aligned Bounding Box (AABB, A), Oriented Bounding Box (OBB, B)and Leaf Collision Detection (LCD, C) when leaf rotates to 45°C from z-axis.

    Fig. 6 Bounding volumes of different organs (A, ear; B,internode; C, leaf sheath).

    3.4. Collision detection and response between tillers

    The process of collision detection and response of two tillers are presented in Fig 7. Fig. 8-A assumes there are two colliding tillers. The leaves on a tiller collide with the organs (ear, leaf, and stem) on another tiller (Fig. 8-B-1, 2,and 3, respectively). BVs and hierarchies of two tillers are created (Fig. 8-C). BVs of organs on the single tillers are traversed and detected (Fig. 8-D). Then collision detection between organs is performed (Fig. 8-E) and the colliding organs are identified (Fig. 8-F). The collision response method performs and renews leaf matrices (Fig. 8-G) (Wuet al. 2011). Fig. 8-H shows the effects of the visualization of two single tillers after collision.

    3.5. Collision detection of wheat population

    Collisions among wheat populations are closely correlated with plant number and planting space. The leaf-sheath angle and the leaf-stem angle are set to random values to check the universality of the collision algorithm in a wheat population that has six rows, six columns, and three tillers on each plant (Fig. 9-A). The entire hierarchies of tillers,hierarchies of leaves, and BVs of ears and stems are presented in Fig. 9-B–E. Collision detection is performed and intersecting BVs and triangles are shown in Fig. 9-F and G. The response method is to rotate the colliding leaf to a certain angle around the stem according to the positions of leaves. Due to complexity of the topological structure of wheat, the process of leaf rotation might lead to other collisions. Therefore, we continued renewing leaf matrices and performing collision detection until there are no or few collisions. The possibility of collision is reduced significantly after collision detection and redrawing compared to the original collisions (Fig. 9-H).

    Fig. 7 Bounding volume hierarchy of a wheat tiller. A, a wheat tiller. B, bounding volumes of ears, stems, and leaf sheaths and the hierarchies of leaves in the tiller. C, tiller hierarchies regarding different organs as basic graphic elements. D, all bounding volumes and hierarchies in the tiller.

    Fig. 8 Collision detection between two wheat tillers. A, two tillers. B, collision positions of two tillers. C, bounding volumes and hierarchies of two tillers. D, collisions of the bounding volumes and the hierarchies of two tillers. E, performing collision detection. F, identifying the colliding organs. G,response of collision. H, effects of collision response.

    Fig. 9 Collision detection among wheat population. A, a wheat population. B, bounding volume hierarchies (BVHs) and bounding volumes (BVs) of single tillers. C, hierarchies of the leaves. D, bounding volumes of the ears. E, bounding volumes of the stems.F, identifying the colliding organs. G, the intersecting bounding volumes. H, effects after collision response.

    4. Discussion

    The phenomenon of intersection among different organs in the process of plant visualization decreases the realism.Proper simulation of collisions is crucial for realistic animation of plant development (Fowleret al. 1992).Computational efficiency and detection accuracy are also important factors in visualization of large plant populations,due to the large number of collisions between different organs in crop canopies. Previous studies and methods on collision detection for crop visualization have efficiency and accuracy disadvantages and limitations (Fowleret al.1992; Wuet al. 2011; Qinet al. 2012).

    With the aim of increasing computational efficiency and detection accuracy, this study addresses the selection and creation of BVs and BVHs for collision detection. Few of the commonly-used BV can meet the requirements of the basic cost function (eq. (2)). For example, spheres have a poor compactness for wheat organs; AABBs require updating after rotation, and the worst compactness is observed when a leaf rotates 45° along they-axis. Additionally, the computation for the initialization and detection of the OBBs are relatively slow. The K-Discrete Orientation Polytopes method requires conversion of all triangle vertices to new spaces (Klosowskiet al. 1998; Ericson 2004), i.e., all triangle vertices will have a matrix multiplication. Here, we take advantage of different types of BVs and BVHs according to the characteristics of wheat morphology and canopy structure.

    At the organ level, AABB is used for creating BVs, which is more efficient than OBB in the initialization phase. When tillers are assembled, a rotation matrix is computed and saved to avoid repeating computation of AABB and also to increase the tightness of BV (Fig. 5). There are three main algorithms for building a tree structure: A bottom-up method,an incremental tree insertion, or a top-down approach(M?lleret al. 2008). Among them, the top-down algorithm,which is used by the majority of hierarchy construction algorithms, is the fastest (Knuth 2005). After creation of leaf BVHs in which BVs at the root-node are intersected,they need to be traversed. Commonly traversal methods include the breadth-first search algorithm which start at the tree root and explores the neighbor nodes, before moving to the next level neighbors, and the depth-first search algorithm (Knuth 2005). Compared with the breadth-first search algorithm, the depth-first search algorithm used in this study is the most common option in the system of collision detection, due to its significantly lower demand on memory space during the traverse (M?lleret al. 2008).At the intersection detection phase, utilizing Separating Axis Theorem proposed by Gottschalket al. (1996) and the traversal hierarchy principle, the intersection detection was implemented at leaf, tiller, and population levels. The Separating Axis Theorem to detect collisions between OBBs requires computing 2N-1 direction matrices and N times of matrix inversion computation (N is the height of OBB tree).LCD, using the same direction BV (Fig. 3), only needs to save one rotation matrix and compute the matrix inversion once. In particular, Gottschalket al. (1996) tested 15 potential separation axes to determine whether two OBBs intersect by using Separating Axis Theorem. With the LCD method, only five potential separation axes are needed due to most of leaves and sheaths rotating and moving along thez-axis (Fig. 3).

    At the tiller and population levels, regarding organs as basic graphic elements, the longest axis hierarchy classification method is used to develop BVHs of tillers to enhance detection efficiency, which efficiently excludes non-intersecting organs (M?lleret al. 2008). A simple method for the response to collision detection is to rotate a leaf to a certain angle (Wuet al. 2011). After this rotation,the number of clashes decreases significantly but did not totally disappear due to high density of plant organs in a plant population (Fig. 9-H). The response method should be further improved to enhance the efficiency and accuracy.

    Several methods for collision detection have been developed for different purposes, but only two classic methods (AABB and OBB) are compared in this study.More algorithms and technologies should be compared and developed for plant collision in future studies. Although this method for collision detection has improved efficiency,the speed of leaf triangular data acquisition also should be further improved when there are a large number of leaves in a large population to enhance the efficiency of visualization(Duet al. 2017; Yonget al. 2017).

    5. Conclusion

    With the aim of accurate visualization of crops, the phenomenon of organ cross-drawing was addressed with a method for collision detection of plant organs based on BVHs. The collision detection method is applied on wheat and presented at the leaf, tiller, and population levels which showed a good balance between computing efficiency and detection accuracy for improving the realism of 3D visualization of wheat crops.

    Acknowledgements

    This work was supported by the National High-Tech Research and Development Program of China (2013AA102404), the National Science Fund for Distinguished Young Scholars,China (31725020), the Priority Academic Program Development of Jiangsu Higher Education Institutions(PAPD), China and the 111 Project, China (B16026). We would also like to thank Dr. Alison Beamish at the University of British Columbia for her assistance with English language and grammatical editing of the manuscript.

    Barequet G, Har-Peled S. 2001. Efficiently approximating the minimum-volume bounding box of a point set in three dimensions.Journal of Algorithms, 38, 91–109.

    Van Den Bergen G. 1997. Efficient collision detection of complex deformable models using AABB trees.Journal of Graphics Tools, 4, 1–13.

    Van Den Bergen G. 1999. A fast and robust GJK implementation for collision detection of convex objects.Journal of Graphics Tools, 4, 7–25.

    Chen G Q, Zhu Y, Liu H, Cao W X. 2007. Modeling leaf growth dynamics in winter wheat.Acta Agronomica Sinica, 31,1524–1527. (in Chinese)

    Dave K, Dinesh K P. 2003. CInDeR: Collision and Interference Detection in Real-time using graphics hardware. In:Proceedings of Graphics Interface 2003.Halifax, Nova Scotia, Canada. pp. 73–80.

    Dejong T M, Silva D D, Vos J, Escobargutiérrez A J. 2011. Using functional-structural plant models to study, understand and integrate plant development and ecophysiology.Annals of Botany, 108, 987–989.

    Du P, Liu E S, Suzumura T. 2017. Parallel continuous collision detection for high-performance GPU cluster. In:Proceedings of the 21st ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games. ACM 2017, New York, USA.

    Ericson C. 2004.Real-Time Collision Detection. CRC Press,Inc. Boca Raton, FL, USA. pp. 553–575.

    Fowler D R, Prusinkiewicz P, Battjes J. 1992. A collision-based model of spiral phyllotaxis. In: Thomas J J, ed.,Conference on Computer Graphics and Interactive Techniques,SIGGRAPH:Proceedings of the 19th Annual Conference on Computer Graphics and Interactive Techniques. ACM.Chicago, IL, USA. pp. 361–368.

    Gottschalk S, Lin M C, Manocha D. 1996. OBBTree: A hierarchical structure for rapid interference detection. In:Fujii J, ed.,SIGGRAPH 1996: Proceedings of The 23Rd Annual Conference on Computer Graphics and Interactive Techniques. ACM, New Orleans, LA, USA. pp. 171–180.Jiménez P, Thomas F, Torras C. 2001. 3D collision detection:A survey.Computers and Graphics, 25, 269–285.

    Klosowski J T, Held M, Mitchell J S, Sowizral H. 1998. Efficient collision detection using bounding volume hierarchies of k-DOPs.IEEE Trans Vis Computer Graphics, 4, 21–36.

    Knott D, Pai D K. 2003. CInDeR: Collision and interference detection in real-time using graphics hardware. In:Proceedings of Graphics Interface. Canadian Human-Computer Communications Society, Vancouver, Canada.pp. 73–80.

    Knuth D E. 2005.The Art of Computer Programming, Volume 4, Fascicle 3:Generating All Combinations and Partitions.Addison Wesley Pub, USA.

    Lei X J, Tang L, Zhang Y H, Jiang H Y, Cao W X, Zhu Y.2011. Geometric model and visualization of wheat spike.Transactions of the Chinese Society of Agricultural Engineering, 27, 179–184. (in Chinese)

    Lin M C, Gottschalk S. 1998. Collision Detection Between Geometric Models: A survey. In:IMA Conference on Mathematics of Surfaces. vol. 1. San Diego, CA. pp.602–608.

    M?ller T. 1997. A fast triangle-triangle intersection test.Journal of Graphics Tools, 2, 25–30.

    M?ller T, Haines E, Hoffman N. 2008.Real-time Rendering.3rd ed. AK Peters Limited, Wellesley.

    Naylor B, Amanatides J, Thibault W. 1990. Merging BSP trees yields polyhedral set operations. In:SIGGRAPH ‘90 Proceedings of the 17th annual conference on Computergraphics and interactive techniques.Dallas, TX, USA.pp.115–124.

    Qin Q, Zhao C J, Xiao B X, Guo X Y. 2012. Collision detection for maize leaves based on AABB-OBB bounding volumes.Journal of Agricultural Mechanization Research, 1, 177–180. (in Chinese)

    Room P, Hanan J, Prusinkiewicz P. 1996. Virtual plants: New perspectives for ecologists, pathologists and agricultural scientists.Trends in Plant Science, 1, 33–38.

    Shreiner D. 2009.OpenGL Programming Guide:The Official Guide to Learning OpenGL.versions 3.0 and 3.1. 7th ed.Addison-Wesley Professional, USA.

    Tan Z H, Zhu Y, Yao X, Tian Y C, Liu X J, Cao W X. 2006.Modeling spike growth dynamics in winter wheat.Journal of Triticeae Crops, 26, 93–97. (in Chinese)

    Tang L, Lei X J, Liu X, Sun C, Cao W X, Zhu Y. 2011. Realtime rendering of wheat population growth status and its realization.Transactions of the Chinese Society of Agricultural Engineering, 9, 128–135. (in Chinese)

    Tang L, Liu H, Zhu Y, Cao W X. 2008. Development of a model-based digital and visual wheat growth system.In:Compute And Computing Technology In Agriculture.volume 2. Springer, US. pp. 1113–1120.

    Vaně?ek Jr G. 1991. Brep-index: A multidimensional space partitioning tree. In: Rossignac J, Turner J, eds.,Symposium on Solid Modeling Foundations & CAD/CAM Applications:Proceedings of the first ACM symposium on Solid modeling foundations and CAD/CAM applications. ACM, Austin,Texas, USA. pp. 243–261.

    Weghorst H, Hooper G, Greenberg D P. 1984. Improved computational methods for ray tracing.ACM Transactions on Graphics, 3, 52–69.

    Wilson A, Larsen E, Manocha D, Lin M C. 1999. Partitioning and handling massive models for interactive collision detection.Computer Graphics Forum, 18, 319–330.

    Wu Y L, Cao W X, Tang L, Zhu Y, Liu H. 2009. OpenGL-based visual technology for wheat morphology.Transactions of the Chinese Society of Agricultural Engineering, 25, 121–126.(in Chinese)

    Wu Y L, Tang L, Cao W X, Zhu Y. 2011. Collision detection and response in crop visualization.Computer Science, 38,263–266. (in Chinese)

    Xiao B, Guo X, Wang C, Wu S. 2015. Collision detection based on biomimetic pattern recognition for virtual plant.ICIC Express Letters, 9, 1413–1418.

    Yong B B, Shen J, Sun H G, Chen H M, Zhou Q G. 2017. Parallel GPU-based collision detection of irregular vessel wall for massive particles.Cluster Computing, 20, 1–13.

    Zhang W Y, Tang L, Zhu X C, Yang Y, Cao W X, Zhu Y. 2011.Dynamic simulation of wheat stem-sheath angle based on process.Chinese Journal of Applied Ecology, 22,1765–1770. (in Chinese)

    Zhang Y H, Tang L, Liu X J, Liu L L, Cao W X, Zhu Y. 2014.Modeling morphological dynamics and color characteristics of rice panicle.European Journal of Agronomy, 52,279–290.

    Zhang Y H, Tang L, Liu X J, Liu L L, Cao W X, Zhu Y.2017. Modeling curve dynamics and spatial geometry characteristics of rice leaves.Journal of Integrative Agriculture, 16, 2177–2190.

    Zhu Y, Liu X J, Tan Z H, Tang L, Tian Y C, Yao X, Cao W X.2008. Quantitative study on leaf color dynamics of winter wheat.Scientia Agricultura Sinica, 41, 3851–3857. (in Chinese)

    Zhu Y, Tang L, Chen G Q, Cao W X. 2009. Modeling leaf sheath and internode growth dynamics in wheat. In: Cao W X, White W J, Wang E L, eds.,Crop Modeling and Decision Support.Springer, Berlin Heidelberg. pp. 86–91.

    免费少妇av软件| 国产爱豆传媒在线观看| 看免费成人av毛片| 亚洲av中文字字幕乱码综合| 精品一区二区三卡| 在线观看一区二区三区激情| 精品一区二区三卡| 欧美日本视频| 欧美变态另类bdsm刘玥| 国产精品不卡视频一区二区| 18+在线观看网站| 肉色欧美久久久久久久蜜桃| 亚洲综合色惰| av国产精品久久久久影院| 国产精品嫩草影院av在线观看| 亚洲人成网站在线播| 国产伦在线观看视频一区| 日韩欧美 国产精品| 一本—道久久a久久精品蜜桃钙片| 激情 狠狠 欧美| 成人无遮挡网站| 特大巨黑吊av在线直播| 网址你懂的国产日韩在线| 国产精品成人在线| 精品少妇久久久久久888优播| 最近2019中文字幕mv第一页| 欧美一级a爱片免费观看看| 欧美区成人在线视频| 日韩中字成人| 观看美女的网站| 97精品久久久久久久久久精品| 国产色爽女视频免费观看| 老司机影院毛片| 99热国产这里只有精品6| 欧美日韩视频高清一区二区三区二| 国产精品99久久99久久久不卡 | 亚洲欧美日韩另类电影网站 | 成人国产麻豆网| 人人妻人人添人人爽欧美一区卜 | 91久久精品电影网| 黑人猛操日本美女一级片| 成年人午夜在线观看视频| 国产高清三级在线| 国产永久视频网站| 丰满迷人的少妇在线观看| 99久国产av精品国产电影| 亚洲精品国产av蜜桃| 欧美激情国产日韩精品一区| av国产免费在线观看| 色视频在线一区二区三区| 国产亚洲一区二区精品| h日本视频在线播放| 街头女战士在线观看网站| 伦理电影免费视频| 亚洲精品中文字幕在线视频 | 欧美最新免费一区二区三区| 免费不卡的大黄色大毛片视频在线观看| 精品久久久精品久久久| 国产乱人偷精品视频| 国产美女午夜福利| 午夜福利高清视频| 插逼视频在线观看| 国产探花极品一区二区| 国产精品不卡视频一区二区| 少妇猛男粗大的猛烈进出视频| 91久久精品国产一区二区三区| 亚洲av福利一区| 国产永久视频网站| 日韩欧美 国产精品| 九草在线视频观看| 大陆偷拍与自拍| 日韩一本色道免费dvd| 精品久久久久久久久亚洲| 色哟哟·www| av在线播放精品| 国产片特级美女逼逼视频| 亚洲av综合色区一区| 最近最新中文字幕大全电影3| 在线观看一区二区三区激情| 高清毛片免费看| 乱码一卡2卡4卡精品| 精品人妻一区二区三区麻豆| 久久久久久久久久人人人人人人| 久久人人爽人人爽人人片va| 一本久久精品| 99热这里只有是精品50| 欧美精品人与动牲交sv欧美| 国产综合精华液| 久久精品夜色国产| 伦精品一区二区三区| 免费高清在线观看视频在线观看| 精品少妇久久久久久888优播| 在线亚洲精品国产二区图片欧美 | 亚洲人成网站在线播| 亚洲,欧美,日韩| 久久99蜜桃精品久久| 久久人人爽av亚洲精品天堂 | 七月丁香在线播放| 亚洲欧美中文字幕日韩二区| 欧美高清成人免费视频www| 三级国产精品欧美在线观看| 国产精品欧美亚洲77777| 麻豆成人午夜福利视频| 国产精品不卡视频一区二区| 国产伦精品一区二区三区视频9| 少妇猛男粗大的猛烈进出视频| 国产v大片淫在线免费观看| 精品人妻一区二区三区麻豆| 亚洲自偷自拍三级| 日韩av免费高清视频| 久久99热这里只频精品6学生| 春色校园在线视频观看| 日本黄色片子视频| 精品99又大又爽又粗少妇毛片| av在线app专区| 黄色欧美视频在线观看| 国产又色又爽无遮挡免| 国产精品一区二区在线观看99| 只有这里有精品99| xxx大片免费视频| 少妇裸体淫交视频免费看高清| 五月天丁香电影| 亚洲图色成人| 午夜视频国产福利| 精品国产一区二区三区久久久樱花 | 日产精品乱码卡一卡2卡三| 狂野欧美激情性xxxx在线观看| 免费看av在线观看网站| 你懂的网址亚洲精品在线观看| 国产成人精品婷婷| 99热全是精品| 国产高清不卡午夜福利| 一级毛片电影观看| 亚洲精品中文字幕在线视频 | 交换朋友夫妻互换小说| 一级毛片久久久久久久久女| 国产亚洲av片在线观看秒播厂| 中文资源天堂在线| 精品视频人人做人人爽| 多毛熟女@视频| 午夜免费鲁丝| 精品人妻熟女av久视频| 男人添女人高潮全过程视频| 高清午夜精品一区二区三区| 日韩制服骚丝袜av| 能在线免费看毛片的网站| 亚洲人与动物交配视频| av视频免费观看在线观看| 国产有黄有色有爽视频| 91久久精品电影网| 汤姆久久久久久久影院中文字幕| 26uuu在线亚洲综合色| 久久ye,这里只有精品| 99久久精品国产国产毛片| 丝瓜视频免费看黄片| 亚洲久久久国产精品| 纵有疾风起免费观看全集完整版| 亚洲国产av新网站| 亚洲自偷自拍三级| 大片免费播放器 马上看| 成年av动漫网址| 男女无遮挡免费网站观看| 亚洲欧美日韩东京热| 亚洲一区二区三区欧美精品| 日本av手机在线免费观看| 妹子高潮喷水视频| 在线天堂最新版资源| 亚洲综合色惰| 天美传媒精品一区二区| 少妇熟女欧美另类| 中文字幕亚洲精品专区| 中文资源天堂在线| 国产精品国产三级专区第一集| 有码 亚洲区| 在线 av 中文字幕| 新久久久久国产一级毛片| 十八禁网站网址无遮挡 | 成人免费观看视频高清| 91aial.com中文字幕在线观看| 亚洲精品国产色婷婷电影| 国产精品一区www在线观看| 99热这里只有是精品50| 成人免费观看视频高清| 精品国产三级普通话版| 国产成人免费无遮挡视频| 女的被弄到高潮叫床怎么办| 日韩国内少妇激情av| 亚洲精品日韩av片在线观看| 国产淫片久久久久久久久| 91精品一卡2卡3卡4卡| 国产一区二区在线观看日韩| 欧美精品亚洲一区二区| 九草在线视频观看| 狂野欧美激情性xxxx在线观看| 女的被弄到高潮叫床怎么办| 一个人看视频在线观看www免费| 中文字幕av成人在线电影| 黑人高潮一二区| 欧美成人a在线观看| 亚洲美女搞黄在线观看| 久久鲁丝午夜福利片| 少妇人妻一区二区三区视频| 久久影院123| 久久久久性生活片| 另类亚洲欧美激情| 亚洲激情五月婷婷啪啪| 精品久久久久久久久av| 男人爽女人下面视频在线观看| 涩涩av久久男人的天堂| 欧美最新免费一区二区三区| 精品国产三级普通话版| 一二三四中文在线观看免费高清| 如何舔出高潮| 久久热精品热| 亚洲高清免费不卡视频| 亚洲精华国产精华液的使用体验| 亚洲综合色惰| 亚洲av不卡在线观看| 国产女主播在线喷水免费视频网站| 日本爱情动作片www.在线观看| 高清在线视频一区二区三区| 只有这里有精品99| 国产精品99久久99久久久不卡 | 国产精品国产av在线观看| 国产精品秋霞免费鲁丝片| 亚洲欧美日韩另类电影网站 | 久久97久久精品| tube8黄色片| 亚洲精品,欧美精品| 日本一二三区视频观看| 性高湖久久久久久久久免费观看| 在线观看美女被高潮喷水网站| 国产 一区 欧美 日韩| 国产真实伦视频高清在线观看| 亚洲四区av| 国产成人freesex在线| 精品久久久久久久久av| 亚洲人成网站高清观看| 一区二区av电影网| 国产精品蜜桃在线观看| 22中文网久久字幕| av不卡在线播放| 国产精品一区二区三区四区免费观看| 99热网站在线观看| 欧美成人a在线观看| 国产精品久久久久久久久免| 亚洲欧美日韩东京热| 精品久久久久久久久亚洲| 国产高清有码在线观看视频| 欧美成人午夜免费资源| 亚洲色图av天堂| 日本vs欧美在线观看视频 | 一级黄片播放器| 人妻一区二区av| 一区在线观看完整版| 亚洲婷婷狠狠爱综合网| 老女人水多毛片| 日韩欧美 国产精品| 18禁在线播放成人免费| 联通29元200g的流量卡| 97超视频在线观看视频| 国产日韩欧美亚洲二区| 亚洲欧美成人综合另类久久久| 青春草国产在线视频| 亚洲第一区二区三区不卡| 国产av国产精品国产| 久热这里只有精品99| 美女国产视频在线观看| 99热这里只有精品一区| 亚洲欧美精品专区久久| a级毛色黄片| 纵有疾风起免费观看全集完整版| 毛片女人毛片| 性高湖久久久久久久久免费观看| 青春草亚洲视频在线观看| 香蕉精品网在线| 少妇高潮的动态图| 久久99热这里只有精品18| 男男h啪啪无遮挡| 亚洲国产精品国产精品| 亚洲av日韩在线播放| 久久ye,这里只有精品| 欧美成人精品欧美一级黄| 黑丝袜美女国产一区| 多毛熟女@视频| 国产一级毛片在线| 人人妻人人澡人人爽人人夜夜| 日韩中文字幕视频在线看片 | 亚洲精品乱码久久久久久按摩| 伦理电影免费视频| 国产精品伦人一区二区| .国产精品久久| 大片电影免费在线观看免费| 亚洲精品第二区| 成人亚洲精品一区在线观看 | 深夜a级毛片| 毛片一级片免费看久久久久| 九九爱精品视频在线观看| 全区人妻精品视频| 日韩av免费高清视频| 成年免费大片在线观看| 网址你懂的国产日韩在线| 国产精品人妻久久久影院| 免费黄色在线免费观看| 国产精品一区二区三区四区免费观看| 我的女老师完整版在线观看| 黄色视频在线播放观看不卡| 亚洲在久久综合| 十分钟在线观看高清视频www | 91精品伊人久久大香线蕉| 亚洲三级黄色毛片| 国产精品人妻久久久影院| 精品人妻一区二区三区麻豆| 久久99精品国语久久久| videossex国产| 国产乱人偷精品视频| 97精品久久久久久久久久精品| 精品一品国产午夜福利视频| 成年美女黄网站色视频大全免费 | 久久久久久久久大av| 国产亚洲午夜精品一区二区久久| 99热这里只有是精品在线观看| 人人妻人人澡人人爽人人夜夜| 一边亲一边摸免费视频| 欧美3d第一页| 成人亚洲欧美一区二区av| 免费大片18禁| 最近最新中文字幕大全电影3| 插逼视频在线观看| 日韩三级伦理在线观看| 国产亚洲一区二区精品| 纵有疾风起免费观看全集完整版| 亚洲婷婷狠狠爱综合网| 亚洲精华国产精华液的使用体验| www.色视频.com| 国产精品一二三区在线看| 女性生殖器流出的白浆| 一级a做视频免费观看| 嘟嘟电影网在线观看| 国产av精品麻豆| 亚洲精品国产成人久久av| 蜜桃久久精品国产亚洲av| 三级国产精品欧美在线观看| 视频中文字幕在线观看| av在线老鸭窝| 国产真实伦视频高清在线观看| 国产乱来视频区| 2022亚洲国产成人精品| 色视频www国产| 2022亚洲国产成人精品| 亚洲精品成人av观看孕妇| 国产爱豆传媒在线观看| 亚洲精品第二区| 日韩av在线免费看完整版不卡| 中文乱码字字幕精品一区二区三区| 亚洲第一区二区三区不卡| 日韩免费高清中文字幕av| 精品国产一区二区三区久久久樱花 | 一级a做视频免费观看| 性色av一级| 你懂的网址亚洲精品在线观看| 我要看日韩黄色一级片| 久久久a久久爽久久v久久| 成人黄色视频免费在线看| 韩国av在线不卡| 亚洲精品久久久久久婷婷小说| 免费黄色在线免费观看| av播播在线观看一区| 国产亚洲一区二区精品| 美女主播在线视频| 国产深夜福利视频在线观看| 亚洲av男天堂| 欧美一级a爱片免费观看看| 国产精品人妻久久久影院| 在线观看一区二区三区激情| 国产亚洲91精品色在线| 亚洲不卡免费看| 自拍偷自拍亚洲精品老妇| 日日摸夜夜添夜夜爱| 国产精品麻豆人妻色哟哟久久| 亚洲av中文av极速乱| 最后的刺客免费高清国语| 亚洲人成网站在线观看播放| 亚洲美女视频黄频| 女的被弄到高潮叫床怎么办| 亚洲欧美精品专区久久| 亚洲精品日本国产第一区| 伦理电影大哥的女人| 黑人猛操日本美女一级片| 精品亚洲乱码少妇综合久久| 亚洲精品,欧美精品| 亚洲精品日本国产第一区| 亚洲色图av天堂| 六月丁香七月| 国产熟女欧美一区二区| 在线 av 中文字幕| 久久久久久九九精品二区国产| 国产成人aa在线观看| 中文字幕av成人在线电影| 久久人人爽人人片av| 国产精品成人在线| 国产爽快片一区二区三区| 精品国产三级普通话版| 国产一区有黄有色的免费视频| 亚洲国产欧美在线一区| 久久久精品免费免费高清| 精品一区在线观看国产| 日韩国内少妇激情av| 日日摸夜夜添夜夜爱| 黄色日韩在线| 日韩免费高清中文字幕av| 三级国产精品欧美在线观看| 亚洲精品成人av观看孕妇| 街头女战士在线观看网站| 如何舔出高潮| 我的女老师完整版在线观看| 亚洲丝袜综合中文字幕| 久久综合国产亚洲精品| 成人亚洲精品一区在线观看 | 日日摸夜夜添夜夜添av毛片| 日韩av免费高清视频| 在线亚洲精品国产二区图片欧美 | 精华霜和精华液先用哪个| 精品一区二区三区视频在线| h日本视频在线播放| 国产精品精品国产色婷婷| 又爽又黄a免费视频| 91aial.com中文字幕在线观看| 熟女人妻精品中文字幕| 欧美日韩一区二区视频在线观看视频在线| 青青草视频在线视频观看| 男女无遮挡免费网站观看| 99热网站在线观看| 在线观看人妻少妇| 久久久精品94久久精品| 国产毛片在线视频| 美女内射精品一级片tv| 国产成人精品久久久久久| 狂野欧美白嫩少妇大欣赏| 欧美少妇被猛烈插入视频| 久久久久久久亚洲中文字幕| 亚洲精品国产色婷婷电影| 一个人看视频在线观看www免费| 少妇猛男粗大的猛烈进出视频| 九九在线视频观看精品| 国产精品一区www在线观看| 自拍偷自拍亚洲精品老妇| 纯流量卡能插随身wifi吗| 99热网站在线观看| 人妻 亚洲 视频| 久久久欧美国产精品| 视频中文字幕在线观看| 亚洲成人av在线免费| 男人爽女人下面视频在线观看| 汤姆久久久久久久影院中文字幕| 国产91av在线免费观看| 大码成人一级视频| 国产精品人妻久久久久久| av国产精品久久久久影院| 欧美区成人在线视频| 亚洲欧美中文字幕日韩二区| 欧美日韩在线观看h| 国产精品蜜桃在线观看| 各种免费的搞黄视频| 成年女人在线观看亚洲视频| 黄色怎么调成土黄色| 夫妻性生交免费视频一级片| 男人爽女人下面视频在线观看| 一区二区三区精品91| 纯流量卡能插随身wifi吗| 18禁裸乳无遮挡动漫免费视频| 日韩欧美一区视频在线观看 | 亚洲av综合色区一区| 国产精品秋霞免费鲁丝片| 中文在线观看免费www的网站| www.色视频.com| 精品亚洲乱码少妇综合久久| 亚洲电影在线观看av| 国产精品av视频在线免费观看| 国产v大片淫在线免费观看| 久久99精品国语久久久| 亚洲欧美中文字幕日韩二区| 亚洲欧美一区二区三区黑人 | 国产免费又黄又爽又色| 亚洲av男天堂| 国产91av在线免费观看| 精品人妻视频免费看| 最近的中文字幕免费完整| 全区人妻精品视频| 久久国产亚洲av麻豆专区| 国产 精品1| 国产在线视频一区二区| 99九九线精品视频在线观看视频| 国产av一区二区精品久久 | 国产 精品1| 三级国产精品欧美在线观看| 亚洲精品国产av成人精品| 亚洲成人av在线免费| 午夜老司机福利剧场| 精品国产一区二区三区久久久樱花 | 丰满少妇做爰视频| 国产男女超爽视频在线观看| 亚洲欧美一区二区三区国产| 哪个播放器可以免费观看大片| 精品亚洲成国产av| 久久ye,这里只有精品| 日韩成人伦理影院| 一级二级三级毛片免费看| 免费看光身美女| 免费观看的影片在线观看| 亚洲欧美精品自产自拍| 国产淫片久久久久久久久| 国产爱豆传媒在线观看| 成年av动漫网址| 国产男女内射视频| 久久鲁丝午夜福利片| 一本一本综合久久| 精华霜和精华液先用哪个| 日本欧美视频一区| 91在线精品国自产拍蜜月| 亚洲欧美一区二区三区黑人 | 不卡视频在线观看欧美| 一本一本综合久久| 观看av在线不卡| 日本欧美视频一区| av在线播放精品| 国产免费一级a男人的天堂| 超碰97精品在线观看| 免费不卡的大黄色大毛片视频在线观看| 欧美老熟妇乱子伦牲交| 午夜福利影视在线免费观看| 国产精品偷伦视频观看了| 国产在线一区二区三区精| 亚洲精品国产成人久久av| av福利片在线观看| a级毛色黄片| 最近最新中文字幕免费大全7| kizo精华| 美女cb高潮喷水在线观看| 亚洲精品,欧美精品| 丝袜喷水一区| 黄色怎么调成土黄色| 身体一侧抽搐| 亚洲精品国产av蜜桃| 国产亚洲午夜精品一区二区久久| 网址你懂的国产日韩在线| 狂野欧美白嫩少妇大欣赏| 日韩制服骚丝袜av| 欧美日本视频| 亚洲va在线va天堂va国产| 久久99蜜桃精品久久| 亚洲人成网站高清观看| 久久精品久久精品一区二区三区| 中文天堂在线官网| 亚洲图色成人| 日韩强制内射视频| 国产av精品麻豆| 性色av一级| xxx大片免费视频| 黄色配什么色好看| 欧美xxxx性猛交bbbb| 亚洲国产精品专区欧美| 日韩成人伦理影院| 热99国产精品久久久久久7| av国产免费在线观看| 在线观看免费视频网站a站| 毛片一级片免费看久久久久| 婷婷色麻豆天堂久久| 国产 一区 欧美 日韩| 黄色怎么调成土黄色| 国产高潮美女av| 久久精品国产亚洲av天美| 成人影院久久| 日本-黄色视频高清免费观看| 国产精品久久久久久久久免| 国产亚洲午夜精品一区二区久久| 欧美最新免费一区二区三区| 成年免费大片在线观看| 自拍欧美九色日韩亚洲蝌蚪91 | 久久99热这里只有精品18| 亚洲国产精品999| 老司机影院成人| 搡女人真爽免费视频火全软件| 赤兔流量卡办理| 午夜福利影视在线免费观看| 精华霜和精华液先用哪个| 人妻 亚洲 视频| 18禁裸乳无遮挡免费网站照片| 亚洲熟女精品中文字幕| 99久久精品一区二区三区| 性色avwww在线观看| 成人黄色视频免费在线看| 久久这里有精品视频免费| 性色avwww在线观看| 日本午夜av视频| 亚洲人成网站在线观看播放| 高清欧美精品videossex| av免费观看日本| 另类亚洲欧美激情| 我要看黄色一级片免费的| 美女主播在线视频| 久久久欧美国产精品| 国产精品久久久久成人av| 久久久久精品久久久久真实原创| kizo精华| 国产片特级美女逼逼视频| 99久久精品热视频| 欧美人与善性xxx| 最近2019中文字幕mv第一页| 国产精品国产三级国产av玫瑰| 九草在线视频观看| 国产精品国产三级国产专区5o| 欧美精品国产亚洲| 黑丝袜美女国产一区| 国产精品久久久久久久久免|