Abstract | ||
---|---|---|
We study general Delaunay-graphs, which are a natural generalizations of Delaunay triangulations to arbitrary families. We prove that for any finite pseudo-disk family and point set, there is a plane drawing of their Delaunay-graph such that every edge lies inside every pseudo-disk that contains its endpoints. |
Year | Venue | Field |
---|---|---|
2018 | arXiv: Computational Geometry | Graph,Discrete mathematics,Combinatorics,Generalization,Point set,Mathematics,Delaunay triangulation |
DocType | Volume | Citations |
Journal | abs/1806.04217 | 0 |
PageRank | References | Authors |
0.34 | 0 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Balázs Keszegh | 1 | 156 | 24.36 |
Dömötör Pálvölgyi | 2 | 202 | 29.14 |