Efficient distance computation algorithm between nearly intersected objects using dynamic pivot point in virtual environment application
Finding nearly accurate distance between two or more nearly intersecting three-dimensional (3D) objects is vital especially for collision determination such as in virtual surgeon simulation and real-time car crash simulation. Instead of performing broad phase collision detection, we need to check fo...
| Main Authors: | , , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English English |
| Published: |
2014
|
| Subjects: | |
| Online Access: | https://eprints.ums.edu.my/id/eprint/30550/3/Efficient%20Distance%20Computation%20Algorithm%20between%20Nearly%20Intersected%20Objects%20Using%20Dynamic%20Pivot%20Point%20in%20Virtual%20Environment%20Application%20ABSTRACT.pdf https://eprints.ums.edu.my/id/eprint/30550/5/Efficient%20Distance%20Computation%20Algorithm%20between%20Nearly%20Intersected%20Objects%20Using%20Dynamic%20Pivot%20Point%20in%20Virtual%20Environment%20Application%20FULL%20TEXT-2-7%20%281%29.pdf |
| _version_ | 1825714375052230656 |
|---|---|
| author | Hamzah Asyrani Sulaiman Abdullah Bade Mohd Harun Abdullah |
| author_facet | Hamzah Asyrani Sulaiman Abdullah Bade Mohd Harun Abdullah |
| author_sort | Hamzah Asyrani Sulaiman |
| collection | UMS |
| description | Finding nearly accurate distance between two or more nearly intersecting three-dimensional (3D) objects is vital especially for collision determination such as in virtual surgeon simulation and real-time car crash simulation. Instead of performing broad phase collision detection, we need to check for accuracy of detection by running narrow phase collision detection. One of the important elements for narrow phase collision detection is to determine the precise distance between two or more nearly intersecting objects or polygons in order to prepare the area for potential colliding. Distance computation plays important roles in determine the exact point of contact between two or more nearly intersecting polygons where the preparation for collision detection is determined at the earlier stage. In this paper, we describes our current works of determining the distance between objects using dynamic pivot point that will be used as reference point to reduce the complexity searching for potential point of contacts. By using Axis-Aligned Bounding Box for each polygon, we calculate a dynamic pivot point that will become our reference point to determine the potential candidates for distance computation. The test our finding distance will be simplified by using our method instead of performing unneeded operations. Our method provides faster solution than the previous method where it helps to determine the point of contact efficiently and faster than the other method. |
| first_indexed | 2024-03-06T03:10:52Z |
| format | Conference or Workshop Item |
| id | ums.eprints-30550 |
| institution | Universiti Malaysia Sabah |
| language | English English |
| last_indexed | 2024-03-06T03:10:52Z |
| publishDate | 2014 |
| record_format | dspace |
| spelling | ums.eprints-305502021-09-06T06:51:35Z https://eprints.ums.edu.my/id/eprint/30550/ Efficient distance computation algorithm between nearly intersected objects using dynamic pivot point in virtual environment application Hamzah Asyrani Sulaiman Abdullah Bade Mohd Harun Abdullah QA76.75-76.765 Computer software Finding nearly accurate distance between two or more nearly intersecting three-dimensional (3D) objects is vital especially for collision determination such as in virtual surgeon simulation and real-time car crash simulation. Instead of performing broad phase collision detection, we need to check for accuracy of detection by running narrow phase collision detection. One of the important elements for narrow phase collision detection is to determine the precise distance between two or more nearly intersecting objects or polygons in order to prepare the area for potential colliding. Distance computation plays important roles in determine the exact point of contact between two or more nearly intersecting polygons where the preparation for collision detection is determined at the earlier stage. In this paper, we describes our current works of determining the distance between objects using dynamic pivot point that will be used as reference point to reduce the complexity searching for potential point of contacts. By using Axis-Aligned Bounding Box for each polygon, we calculate a dynamic pivot point that will become our reference point to determine the potential candidates for distance computation. The test our finding distance will be simplified by using our method instead of performing unneeded operations. Our method provides faster solution than the previous method where it helps to determine the point of contact efficiently and faster than the other method. 2014 Conference or Workshop Item PeerReviewed text en https://eprints.ums.edu.my/id/eprint/30550/3/Efficient%20Distance%20Computation%20Algorithm%20between%20Nearly%20Intersected%20Objects%20Using%20Dynamic%20Pivot%20Point%20in%20Virtual%20Environment%20Application%20ABSTRACT.pdf text en https://eprints.ums.edu.my/id/eprint/30550/5/Efficient%20Distance%20Computation%20Algorithm%20between%20Nearly%20Intersected%20Objects%20Using%20Dynamic%20Pivot%20Point%20in%20Virtual%20Environment%20Application%20FULL%20TEXT-2-7%20%281%29.pdf Hamzah Asyrani Sulaiman and Abdullah Bade and Mohd Harun Abdullah (2014) Efficient distance computation algorithm between nearly intersected objects using dynamic pivot point in virtual environment application. In: Simposium Kebangsaan Sains Matematik ke-21, 6-8 November 2013, Pulau Pinang, Malaysia. https://www.researchgate.net/publication/267099651_Efficient_Distance_Computation_Algorithm_between_Nearly_Intersected_Objects_Using_Dynamic_Pivot_Point_in_Virtual_Environment_Application |
| spellingShingle | QA76.75-76.765 Computer software Hamzah Asyrani Sulaiman Abdullah Bade Mohd Harun Abdullah Efficient distance computation algorithm between nearly intersected objects using dynamic pivot point in virtual environment application |
| title | Efficient distance computation algorithm between nearly intersected objects using dynamic pivot point in virtual environment application |
| title_full | Efficient distance computation algorithm between nearly intersected objects using dynamic pivot point in virtual environment application |
| title_fullStr | Efficient distance computation algorithm between nearly intersected objects using dynamic pivot point in virtual environment application |
| title_full_unstemmed | Efficient distance computation algorithm between nearly intersected objects using dynamic pivot point in virtual environment application |
| title_short | Efficient distance computation algorithm between nearly intersected objects using dynamic pivot point in virtual environment application |
| title_sort | efficient distance computation algorithm between nearly intersected objects using dynamic pivot point in virtual environment application |
| topic | QA76.75-76.765 Computer software |
| url | https://eprints.ums.edu.my/id/eprint/30550/3/Efficient%20Distance%20Computation%20Algorithm%20between%20Nearly%20Intersected%20Objects%20Using%20Dynamic%20Pivot%20Point%20in%20Virtual%20Environment%20Application%20ABSTRACT.pdf https://eprints.ums.edu.my/id/eprint/30550/5/Efficient%20Distance%20Computation%20Algorithm%20between%20Nearly%20Intersected%20Objects%20Using%20Dynamic%20Pivot%20Point%20in%20Virtual%20Environment%20Application%20FULL%20TEXT-2-7%20%281%29.pdf |
| work_keys_str_mv | AT hamzahasyranisulaiman efficientdistancecomputationalgorithmbetweennearlyintersectedobjectsusingdynamicpivotpointinvirtualenvironmentapplication AT abdullahbade efficientdistancecomputationalgorithmbetweennearlyintersectedobjectsusingdynamicpivotpointinvirtualenvironmentapplication AT mohdharunabdullah efficientdistancecomputationalgorithmbetweennearlyintersectedobjectsusingdynamicpivotpointinvirtualenvironmentapplication |