Concepedia

Boolean Union

Boolean Union is a Boolean operation that combines two or more geometric or set-theoretic operands into a single entity by preserving all regions that are contained in at least one of the operands, thereby forming their logical disjunction.

3

Publications

421

Citations

8

Authors

5

Institutions

Publications per year

2017–2026

0

Parents

Publications

3

1–3 of 3

Authors

8

  1. MI
    Masatomo Inui

    Ibaraki University, Japan

    1 publications · 11 citations

    1

    h-index

  2. YS
    Yehoshua Sagiv

    Hebrew University of Jerusalem, Israel

    1 publications · 371 citations

    1

    h-index

  3. HK
    Haim Kaplan

    Tel Aviv University, Israel

    1 publications · 39 citations

    1

    h-index

  4. MY
    Mihalis Yannakakis

    AT&T (United States), United States

    1 publications · 371 citations

    1

    h-index

  5. NS
    Nira Shafrir

    Tel Aviv University, Israel

    1 publications · 39 citations

    1

    h-index

1–5 of 8

Institutions

5

  1. Princeton University

    Princeton, United States

    2 h-index

    2 publications

    410 citations

  2. Tel Aviv University

    Tel Aviv, Israel

    1 h-index

    2 publications

    78 citations

  3. Ibaraki University

    Ibaraki, Japan

    1 h-index

    3 publications

    33 citations

  4. Hitachi (Japan)

    Tokyo, Japan

    1 h-index

    3 publications

    33 citations

  5. University of Illinois Urbana-Champaign

    Urbana, United States

    1 h-index

    1 publications

    371 citations

1–5 of 5

Venues

  1. Journal of the ACM

    JACM · 1 publications · 371 citations

    1

    h-index

  2. Journal of Computational Design and Engineering

    JCDE · 1 publications · 11 citations

    1

    h-index

1–2