Concepedia

Complexity Of Crossings

Complexity of Crossings is a theoretical construct in computational geometry that quantifies the inherent combinatorial intricacy of intersection patterns formed by a finite arrangement of curves in the plane, distinguishing it from simpler geometric configurations by capturing the asymptotic growth rate of crossing points with respect to the number of curves.

101

Publications

4.1K

Citations

159

Authors

125

Institutions

Publications per year

2017–2026

10

Parents

Publications

101

Crossing Number is NP-Complete

M. R. Garey, David S. Johnson · SIAM Journal on Algebraic and Discrete Methods · 1983 · 669 citations

, , +17

Graphs drawn with few crossings per edge

János Pach · COMBINATORICA · 1997 · 299 citations · Full text

, , +13

The crossing number of K

Daniel J. Kleitman · Journal of Combinatorial Theory · 1970 · 187 citations

, , +8

Crossing patterns of semi-algebraic sets

Noga Alon, János Pach, Rom Pinchasi et al. · Journal of Combinatorial Theory Series A · 2005 · 114 citations · Full text

, , +10

Algorithms for graphs embeddable with few crossings per edge

Research Publications (Maastricht University) · 2007 · 114 citations

, , +13

1–5 of 101

Authors

159

  1. GS
    Gelasio Salazar

    Autonomous University of San Luis Potosí, Mexico

    7 publications · 179 citations

    7

    h-index

  2. JP
    János Pach

    Hungarian Academy of Sciences, Hungary

    6 publications · 609 citations

    6

    h-index

  3. RB
    R. Bruce Richter

    University of Waterloo, Canada

    5 publications · 179 citations

    5

    h-index

  4. PM
    Petra Mutzel

    TU Dortmund University, Germany

    4 publications · 128 citations

    4

    h-index

  5. BM
    Bernardo M. Ábrego

    California State University, Northridge, United States

    4 publications · 108 citations

    4

    h-index

1–5 of 159

Institutions

125

  1. Autonomous University of San Luis Potosí

    San Luis Potosí City, Mexico

    6 h-index

    7 publications

    192 citations

  2. Massachusetts Institute of Technology

    Cambridge, United States

    5 h-index

    13 publications

    621 citations

  3. Technical University of Košice

    Košice, Slovakia

    5 h-index

    7 publications

    124 citations

  4. Alfréd Rényi Institute of Mathematics

    Budapest, Hungary

    4 h-index

    8 publications

    385 citations

  5. Carleton University

    Ottawa, Canada

    3 h-index

    5 publications

    142 citations

  6. Slovak Academy of Sciences

    Bratislava, Slovakia

    3 h-index

    4 publications

    59 citations

  7. Charles University

    Prague, Czechia

    3 h-index

    6 publications

    168 citations

  8. University of Waterloo

    Waterloo, Canada

    3 h-index

    3 publications

    97 citations

1–8 of 125

Venues

  1. Discrete & Computational Geometry

    7 publications · 269 citations

    7

    h-index

  2. Algorithmica

    5 publications · 194 citations

    5

    h-index

  3. Discrete Mathematics

    4 publications · 129 citations

    5

    h-index

  4. Journal of Combinatorial Theory Series B

    4 publications · 163 citations

    4

    h-index

  5. Computational Geometry

    4 publications · 65 citations

    4

    h-index

1–5