Generating irreducible triangulations of surfaces

Details Generating irreducible triangulations of surfaces Generating irreducible triangulations of surfaces

2006-06-27

arxiv.org/abs/math/0606687v1

Mathematics

Combinatorics

11 pages

Scientific paper

Starting with the irreducible triangulations of a fixed surface and splitting vertices, all the triangulations of the surface up to a given number of vertices can be generated. The irreducible triangulations have previously been determined for the surfaces S_0, S_1, N_1,and N_2. An algorithm is presented for generating the irreducible triangulations of a fixed surface using triangulations of other surfaces. This algorithm has been implemented as a computer program which terminates for S_1, S_2, N_1, N_2, N_3, and N_4. Thus the complete sets irreducible triangulations are now also known for S_2, N_3, and N_4, with respective cardinalities 396784, 9708, and 6297982.

Affiliated with

Also associated with

No associations

Rating

Generating irreducible triangulations of surfaces 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 Generating irreducible triangulations of surfaces, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Generating irreducible triangulations of surfaces will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-572466