Payne, Michael StuartMichael StuartPayneSchmidt, Jens M.Jens M.SchmidtWood, David R.David R.Wood2020-10-192020-10-192014Journal of Computational Geometry (5): 41-55 (2014)http://hdl.handle.net/11420/7592For 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² points, the only obstructions are those that follow from Euler's formula.en1920-180X201441-55Journal Article10.20382/jocg.v5i1a3Other