- All Journals
- Al-Qadisiyah University
- Basrah University
- Kirkuk University
- Mosul University
- The Iraqi Borad for Medical Specialization
- University of Anbar
- University of Technology
- Al Mustafa University
- Al-Zahraa University for Women
- Alnoor University
- Kunooz University
- Misan University
- Ninevah University
- Tikrit University
- University of Al-Hamdaniya
- University of Kerbala
Diameter and width via Rotating Calipers of a Set of Two-dimensional Convex Hull Vertices using Graham scan algorithm | ||
| journal of kerbala university | ||
| Article 1, Volume 9, Issue 0, 2013, Pages 74-81 PDF (0 K) | ||
| Author | ||
| Mahdi Naser Alzubaidi | ||
| Abstract | ||
| A convex hull is an important shape in graphic geometry that can be used to construct many other geometric structures.In this paper we compute the Convex hull polygon by eliminating all the interior points and bounding box the exterior points using Graham scan algorithm then we compute the Diameter and width of aconvex hull polygon using a powerful, easy and well-designedmethod that can solve several computational geometric difficultiesprofessionallyin practice called Rotating Caliper method. The proposed idea of a well-known rotating caliper algorithm includesrotate pairs ofparallel straight lines called antipodal pairs around a given polygon's vertices, the first one located inmaximum Y-coordinate and the second one is in minimum Y-coordinateof Convex hull vertices. If wecontinuously sweep the tangent of the antipodal pairs through 360 degrees,then the width and diameter of the convex hull polygon are simply detected byminimum and maximum distance between the antipodal pairs during thissweep process. The experimental results revealthat The rotating calipers algorithm is fast ,powerful, easy and general tool for solving geometric problems. Keywords: Rotating Calipers; Computational Geometric; Graham Convex Hull. | ||
|
Statistics Article View: 138 PDF Download: 162 |
||