Non-crossing frameworks with non-crossing reciprocals

Discrete and Computational Geometry

Volumn 32, Issue 4, 2004, Pages 567-600

  Orden, David ^a   Rote, Günter ^b   Santos, Francisco ^a   Servatius, Brigitte ^c   Servatius, Herman ^c   Whiteley, Walter ^d  

^a UNIVERSITY OF CANTABRIA   (Spain)

^b FREIE UNIVERSITÄT BERLIN   (Germany)

^c Life Science and Bioengineering Center   (United States)

^d YORK UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 12144250662     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00454-004-1139-x     Document Type: Article

References (28)

1. O. Aichholzer, F. Aurenhammer, P. Braß, and H. Krasser, Spatial embeddings of pseudo-triangulations, Proc. 19th Ann. Symp. Comput. Geom., 2003, pp. 144-153.
2. P. Ash, E. Bolker, H. Crapo, and W. Whiteley, Convex polyhedra, Dirichlet tessellations, and spider webs, in Shaping Space: A Polyhedral Approach (M. Senechal and G. Fleck, eds.), Birkhäuser, Boston, MA, 1988, pp. 231-250.
3. I. Bárány, The limit shape of convex lattice polygons, Discrete Comput. Geom. 13 (1995), 270-295.
4. I. Bárány, G. Rote, W. Steiger, and C.-H. Zhang, A central limit theorem for convex chains in the square, Discrete Comput. Geom. 23 (2000), 35-50.
5. R. Bow, Economics of Construction in Relation to Framed Structures, E. and F. N. Spon, London, 1873.
6. H. Crapo and W. Whiteley, Plane self stresses and projected polyhedra, I: the basic pattern, Structural Topology 20 (1993), 55-78.
7. H. Crapo and W. Whiteley, Spaces of stresses, projections and parallel drawings for spherical polyhedra, Beiträge Algebra Geom. 35(2) (1994), 259-281.
8. L. Cremona, Le Figure Reciproche Nella Statica Grafica, Milano, 1872. English translation: Graphical Statics, Oxford University Press, Oxford, 1890.
9. L. Cremona, Le Figure Reciproche Nella Statica Grafica, Milano, 1872. English translation: Graphical Statics, Oxford University Press, Oxford, 1890.
10. C. Culmann, Die graphische Statik, Meyer und Zeller, Zürich, 1866.
11. J. Graver, B. Servatius, and H. Servatius, Combinatorial Rigidity, Graduate Studies in Mathematics, vol. 2, American Mathematical Society, Providence, RI, 1993.
12. R. Haas, D. Orden, G. Rote, F. Santos, B. Servatius, H. Servatius, D. Souvaine, I. Streinu, and W. Whiteley, Planar minimally rigid graphs and pseudo-triangulations, Proc. 19th Ann. Symp. Comput. Geom., 2003, pp. 154-163. Full version (preprint July 2003, 25 pages) available at http://arxiv.org/abs/ math.CO/0307347.
13. D. A. Huffman, Impossible objects as nonsense sentences, in Machine Intelligence, Vol. 6 (B. Meltzer and D. Michie, eds.), Edinburgh University Press, Edinburgh, 1971, pp. 295-323.
14. D. A. Huffman, A duality concept for the analysis of polyhedral scenes, in Machine Intelligence, Vol. 8 (E. W. Elcock and D. Michie, eds.), Wiley, New York, 1977, pp. 475-492.
15. B. Jackson and T. Jordán, Connected rigidity matroids and unique realizations of graphs, Technical Report TR-2002-12, Egerváry Research Group on Combinatorial Optimization, Budapest, 2002. www.cs.elte.hu/egres.
16. G. Laman, On graphs and rigidity of plane skeletal structures, J. Engrg. Math. 4 (1970), 331-340.
17. J. C. Maxwell, On reciprocal figures and diagrams of forces, Philos. Mag. 4(27) (1864), 250-261.
18. D. Orden, F. Santos, B. Servatius, and H. Servatius, Combinatorial pseudo-triangulations, preprint, July 2003. http://arxiv.org/abs/math.CO/ 0307370.
19. D. Orden and F. Santos, The polytope of non-crossing graphs on a planar point set, preprint, February 2003. http://arxiv.org/abs/math.co/0302126.
20. G. Rote, F. Santos, and I. Streinu, Expansive motions and the polytope of pointed pseudo-triangulations, in Discrete and Computational Geometry - The Goodman-Pollack Festschrift (B. Aronov, S. Basu, J. Pach, and M. Sharir, eds.), Algorithms and Combinatorics, Vol. 25, Springer-Verlag, Berlin, 2003, pp. 699-736. arxiv.org/abs/math.CO/0206027.
21. G. Rote, C. A. Wang, L. Wang, and Y. Xu, On constrained minimum pseudotriangulations, in Computing and Combinatorics, Proc. 9th Internat. Comput. Combin. Conf. (COCOON 2003), July 2003 (T. Warnow and B. Zhu, eds.), Lecture Notes in Computer Science, Springer-Verlag, Berlin, 2003. http://page.inf.fu-berlin.de/ ~rote/Papers/abstract/ On+constrained+minimum+pseudotriangulations.html.
22. B. Roth and W. Whiteley, Tensegrity frameworks, Trans. Amer. Math. Soc. 177 (1981), 419-446.
23. E. Steinitz, Polyeder und Raumeinteilungen, in Encyklopädie der mathematischen Wissenschaften, Vol. 3, part 3AB12 (W. F. Meyer and H. Mohrmann, eds.), Teubner, Leipzig, 1922, pp. 1-139.
24. I. Streinu, A combinatorial approach to planar non-colliding robot arm motion planning, Proc. 41st Symp. Found. Comput. Sci. (FOCS), Redondo Beach, California (2000), pp. 443-453.
25. W. T. Tutte, How to draw a graph, Proc. London Math. Soc. 13 (1963), 743-768.
26. N. White and W. Whiteley, The algebraic geometry of stress in frameworks, SIAM J. Algebraic Discrete Methods 4 (1983), 481-511.
27. W. Whiteley, Motions and stresses of projected polyhedra, Structural Topology 7 (1982), 13-38.
28. W. Whiteley, Matroids and rigid structures, in Matroid Applications (N. White, ed.), Cambridge University Press, Cambridge, 1992, pp. 1-53.