Polylidar - Polygons from Triangular Meshes

4Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

Abstract

This letter 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.

Cite

CITATION STYLE

APA

Castagno, J., & Atkins, E. (2020). Polylidar - Polygons from Triangular Meshes. IEEE Robotics and Automation Letters, 5(3), 4634–4641. https://doi.org/10.1109/LRA.2020.3002212

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free