Triangulations of nearly convex polygons

Details Triangulations of nearly convex polygons Triangulations of nearly convex polygons

2010-12-10

arxiv.org/abs/1012.2206v1

Mathematics

Combinatorics

Scientific paper

Counting Euclidean triangulations with vertices in a finite set $\C$ of the convex hull $\conv(\C)$ of $\C$ is difficult in general, both algorithmically and theoretically. The aim of this paper is to describe nearly convex polygons, a class of configurations for which this problem can be solved to some extent. Loosely speaking, a nearly convex polygon is an infinitesimal perturbation of a weakly convex polygon (a convex polygon with edges subdivided by additional points). Our main result shows that the triangulation polynomial, enumerating all triangulations of a nearly convex polygon, is defined in a straightforward way in terms of polynomials associated to the ``perturbed'' edges.

Affiliated with

Also associated with

No associations

Rating

Triangulations of nearly convex polygons does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Triangulations of nearly convex polygons, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Triangulations of nearly convex polygons will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-107384