Polyhedral Boolean Operations is a computational method in solid modeling that performs Boolean set operations—such as union, intersection, and difference—on polyhedral solids by explicitly constructing and manipulating their boundary representations through geometric and topological computations.
20
Publications
1.2K
Citations
36
Authors
21
Institutions
Publications per year
2017–2026
0
Parents
Publications
20
Merging BSP trees yields polyhedral set operations
Bruce Naylor, John Amanatides, William Thibault · 1990 · 213 citations
Checker Boards and Polyominoes
S. W. Golomb · American Mathematical Monthly · 1954 · 162 citations
1–5 of 20
Authors
36
- AP
2
h-index
- PB
2
h-index
- IN
2
h-index
- CB
2
h-index
- WT
2
h-index
1–5 of 36
Institutions
21
Universitat Politècnica de Catalunya
Barcelona, Spain
3 h-index
8 publications
331 citations
Masaryk University
Brno, Czechia
2 h-index
3 publications
62 citations
Boston University
Boston, United States
2 h-index
6 publications
129 citations
California State University System
Long Beach, United States
2 h-index
2 publications
323 citations
Harvard University Press
Cambridge, United States
2 h-index
2 publications
230 citations
York University
Toronto, Canada
2 h-index
2 publications
323 citations
AT&T (United States)
Bedminster, United States
2 h-index
2 publications
323 citations
Roma Tre University
Rome, Italy
1 h-index
2 publications
28 citations
1–8 of 21
Venues
- Computer-Aided Design
5 publications · 117 citations
5
h-index
- ACM Transactions on Graphics
TOG · 2 publications · 196 citations
2
h-index
- Computer Graphics Forum
2 publications · 101 citations
2
h-index
- American Mathematical Monthly
2 publications · 230 citations
2
h-index
- HAL (Le Centre pour la Communication Scientifique Directe)
Repository · 1 publications · 14 citations
1
h-index
1–5