which point sets admit a $k$-angulation?
Clicks: 3
ID: 150264
2014
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This
article has not been analysed, so there is no overall score —
reader engagement is measured and shown alongside.
Reader Engagement
Steady Performance
0.6
/100
3 views
2 readers
AI Quality Assessment
Not analyzed
Readership in this journal
SteadyRanked #19 of 19 articles by views in canadian journal of infectious diseases and medical microbiology
Most read
Least read
Bar heights use a square-root scale.
Mint this article as an NFT
Not yet mintedCreate a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.
5
SUSD
one-off · no wallet required
Abstract
For \(k\ge 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.
| Reference Key |
payne2014journalwhich
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | ;Michael S. Payne;Jens M. Schmidt;David R. Wood |
| Journal | canadian journal of infectious diseases and medical microbiology |
| Year | 2014 |
| DOI |
10.20382/jocg.v5i1a3
|
| URL | |
| Keywords | Keywords not found |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.