POLYLLA: Polygonal meshing algorithm based on terminal-edge regions
Sergio Salinas, Nancy Hitschfeld-Kahler, Alejandro Ortiz-Bernardin,, Hang Si

TL;DR
Polylla is a new polygonal meshing algorithm that constructs meshes from triangulations by identifying terminal-edge regions, producing simpler, faster meshes with comparable numerical performance to Voronoi-based meshes.
Contribution
The paper introduces Polylla, a novel, efficient polygonal meshing algorithm that generates meshes with fewer polygons and comparable accuracy to Voronoi meshes, validated through numerical experiments.
Findings
Polylla meshes have fewer polygons than Voronoi meshes.
Polylla algorithm is simpler and faster than constrained Voronoi algorithms.
Numerical performance of VEM on Polylla meshes is comparable to Voronoi meshes.
Abstract
This paper presents an algorithm to generate a new kind of polygonal mesh obtained from triangulations. Each polygon is built from a terminal-edge region surrounded by edges that are not the longest-edge of any of the two triangles that share them. The algorithm is termed Polylla and is divided into three phases. The first phase consists of labeling each edge of the input triangulation according to its size; the second phase builds polygons (simple or not) from terminal-edges regions using the label system; and the third phase transforms each non simple polygon into simple ones. The final mesh contains polygons with convex and non convex shape. Since Voronoi based meshes are currently the most used polygonal meshes, we compare some geometric properties of our meshes against constrained Voronoi meshes. Several experiments were run to compare the shape and size of polygons, the number of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputational Geometry and Mesh Generation · 3D Modeling in Geospatial Applications · Robotic Path Planning Algorithms
