On Compatible Triangulations with a Minimum Number of Steiner Points

06/28/2017
by   Anna Lubiw, et al.
0

Two vertex-labelled polygons are compatible if they have the same clockwise cyclic ordering of vertices. The definition extends to polygonal regions (polygons with holes) and to triangulations---for every face, the clockwise cyclic order of vertices on the boundary must be the same. It is known that every pair of compatible n-vertex polygonal regions can be extended to compatible triangulations by adding O(n^2) Steiner points. Furthermore, Ω(n^2) Steiner points are sometimes necessary, even for a pair of polygons. Compatible triangulations provide piecewise linear homeomorphisms and are also a crucial first step in morphing planar graph drawings, aka "2D shape animation". An intriguing open question, first posed by Aronov, Seidel, and Souvaine in 1993, is to decide if two compatible polygons have compatible triangulations with at most k Steiner points. In this paper we prove the problem to be NP-hard for polygons with holes. The question remains open for simple polygons.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/16/2020

Compatible Paths on Labelled Point Sets

Let P and Q be finite point sets of the same cardinality in ℝ^2, each la...
research
03/17/2020

The Parameterized Complexity of Guarding Almost Convex Polygons

Art Gallery is a fundamental visibility problem in Computational Geometr...
research
08/19/2020

Augmenting Geometric Graphs with Matchings

We study noncrossing geometric graphs and their disjoint compatible geom...
research
08/28/2019

The Single-Face Ideal Orientation Problem in Planar Graphs

We consider the ideal orientation problem in planar graphs. In this prob...
research
12/04/2018

Conic Crease Patterns with Reflecting Rule Lines

We characterize when two conic curved creases are compatible with each o...
research
05/10/2022

Burning Number for the Points in the Plane

The burning process on a graph G starts with a single burnt vertex, and ...
research
06/16/2020

Extension complexity of low-dimensional polytopes

Sometimes, it is possible to represent a complicated polytope as a proje...

Please sign up or login with your details

Forgot password? Click here to reset