Counting Polygon Triangulations is Hard

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Counting Triangulations of a Convex Polygon

In a 1751 letter to Christian Goldbach (1690–1764), Leonhard Euler (1707–1783) discusses the problem of counting the number of triangulations of a convex polygon. Euler, one of the most prolific mathematicians of all times, and Goldbach, who was a Professor of Mathematics and historian at St. Petersburg and later served as a tutor for Tsar Peter II, carried out extensive correspondence, mostly ...

متن کامل

Counting triangulations and pseudo-triangulations of wheels

Motivated by several open questions on triangulations and pseudotriangulations, we give closed form expressions for the number of triangulations and the number of minimum pseudo-triangulations of n points in wheel configurations, that is, with n − 1 in convex position. Although the numbers of triangulations and pseudotriangulations vary depending on the placement of the interior point, their di...

متن کامل

Counting Triangulations of Configurations

Calculating the number of Euclidean triangulations of a convex polygon P with vertices in a finite subset C ⊂ R2 containing all vertices of P seems to be difficult and has attracted some interest, both from an algorithmic and a theoretical point of view, see for instance [1], [2], [3], [4], [5], [7], [9], [10], [11]. The aim of this paper is to describe a class of configurations, convex near-go...

متن کامل

Counting Lattice Triangulations

We discuss the problem to count, or, more modestly, to estimate the number f(m,n) of unimodular triangulations of the planar grid of size m× n. Among other tools, we employ recursions that allow one to compute the (huge) number of triangulations for small m and rather large n by dynamic programming; we show that this computation can be done in polynomial time if m is fixed, and present computat...

متن کامل

Counting Colored Random Triangulations

We revisit the problem of enumeration of vertex-tricolored planar random triangulations solved in [Nucl. Phys. B 516 [FS] (1998) 543-587] in the light of recent combinatorial developments relating classical planar graph counting problems to the enumeration of decorated trees. We give a direct combinatorial derivation of the associated counting function, involving tricolored trees. This is gener...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete & Computational Geometry

سال: 2020

ISSN: 0179-5376,1432-0444

DOI: 10.1007/s00454-020-00251-7