DeepAI AI Chat
Log In Sign Up

Polylidar – Polygons from Triangular Meshes

by   Jeremy Castagno, et al.
University of Michigan

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.


Polygon Extraction from Triangular Meshes

This paper presents Polylidar, an efficient algorithm to extract non-con...

Polylidar3D – Fast Polygon Extraction from 3D Data

Flat surfaces captured by 3D point clouds are often used for localizatio...

POLYLLA: Polygonal meshing algorithm based on terminal-edge regions

This paper presents an algorithm to generate a new kind of polygonal mes...

Morig: Motion-aware rigging of character meshes from point clouds

We present MoRig, a method that automatically rigs character meshes driv...

Low Rank Matrix Approximation for Geometry Filtering

We propose a robust, anisotropic normal estimation method for both point...

Fast Evaluation of Smooth Distance Constraints on Co-Dimensional Geometry

We present a new method for computing a smooth minimum distance function...

Barnes-Hut Approximation for Point SetGeodesic Shooting

Geodesic shooting has been successfully applied to diffeo-morphic regist...