Polylidar -- Polygons from Triangular Meshes

February 05, 2020 Β· Declared Dead Β· πŸ› arXiv.org

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Jeremy Castagno, Ella Atkins arXiv ID 2002.01886 Category cs.CG: Computational Geometry Cross-listed cs.RO Citations 0 Venue arXiv.org Last Checked 3 months ago
Abstract
This paper presents Polylidar, an efficient algorithm to extract non-convex polygons from 2D point sets, including interior holes. Plane segmented point clouds can be input into Polylidar to extract their polygonal counterpart, thereby reducing map size and improving visualization. The algorithm begins by triangulating the point set and filtering triangles by user configurable parameters such as triangle edge length. Next, connected triangles are extracted into triangular mesh regions representing the shape of the point set. Finally each region is converted to a polygon through a novel boundary following method which accounts for holes. Real-world and synthetic benchmarks are presented to comparatively evaluate Polylidar speed and accuracy. Results show comparable accuracy and more than four times speedup compared to other concave polygon extraction methods.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Computational Geometry

R.I.P. πŸ‘» Ghosted

Dynamic Planar Convex Hull

Riko Jacob, Gerth StΓΈlting Brodal

cs.CG πŸ› The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings. πŸ“š 240 cites 7 years ago

Died the same way β€” πŸ‘» Ghosted