skip to main content
10.1145/3478905.3478993acmotherconferencesArticle/Chapter ViewAbstractPublication PagesdsitConference Proceedingsconference-collections
research-article

Minimization of Dynamic Programming Algorithm by Three-dimension Model Collison Test Fitting

Authors Info & Claims
Published:28 September 2021Publication History

ABSTRACT

In the collision test of simulating object in reality in Unity 3D, the common method taken for non-convex model is convex decomposition. While there exist various kinds of de composition towards models of different forms, it is a combination optimization issue which haven't got the optimized algorithm and which is tedious and time-consuming. While the method of directly judging whether the point is in the inner model or not shows clearer logic and faster judging speed. This judging method can be used in the establishment of non-convex model in computer. The non-convex model, after convex decomposed, is converted into several convex models of fitting model which is then operated collision test. This test method shows a characteristic of simplicity, high-speed and high university.

References

  1. Song C H , Lin M , Lin Z , A Collision Detection Algorithm Based on Bounding Box and Spatial Subdivision[J]. Computer Technology and Development, 2014.Google ScholarGoogle Scholar
  2. Li miao. Analysis and comparison of real-time collision detection algorithms [J]. Computer and Modernization, 2011,1(6):88-90Google ScholarGoogle Scholar
  3. Pan Renyu, Sun Changle, Xiong Wei, Review and prospect of collision detection algorithms in virtual assembly environment [J]. Computer Science, 2016,43(11A):136-139Google ScholarGoogle Scholar
  4. Hubbard PM. Real-time collision detection and time critical computing. In SIVE95,The First Workshop on Simulation and Interaction in Virtual Environments, Iowa City, Iowa. University of Iowa, informal receedings,1995,1:92-96Google ScholarGoogle Scholar
  5. Gilbert EG, Johnson DW, Keerthi SS.A fast procedure for computing the distance between objects in three-dimensional space. IEEE Journal on Robotics and Automation,1988,4:193-203Google ScholarGoogle Scholar
  6. Jin Yanxia, Qin Zhipeng, Li Zhao. Collision detection algorithm of deformable body with R-Sphere [J]. Computer Engineering and Design, 2017(1): 92-96Google ScholarGoogle Scholar
  7. Fang Bin, Wang Zhulin, Guo Xiwei. Four-dimensional time-space hierarchical bounding box collision detection method based on AABB [J]. Computer Measurement and Control, 2014, 22(2): 397-399Google ScholarGoogle Scholar
  8. Fang Z. ,Jiang J. , Xu J. .Efficient Collision Detection Using a Dual K-DOP Sphere Bounding Volume Hierarchy[C]. International Forum on Information Technology and Applications. IEEE, 2010: 185-189Google ScholarGoogle Scholar
  9. Zhaowei, Qu Huiyan. Fast Collision Detection Algorithm Based on Cloud Computing Map-Reduce Model [J]. Journal of Jilin University: Engineering Edition, 2016,46(2):578-584Google ScholarGoogle Scholar
  10. EHMANN S, LIN M C. Accurate and fast proximity queries between polyhedra using convex surface decomposition [J]. Euro graphics Conference, Manchester, 2001:500-510.Google ScholarGoogle Scholar
  11. Fan Zhaowei, Wan Huagen. Fast collision detection algorithm based on image [J]. Journal of Computer Aided Design and Graphics, 2002,14(9):805-809.Google ScholarGoogle Scholar
  12. Fan Zhaowei. Research on Real-time Collision Detection Technology [D]. Hangzhou: School of Computer Science, Zhejiang University, 2003.Google ScholarGoogle Scholar
  13. Liu Wenyu, Li Hua. A globally optimized polyhedral convex decomposition matching method[J]. Journal of Infrared and Millimeter Waves, 2004,(02):139-142Google ScholarGoogle Scholar
  14. LiuWen Yu, LI Hua, ZHU GuangXi. Non-rigid Body Interpolation Based on Generalized Morphologic Morphing[J]. International Journal of Image & Graphics, 2003, 3(2): 325— 344Google ScholarGoogle ScholarCross RefCross Ref

Recommendations

Comments

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Sign in
  • Published in

    cover image ACM Other conferences
    DSIT 2021: 2021 4th International Conference on Data Science and Information Technology
    July 2021
    481 pages
    ISBN:9781450390248
    DOI:10.1145/3478905

    Copyright © 2021 ACM

    © 2021 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by an employee, contractor or affiliate of a national government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only.

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    • Published: 28 September 2021

    Permissions

    Request permissions about this article.

    Request Permissions

    Check for updates

    Qualifiers

    • research-article
    • Research
    • Refereed limited

    Acceptance Rates

    Overall Acceptance Rate114of277submissions,41%
  • Article Metrics

    • Downloads (Last 12 months)7
    • Downloads (Last 6 weeks)2

    Other Metrics

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

HTML Format

View this article in HTML Format .

View HTML Format