Abstract
In this paper, a method for detecting and mapping the petals of plant petals is presented. Firstly, the parametric equations are used to represent the initial state of the petals surface. The three - dimensional Cartesian coordinates of each point in the petals are projected onto the spherical coordinates respectively, The discrete values of the projection of the petals are converted to the two-dimensional coordinate plane. Secondly, multiple buffers are used to record the result of each petals projection and the distance of the petals from the origin of the spherical coordinates. According to the value of each buffer, it is determined whether the current petal collides with others, the collides result can be determined the range of collision. Finally, the current petals are deformed or moved to avoid collided with others. Through the collision test between the petals in the process of flower generation, it shows that the detection effect is good.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Wu, M., Yu, Y., Zhou, J.: An octree algorithm for collision detection using space partition. Chin. J. Comput. 20(9), 849–854 (1997)
Redon, S., Kim, Y.J., Lin, M.C., et al.: Fast continuous collision detection for articulated models. In: Proceeding Soft the 9th ACM Symposium on Solid Modeling and Applications Airela-Ville Euro graphics Association Press, pp. 145–156 (2004)
Gottschalk, S., Lin, M.C., Manocha, D.: OBBTree.: a hierarchical structure for rapid interference detection. In: Computer Graphics Proceedings Annual Conference Series ACM SIGGRAPH, pp. 171–180 (1996)
Klosowski, J.T., Held, M., Mitchell, J.S.B., et al.: Efficient collision detection using bounding volume hierarchies of k-DOPS. IEEE Trans. Vis. Comput. Graph. 4(1), 21–36 (1998)
Larse, E., Gottschalk, S., Lin, M.C., et al.: Fast proximity queries with swept sphere volumes. North Carolina University of North Carolina Department of Computer Science (1999)
Bradshaw, G., O Sullivan, C.: Sphere-tree construction using dynamic media lax is approximation. In: Proceeding Soft the ACM SIGGRAPH Euro Graphics Symposium on Computer Animation, pp. 33–40 (2002)
Corrales, J.A., Candelas, F.A., Torres, F.: Safe human-robot interaction based on dynamic sphere-swept line bounding volumes. Robot. Comput.-Integr. Manuf. 27(1), 177–185 (2011)
Memory-optimized bounding-volume hierarchies. http://www.codecorner.com/Opcod. Accessed 28 Sept 2013
Chen, X., Yong, J., Zheng, G., et al.: Computing minimum distance between two Bezier curves/surfaces. Comput. Aided Geom. Des. 25(3), 677–684 (2006)
Chena, X., Yong, J., Zheng, G., et al.: Computing minimum distance between two implicit algebraic surfaces. Comput. Aided Geomet. Des. 38(4), 1053–1061 (2006)
Lee, K., Seong, J.-K., Kim, K.-J., et al.: Minimum distance between two sphere-swept surfaces. Comput. Aided Geomet. Des. 39(1), 452–459 (2007)
Turbull, C., Cameron, S.: Computing distances between NURBS-defined convex objects. In: Proceeding of IEEE International Conference on Robotics and Automation, pp. 236–239 (2008)
Ma, Y., Tu, C., Wang, W.: Distance computation for canal surfaces using cone-sphere bounding volumes. Comput. Aided Geomet. Des. 29(3), 255–264 (2012)
Rossignac, J., Megahed, A., Schneider, B.O.: Interactive inspection of solids: cross-section and interferences. In: Computer Graphics Proceedings, Annual Conference Series, ACM SIGGRAPH, pp. 353–360 (1992)
Rossignac, J., Megahed, A., Schneider, B.O.: Interactive inspection of solids: cross-section and interferences. Comput. Graph. 10(4), 181–192 (1999)
Baciu, G., Wong, S.K.W., Sun, H.: RECODE.: an image-based collision detection algorithm. J. Vis. Comput. Anim. 10(4), 181–192 (1999)
Hoff III, K.E., Zaferakis, A., Lin, M., Manocha, D.: Fast and simple 2D geometric proximity queries using graphics hardware. In: Proceedings of ACM Symposium on Interactive 3D Graphics, pp. 145–148 (2001)
Bridson, R., Fedkiw, R., Anderson, J.: Robust treatment of collisions, contact and friction for cloth animation. ACM Trans. Graph. (TOG) 21(3), 594–603 (2002)
Raghupathi, L., Grisoni, L., Faure, F., et al.: An intestinal surgery simulator: real-time collision processing and visualization. IEEE Trans. Vis. Comput. Graph. 10(6), 708–718 (2004)
Tang, Y., Yang, S., Lu, M., et al.: Adaptive ellipsoidal surround box improvement of fabric collision detection method. Comput. Aided Des. Graph. J. 25(10), 1589–1596 (2013)
Zhang, X.Y., Kim, Y.: Interactive collision detection for deformable models using streaming ABBs. IEEE Trans. Vis. Comput. Graph. 13(2), 318–329 (2007)
Tang, M., Manocha, D., Lin, J., et al.: Collision-streams: fast GPU based collision detection for deformable models. In: Symposium on Interactive 3D Graphics and Games, pp. 63–70. ACM, New York (2011)
Zhou, Q., Liu, Y., Cheng, T.: A continuous collision detection algorithm for large soft bodies. J. Chin. Image Graph. 21(7), 91–912 (2016)
Lu, L.: Study of flower color simulation. J. Syst. Simul. 24(9), 1892–1895 (2012)
Acknowledgment
This work was funded by two Natural Science Foundation of China (61561003 and 61761003)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Cao, T., Lu, L., Wang, W., Li, L., Wang, L. (2018). A Method for Detecting Flower Collision Based on Spherical Projection. In: Wang, Y., Jiang, Z., Peng, Y. (eds) Image and Graphics Technologies and Applications. IGTA 2018. Communications in Computer and Information Science, vol 875. Springer, Singapore. https://doi.org/10.1007/978-981-13-1702-6_3
Download citation
DOI: https://doi.org/10.1007/978-981-13-1702-6_3
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-13-1701-9
Online ISBN: 978-981-13-1702-6
eBook Packages: Computer ScienceComputer Science (R0)