Mathematics – Combinatorics
Scientific paper
2012-03-16
Mathematics
Combinatorics
13 pages, 7 figures
Scientific paper
For k >= 3, a k-angulation is a 2-connected plane graph in which every internal face is a k-gon. We say that a point set P admits a plane graph G if there is a straight-line drawing of G that maps V(G) onto P and has the same facial cycles and outer face as G. We investigate the conditions under which a point set P admits a k-angulation and find that, for sets containing at least 2k^2 points, the only obstructions are those that follow from Euler's formula.
Payne Michael S.
Schmidt Jens M.
Wood David R.
No associations
LandOfFree
Which point sets admit a k-angulation? 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 Which point sets admit a k-angulation?, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Which point sets admit a k-angulation? will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-349381