Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
158 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

On Numbers of Pseudo-Triangulations (1210.7126v1)

Published 26 Oct 2012 in cs.CG, cs.DM, and math.CO

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 $\Omega (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 $\Omega (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.

Citations (1)

Summary

We haven't generated a summary for this paper yet.