Happy endings for flip graphs

Details Happy endings for flip graphs Happy endings for flip graphs

2006-10-15

arxiv.org/abs/cs/0610092v2

Journal of Computational Geometry 1(1):3-28, 2010.

Computer Science

Computational Geometry

26 pages, 15 figures. Revised and expanded for journal publication

Scientific paper

We show that the triangulations of a finite point set form a flip graph that
can be embedded isometrically into a hypercube, if and only if the point set
has no empty convex pentagon. Point sets of this type include convex subsets of
lattices, points on two lines, and several other infinite families. As a
consequence, flip distance in such point sets can be computed efficiently.

Affiliated with

Also associated with

No associations

Rating

Happy endings for flip graphs 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 Happy endings for flip graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Happy endings for flip graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-476977