Non-convex polygons clustering algorithm
Transcript of Non-convex polygons clustering algorithm
![Page 1: Non-convex polygons clustering algorithm](https://reader035.fdocuments.in/reader035/viewer/2022062316/58ee5a9b1a28ab67218b46a5/html5/thumbnails/1.jpg)
Non-convex polygons clustering algorithm
Ekaterinburg 2016
Presenter: Mikhail Vasilenko
![Page 2: Non-convex polygons clustering algorithm](https://reader035.fdocuments.in/reader035/viewer/2022062316/58ee5a9b1a28ab67218b46a5/html5/thumbnails/2.jpg)
Introduction
• Use all obstacles
• How to decrease calculation time?
• How to optimize for quick motion planning?
![Page 3: Non-convex polygons clustering algorithm](https://reader035.fdocuments.in/reader035/viewer/2022062316/58ee5a9b1a28ab67218b46a5/html5/thumbnails/3.jpg)
Approach
• Rectangles (frames)
• Hierarchy
• Different properties on different levels
![Page 4: Non-convex polygons clustering algorithm](https://reader035.fdocuments.in/reader035/viewer/2022062316/58ee5a9b1a28ab67218b46a5/html5/thumbnails/4.jpg)
Frames to Containers
Inclusion? Intersection? One-element container?
![Page 5: Non-convex polygons clustering algorithm](https://reader035.fdocuments.in/reader035/viewer/2022062316/58ee5a9b1a28ab67218b46a5/html5/thumbnails/5.jpg)
Containers to Family
Intersection? Chains of containers? One-element family?
![Page 6: Non-convex polygons clustering algorithm](https://reader035.fdocuments.in/reader035/viewer/2022062316/58ee5a9b1a28ab67218b46a5/html5/thumbnails/6.jpg)
Families to Groups
Inclusion? Intersection? Close distance? One-element group?
![Page 7: Non-convex polygons clustering algorithm](https://reader035.fdocuments.in/reader035/viewer/2022062316/58ee5a9b1a28ab67218b46a5/html5/thumbnails/7.jpg)
Step-by-step solution
![Page 8: Non-convex polygons clustering algorithm](https://reader035.fdocuments.in/reader035/viewer/2022062316/58ee5a9b1a28ab67218b46a5/html5/thumbnails/8.jpg)
Parallel approach
![Page 9: Non-convex polygons clustering algorithm](https://reader035.fdocuments.in/reader035/viewer/2022062316/58ee5a9b1a28ab67218b46a5/html5/thumbnails/9.jpg)
Summary• Described algorithm is implemented in C++
• Tested on real-world data
• Algorithm is used in route-planning project
• Integration of parallelism is underway
![Page 10: Non-convex polygons clustering algorithm](https://reader035.fdocuments.in/reader035/viewer/2022062316/58ee5a9b1a28ab67218b46a5/html5/thumbnails/10.jpg)
Thanks for your attention!
![Page 11: Non-convex polygons clustering algorithm](https://reader035.fdocuments.in/reader035/viewer/2022062316/58ee5a9b1a28ab67218b46a5/html5/thumbnails/11.jpg)
• To cluster families into groups each of the former is assigned a rough hull
• All the groups have non-intersecting rough hulls
• Merges groups with distances lower than twice that value
Last step
![Page 12: Non-convex polygons clustering algorithm](https://reader035.fdocuments.in/reader035/viewer/2022062316/58ee5a9b1a28ab67218b46a5/html5/thumbnails/12.jpg)
Test data
• The case depicted had 1031 polygons
• which were clustered into 310 containers
• 201 families
• and 12 families groups.