Barycentric Drawings of Periodic Graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2912, Issue , 2004, Pages 178-189

  Delgado Friedrichs, Olaf ^a  

^a UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DRAWING (GRAPHICS);

AFFINE TRANSFORMATIONS; CONVEX DRAWINGS; SYMMETRY GROUPS; VERSATILE TOOLS;

CRYSTAL SYMMETRY;

EID: 27744591286     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24595-7_17     Document Type: Article

References (18)

1. [BK79] A. Bachem and R. Kannan. Polynomial algorithms for computing the Smith and Hermite normal forms of an integer matrix. SIAM Journal Computing, 8:499-507, 1979.
2. [CHK84] S. J. Chung, Th. Hahn, and W.E. Klee. Nomenclature and generation of three-periodic nets: the vector method. Acta Cryst., A40:42-50, 1984.
3. [CM91] Edith Cohen and Nimrod Megiddo. Recognizing properties of periodic graphs. In Applied geometry and discrete mathematics, volume 4 of DIMACS Ser. Discrete Math. Theoret. Comput. Sci., pages 135-146. Amer. Math. Soc., Providence, RI, 1991.
4. +99] O. Delgado Friedrichs, A.W.M. Dress, D.H. Huson, J. Klinowski, and A.L. Mackay. Systematic enumeration of crystalline networks. Nature, 400:644-647, 1999.
5. [Del01] O. Delgado-Friedrichs. Equilibrium placement of periodic graphs and tilings, submitted, 2001.
6. [Ead84] P. Eades. A heuristic for graph drawing. Congressus Numerantium, 42:149-160, 1984.
7. [FR91] T. Fruchterman and E. Reingold. Graph drawing by force-directed placement. Software-Practice and Experience, 21(11):1129-1164, 1991.
8. [Hah83] T. Hahn, editor. International Tables for Crystallography, volume A. D. Reidel Publishing Company, Dordrecht, Boston, 1983.
9. [Kle87] W.E. Klee. The topology of crystal structures. Z. Kristallogr., 179:67-76, 1987.
10. [OB92] M. O'Keeffe and N. E. Brese. Uninodal 4-connected 3d nets. I. Nets without 3- or 4-rings. Acta Cryst., A48:663-669, 1992.
11. +00] M. O'Keeffe, M. Eddaoudi, Hailian Li, T. Reineke, and O. M. Yaghi. Frameworks for extended solids: Geometrical design principles. J. Solid State Chem., 152(1):3-20, 2000.
12. [Orl84] James B. Orlin. Some problems on dynamic/periodic graphs. In Progress in combinatorial optimization (Waterloo, Ont., 1982), pages 273-293. Academic Press, Toronto, ON, 1984.
13. [RG96] Jürgen Richter-Gebert. Realization Spaces of Polytopes. Springer Verlag, Berlin, 1996.
14. [Sch80] Rolf L. E. Schwarzenberger. n-dimensional crystallography, volume 41 of Research Notes in Mathematics. Pitman (Advanced Publishing Program), Boston, Mass., 1980.
15. [Tho80] C. Thomassen. Planarity and duality of finite and infinite graphs. Journal of Combinatorial Theory, Series B, 29:244-271, 1980.
16. +97] M.M.J. Treacy, K.H. Randall, S. Rao, J.A. Perry, and D.J. Chadi. Enumeration of periodic tetrahedral frameworks. Z. Krist., 212:768-791, 1997.
17. [Tut60] W.T. Tutte. Convex representations of graphs. Proc. London Math. Soc. (3), 10:304-320, 1960.
18. [Tut63] W.T. Tutte. How to draw a graph. Proc. London Math. Soc., 13:743-767, 1963.