A Sweep-Line Algorithm and its Application to Spiral Pocketing. | ||||
| MEJ- Mansoura Engineering Journal | ||||
| Article 8, Volume 26, Issue 4, December 2001, Page 14-21 PDF (662.68 K) | ||||
| Document Type: Research Studies | ||||
| DOI: 10.21608/bfemu.2021.146094 | ||||
 View on SCiNiTO | ||||
| Authors | ||||
| Tawfik Tawfik Mohamed El-Midany1; Ahmed Abd El-Fattah Moustafa Elkeran* 2; H. Tawfik3 | ||||
| 1Production Engineering and Mechanical Design Department., Faculty of Engineering.,. B.O Box #2 El-Mansoura University 355 36. Egyp | ||||
| 2Production Engineering and Mechanical Design Department., Faculty of Engineering.,. B.O Box #2 Mansoura University 355 36., Egypt. | ||||
| 3Production Engineering Department., Faculty of Engineering., B.O Box #2 El-Mansoura University 35536., Mansoura., Egypt. | ||||
| Abstract | ||||
| This paper presents an efficient line-offset algorithm for general polygonal shapes with islands. A developed sweep-line algorithm (SL) is introduced to find all sell-intersection points accurately and quickly. The previous work is limited to handle polygons that having no line-segments in parallel to $Weep-line directions. An invalid loop detection and removing (ILDR) algorithm is proposed. The invalid loops detection algorithm divides the polygon al self-intersection points into a set of small polygons, and re-polygonized them. The polygons are checked for direction; invalid polygons are always having inverse direction with the boundary polygon. The proposed algorithm has been implemented in Visual C++ and applied to offset point scquence curves, which contain several islands. | ||||
| Keywords | ||||
| Polygonal chain; Monotone chain; Sweep-line; Self-intersection; CAD/CAM; CNC; Spiral pocketing; Line offset; Detecting invalid loops | ||||
|
Statistics Article View: 105 PDF Download: 280 |
||||
