Polygon Extraction from Triangular Meshes

02/05/2020
∙
by   Jeremy Castagno, et al.
∙
0
∙

This paper presents Polylidar, an efficient algorithm to extract non-convex polygons from 2D point sets. Polylidar is able to extract multiple disjoint polygons and capture interior holes. 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 meshes representing the shape of the point set. The key to Polylidar's speed, and the main contribution of this paper, is in efficiently transforming each triangular mesh into a concave polygon. This paper describes Polylidar and provides benchmarks to comparatively evaluate its speed and accuracy. Results show good accuracy and ∼ 4 times speedup compared to other concave polygon extraction methods.

READ FULL TEXT

Please sign up or login with your details

Continue with:
Or login with email
Enter Password
Re-enter Password

Forgot password? Click here to reset
Success!
Error Icon An error occurred

Sign in with Google

×

Use your Google Account to sign in to DeepAI

×
Pro

Consider DeepAI Pro

Subscribe to DeepAI Pro
DeepAI Pro
Provides a limited generation allowance each month. When exceeded, you are charged overage rates available at deepai.org/pricing. Also includes an ad-free experience and API access. Renews automatically until canceled. Non-refundable.
Subtotal
Total due today

Payment

Add DeepAI credits
DeepAI credits
One-time purchase. Credits are added to your wallet after payment.
Subtotal
Total due today

Payment