Abstract
We show that an abstract simplicial complex Δ may be realized on a grid of IRd-1, where d = dim P(Δ) is the order dimension (Dushnik-Miller dimension) of the face poset of Δ.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
L. Barany, R. Howe, and H. Scarf, The complex of maximal lattice free simplices, Mathematical Programming 66 (Ser. A) (1994), 273–281.
D. Bayer, I. Peeva, and B. Sturmfels, Monomial resolutions, AMS electronic preprint #1996-10-14-012, 1996, (a.k.a. alg-geom/9610012).
G. Brightwell and W.T. Trotter, The order dimension of convex polytopes, SIAM Journal of Discrete Mathematics 6 (1993), 230–245.
—, The order dimension of planar maps, SIAM jouranl on Discrete Mathematics 10 (1997), no. 4, 515–528.
H. de Fraysseix and P. Ossona de Mendez, On topological aspects of orientations, Proc. of the Fifth Czech-Slovak Symposium on Combinatorics, Graph Theory, Algorithms and Applications, Discrete Math., (to appear).
—, Regular orientations, arboricity and augmentation, DIMACS International Workshop, Graph Drawing 94, Lecture notes in Computer Science, vol. 894, 1995, pp. 111–118.
H. de Fraysseix, P. Ossona de Mendez, and P. Rosenstiehl, On triangle contact graphs, Combinatorics, Probability and Computing 3 (1994), 233–246.
H. de Fraysseix, J. Pach, and R. Pollack, Small sets supporting Fary embeddings of planar graphs, Twentieth Annual ACM Symposium on Theory of Computing, 1988, pp. 426–433.
—, How to draw a planar graph on a grid, Combinatorica10 (1990), 41–51.
B. Dushnik, Concerning a certain set of arrangements, Proceedings of the AMS, vol. 1, 1950, pp. 788–796.
B. Dushnik and E.W. Miller, Partially ordered sets, Amer. J. Math. 63 (1941), 600–610.
T. Hibi, Algebraic combinatorics on convex polytopes, Carlslaw Publications, 1992.
G. Kant, Algorithms for drawing planar graphs, Ph.D. thesis, Utrecht University, Utrecht, 1993.
H. Scarf, The computation of economic equilibria, Cowles foundation monograph, vol. 24, Yale University Press, 1973.
W. Schnyder, Planar graphs and poset dimension, Order 5 (1989), 323–343.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
de Mendez, P.O. (1999). Geometric Realization of Simplicial Complexes. In: Kratochvíyl, J. (eds) Graph Drawing. GD 1999. Lecture Notes in Computer Science, vol 1731. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46648-7_33
Download citation
DOI: https://doi.org/10.1007/3-540-46648-7_33
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66904-3
Online ISBN: 978-3-540-46648-2
eBook Packages: Springer Book Archive