On Numbers of Pseudo-Triangulations

Abstract

We study the maximum numbers of pseudo-triangulations and pointed pseudo-triangulations that can be embedded over a specific set of points in the plane or contained in a specific triangulation. We derive the bounds O(5.45N) and (2.41N) for the maximum number of pointed pseudo-triangulations that can be contained in a specific triangulation over a set of N points. For the number of all pseudo-triangulations contained in a triangulation we derive the bounds O*(6.54N) and (3.30N). We also prove that O*(89.1N) pointed pseudo-triangulations can be embedded over any specific set of N points in the plane, and at most 120N general pseudo-triangulations.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…