Name
Abstract | ||
|---|---|---|
Maximal (k+1)-crossing-free graphs on a planar point set in convex position, that is, k-triangulations, have received attention in recent literature, motivated by 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. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1007/s00454-008-9078-6 | Discrete & Computational Geometry |
Keywords | Field | DocType |
Generalized triangulation,Crossing-free graph,Star polygons,Flips,Associahedron | Discrete mathematics,Topology,Graph,Polygon,Combinatorics,Associahedron,Star polygon,Mathematical proof,Point in polygon,Star-shaped polygon,Convex position,Mathematics | Journal |
Volume | Issue | ISSN |
41 | 2 | Discrete Comput. Geom., 41(2):284-317, 2009 |
Citations | PageRank | References |
10 | 0.72 | 14 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Vincent Pilaud | 1 | 57 | 10.15 |
| Francisco Santos | 2 | 64 | 10.99 |