Non-Crossing Frameworks with Non-Crossing Reciprocals

被引:0
|
作者
David Orden
Günter Rote
Francisco Santos
Brigitte Servatius
Herman Servatius
Walter Whiteley
机构
[1] Departamento de Matemáticas,
[2] Estadística y Computación,undefined
[3] Universidad de Cantabria,undefined
[4] E-39005 Santander ,undefined
[5] Institut für Informatik,undefined
[6] Freie Universität Berlin,undefined
[7] Takustraße 9,undefined
[8] D-14195 Berlin,undefined
[9] Department of Mathematical Sciences,undefined
[10] Worcester Polytechnic Institute,undefined
[11] Worcester,undefined
[12] MA 01609,undefined
[13] Department of Mathematics and Statistics,undefined
[14] York University,undefined
[15] Toronto,undefined
[16] Ontario,undefined
[17] M3J 1P3,undefined
来源
关键词
Computational Mathematic; Special Interest; Geometric Property; Planar Graph; Sign Pattern;
D O I
暂无
中图分类号
学科分类号
摘要
We study non-crossing frameworks in the plane for which the classical reciprocal on the dual graph is also non-crossing. We give a complete description of the self-stresses on non-crossing frameworks G whose reciprocals are non-crossing, in terms of: the types of faces (only pseudo-triangles and pseudo-quadrangles are allowed); the sign patterns in the stress on G; and a geometric condition on the stress vectors at some of the vertices. As in other recent papers where the interplay of non-crossingness and rigidity of straight-line plane graphs is studied, pseudo-triangulations show up as objects of special interest. For example, it is known that all planar Laman circuits can be embedded as a pseudo-triangulation with one non-pointed vertex. We show that for such pseudo-triangulation embeddings of planar Laman circuits which are sufficiently generic, the reciprocal is non-crossing and again a pseudo-triangulation embedding of a planar Laman circuit. For a singular (non-generic) pseudo-triangulation embedding of a planar Laman circuit, the reciprocal is still non-crossing and a pseudo-triangulation, but its underlying graph may not be a Laman circuit. Moreover, all the pseudo-triangulations which admit a non-crossing reciprocal arise as the reciprocals of such, possibly singular, stresses on pseudo-triangulation Laman circuits. All self-stresses on a planar graph correspond to liftings to piecewise linear surfaces in 3-space. We prove characteristic geometric properties of the lifts of such non-crossing reciprocal pairs.
引用
收藏
页码:567 / 600
页数:33
相关论文
共 50 条
  • [1] Non-crossing frameworks with non-crossing reciprocals
    Orden, D
    Rote, G
    Santos, F
    Servatius, B
    Servatius, H
    Whiteley, W
    [J]. DISCRETE & COMPUTATIONAL GEOMETRY, 2004, 32 (04) : 567 - 600
  • [2] Comparison between the non-crossing and the non-crossing on lines properties
    Campbell, D.
    Pratelli, A.
    Radici, E.
    [J]. JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 2021, 498 (01)
  • [3] Non-Crossing Tableaux
    Pavlo Pylyavskyy
    [J]. Annals of Combinatorics, 2009, 13 : 323 - 339
  • [4] Non-crossing matchings
    A. A. Vladimirov
    [J]. Problems of Information Transmission, 2013, 49 : 54 - 57
  • [5] Enumerating non-crossing minimally rigid frameworks
    Avis, David
    Katoh, Naoki
    Ohsaki, Makoto
    Streinu, Ileana
    Tanigawa, Shin-ichi
    [J]. GRAPHS AND COMBINATORICS, 2007, 23 (Suppl 1) : 117 - 134
  • [6] Enumerating Non-crossing Minimally Rigid Frameworks
    David Avis
    Naoki Katoh
    Makoto Ohsaki
    Ileana Streinu
    Shin-ichi Tanigawa
    [J]. Graphs and Combinatorics, 2007, 23 : 117 - 134
  • [7] Non-Crossing Tableaux
    Pylyavskyy, Pavlo
    [J]. ANNALS OF COMBINATORICS, 2009, 13 (03) : 323 - 339
  • [8] Non-crossing matchings
    Vladimirov, A. A.
    [J]. PROBLEMS OF INFORMATION TRANSMISSION, 2013, 49 (01) : 54 - 57
  • [9] Enumerating non-crossing minimally rigid frameworks
    Avis, David
    Katoh, Naoki
    Ohsaki, Makoto
    Streinu, Ileana
    Tanigawa, Shin-ichi
    [J]. COMPUTING AND COMBINATORICS, PROCEEDINGS, 2006, 4112 : 205 - 215
  • [10] The non-crossing graph
    Linial, N
    Saks, M
    Statter, D
    [J]. ELECTRONIC JOURNAL OF COMBINATORICS, 2006, 13 (01):