Dushnik-Miller dimension of TD-Delaunay complexes
Abstract
TD-Delaunay graphs, where TD stands for triangular distance, is a variation of the classical Delaunay triangulations obtained from a specific convex distance function. Bonichon et. al. noticed that every triangulation is the TD-Delaunay graph of a set of points in , and conversely every TD-Delaunay graph is planar. It seems natural to study the generalization of this property in higher dimensions. Such a generalization is obtained by defining an analogue of the triangular distance for . It is easy to see that TD-Delaunay complexes of are of Dushnik-Miller dimension . The converse holds for or and it was conjectured independently by Mary and Evans et. al. to hold for larger . Here we disprove the conjecture already for .
Keywords
Cite
@article{arxiv.1803.09576,
title = {Dushnik-Miller dimension of TD-Delaunay complexes},
author = {Daniel Gonçalves and Lucas Isenmann},
journal= {arXiv preprint arXiv:1803.09576},
year = {2018}
}
Comments
A short version appears in the proceedings of EuroCG 2017