Deterministic Linear Time Constrained Triangulation using Simplified Earcut

09/09/2020
by   Marco Livesu, et al.
0

Triangulation algorithms that conform to a set of non-intersecting input segments typically proceed in an incremental fashion, by inserting points first, and then segments. Inserting a segment amounts to delete all the triangles it intersects, define two polygons that fill the so generated hole and have the segment as shared basis, and then re-triangulate each polygon separately. In this paper we prove that the polygons generated evacuating the triangles that intersect a constrained segment are such that all their convex vertices but two can be used to form triangles in an earcut fashion, without the need to check whether other polygon points are located within each ear. The fact that any simple polygon contains at least three convex vertices guarantees the existence of a valid ear to cut, ensuring convergence. Not only this translates to an optimal deterministic linear time triangulation algorithm, but such algorithm is also trivial to implement. In this paper we formally prove the correctness of our approach, also validating it in practical applications and comparing it with prior art.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

page 5

page 6

page 7

10/16/2018

Segment representations with small resolution

A segment representation of a graph is an assignment of line segments in...
10/09/2018

Contraction-Based Sparsification in Near-Linear Time

Recently, Kawarabayashi and Thorup presented the first deterministic edg...
06/03/2021

Deterministic Weighted Expander Decomposition in Almost-linear Time

In this note, we study the expander decomposition problem in a more gene...
03/02/2021

On Optimal w-gons in Convex Polygons

Let P be a set of n points in ℝ^2. For a given positive integer w<n, our...
04/03/2018

The exact chromatic number of the convex segment disjointness graph

Let P be a set of n points in strictly convex position in the plane. Let...
10/25/2020

How to Find the Convex Hull of All Integer Points in a Polyhedron?

We propose a cut-based algorithm for finding all vertices and all facets...
01/05/2020

All non-trivial variants of 3-LDT are equivalent

The popular 3-SUM conjecture states that there is no strongly subquadrat...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.