Spatial Subdivision Algorithms is a computational method that recursively partitions geometric space into non-overlapping subregions to facilitate efficient spatial querying and hierarchical representation within algorithmic form generation.
60
Publications
2.5K
Citations
153
Authors
71
Institutions
Publications per year
2017–2026
7
Parents
Publications
60
Merging BSP trees yields polyhedral set operations
Bruce Naylor, John Amanatides, William Thibault · 1990 · 213 citations
Efficient computation of a simplified medial axis
Mark Foskey, Dinesh Manocha · 2003 · 127 citations
1–5 of 60
Authors
153
- MF
3
h-index
- DMDinesh Manocha
University of North Carolina at Chapel Hill, United States
3 publications · 183 citations
3
h-index
- ER
2
h-index
- AS
2
h-index
- EB
2
h-index
1–5 of 153
Institutions
71
University of Maryland, College Park
College Park, United States
4 h-index
4 publications
150 citations
University of North Carolina at Chapel Hill
Chapel Hill, United States
3 h-index
9 publications
549 citations
Microsoft (United States)
Redmond, United States
2 h-index
4 publications
240 citations
Helsinki Institute for Information Technology
Espoo, Finland
2 h-index
2 publications
90 citations
Chinese Academy of Sciences
Beijing, China
2 h-index
9 publications
106 citations
California State University System
Long Beach, United States
2 h-index
2 publications
323 citations
Carnegie Mellon University
Pittsburgh, United States
2 h-index
4 publications
233 citations
Ben-Gurion University of the Negev
Beersheba, Israel
2 h-index
4 publications
64 citations
1–8 of 71
Venues
- Computer Graphics Forum
6 publications · 406 citations
6
h-index
- ACM Transactions on Graphics
TOG · 3 publications · 121 citations
3
h-index
- International Journal of Geographical Information Systems
2 publications · 142 citations
2
h-index
- ACM SIGGRAPH Computer Graphics
2 publications · 184 citations
2
h-index
- Digital Library (University of West Bohemia)
Repository · 2 publications · 28 citations
2
h-index
1–5