TUHH Open Research
Help
  • Log In
    New user? Click here to register.Have you forgotten your password?
  • English
  • Deutsch
  • Communities & Collections
  • Publications
  • Research Data
  • People
  • Institutions
  • Projects
  • Statistics
  1. Home
  2. TUHH
  3. Publication References
  4. Which point sets admit a k-angulation?
 
Options

Which point sets admit a k-angulation?

Publikationstyp
Journal Article
Date Issued
2014
Sprache
English
Author(s)
Payne, Michael Stuart  
Schmidt, Jens M.  orcid-logo
Wood, David R.  
TORE-URI
http://hdl.handle.net/11420/7592
Journal
Journal of computational geometry  
Volume
5
Start Page
41-55
Citation
Journal of Computational Geometry (5): 41-55 (2014)
Publisher DOI
10.20382/jocg.v5i1a3
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² points, the only obstructions are those that follow from Euler's formula.
TUHH
Weiterführende Links
  • Contact
  • Send Feedback
  • Cookie settings
  • Privacy policy
  • Impress
DSpace Software

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science
Design by effective webwork GmbH

  • Deutsche NationalbibliothekDeutsche Nationalbibliothek
  • ORCiD Member OrganizationORCiD Member Organization
  • DataCiteDataCite
  • Re3DataRe3Data
  • OpenDOAROpenDOAR
  • OpenAireOpenAire
  • BASE Bielefeld Academic Search EngineBASE Bielefeld Academic Search Engine
Feedback