Mathematics – Combinatorics
Scientific paper
2007-06-21
Discrete Comput. Geom., 41(2), 2009, 284-317
Mathematics
Combinatorics
40 pages, 24 figures; added references, update Section 8
Scientific paper
10.1007/s00454-008-9078-6
Maximal $(k+1)$-crossing-free graphs on a planar point set in convex position, that is, $k$-triangulations, have received attention in recent literature, with motivation coming from several interpretations of them. We introduce a new way of looking at $k$-triangulations, namely as complexes of star polygons. With this tool we give new, direct, proofs of the fundamental properties of $k$-triangulations, as well as some new results. This interpretation also opens-up new avenues of research, that we briefly explore in the last section.
Pilaud Vincent
Santos Francisco
No associations
LandOfFree
Multi-triangulations as complexes of star 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 Multi-triangulations as complexes of star polygons, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multi-triangulations as complexes of star polygons will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-192586