Abstract
We study barycentric placement of vertices in periodic graphs of dimension 2 or higher. Barycentric placements exist for every connected periodic graph, are unique up to affine transformations, and provide a versatile tool not only in drawing, but also in computation. Example applications include symmetric convex drawing in dimension 2 as well as determining topological types of crystals and computing their ideal symmetry groups.
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
Bachem, A., Kannan, R.: Polynomial algorithms for computing the Smith and Hermite normal forms of an integer matrix. SIAM Journal Computing 8, 499–507 (1979)
Chung, S.J., Hahn, T., Klee, W.E.: Nomenclature and generation of three-periodic nets: the vector method. Acta Cryst. A40, 42–50 (1984)
Cohen, E., Megiddo, N.: Recognizing properties of periodic graphs. In: Applied geometry and discrete mathematics. DIMACS Ser. Discrete Math. Theoret. Comput. Sci., vol. 4, pp. 135–146. Amer. Math. Soc., Providence (1991)
Delgado Friedrichs, O., Dress, A.W.M., Huson, D.H., Klinowski, J., Mackay, A.L.: Systematic enumeration of crystalline networks. Nature 400, 644–647 (1999)
Delgado-Friedrichs, O.: Equilibrium placement of periodic graphs and tilings (2001) (submitted)
Eades, P.: A heuristic for graph drawing. Congressus Numerantium 42, 149–160 (1984)
Fruchterman, T., Reingold, E.: Graph drawing by force-directed placement. Software—Practice and Experience 21(11), 1129–1164 (1991)
Hahn, T. (ed.): International Tables for Crystallography. A. D. Reidel Publishing Company, Dordrecht (1983)
Klee, W.E.: The topology of crystal structures. Z. Kristallogr. 179, 67–76 (1987)
O’Keeffe, M., Brese, N.E.: Uninodal 4-connected 3d nets. I. Nets without 3- or 4-rings. Acta Cryst. A48, 663–669 (1992)
O’Keeffe, M., Eddaoudi, M., Li, H., Reineke, T., Yaghi, O.M.: Frameworks for extended solids: Geometrical design principles. J. Solid State Chem. 152(1), 3–20 (2000)
Orlin, J.B.: Some problems on dynamic/periodic graphs. In: Progress in combinatorial optimization (Waterloo, Ont., 1982), pp. 273–293. Academic Press, Toronto (1984)
Richter-Gebert, J.: Realization Spaces of Polytopes. Springer, Berlin (1996)
Schwarzenberger, R.L.E.: n-dimensional crystallography. Research Notes in Mathematics, vol. 41. Pitman (Advanced Publishing Program), Boston (1980)
Thomassen, C.: Planarity and duality of finite and infinite graphs. Journal of Combinatorial Theory, Series B 29, 244–271 (1980)
Treacy, M.M.J., Randall, K.H., Rao, S., Perry, J.A., Chadi, D.J.: Enumeration of periodic tetrahedral frameworks. Z. Krist. 212, 768–791 (1997)
Tutte, W.T.: Convex representations of graphs. Proc. London Math. Soc. 10(3), 304–320 (1960)
Tutte, W.T.: How to draw a graph. Proc. London Math. Soc. 13, 743–767 (1963)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Delgado-Friedrichs, O. (2004). Barycentric Drawings of Periodic Graphs. In: Liotta, G. (eds) Graph Drawing. GD 2003. Lecture Notes in Computer Science, vol 2912. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24595-7_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-24595-7_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20831-0
Online ISBN: 978-3-540-24595-7
eBook Packages: Springer Book Archive