B-rep Data Structures
B-Rep Data Structures is a formal computational representation scheme that encodes the topological and geometric elements of a three-dimensional solid by explicitly defining its boundaries, such as vertices, edges, faces, and their incidence relations, to enable precise and unambiguous modeling in solid geometry.
32
Publications
1.1K
Citations
93
Authors
35
Institutions
Publications per year
2017–2026
5
Parents
32
Automatic small blend recognition from B-rep models for analysis
Jiping Li, Gang Tong, Dianbo Shi et al. · Engineering With Computers · 2009 · 96 citations
1–5 of 32
93
3
h-index
3
h-index
University of North Carolina at Chapel Hill, United States
3 publications · 88 citations
3
h-index
2
h-index
2
h-index
1–5 of 93
35
University of North Carolina at Chapel Hill
Chapel Hill, United States
3 h-index
7 publications
206 citations
Purdue University West Lafayette
West Lafayette, United States
3 h-index
10 publications
511 citations
AT&T (United States)
Bedminster, United States
2 h-index
2 publications
58 citations

Zhejiang University
Hangzhou, China
2 h-index
8 publications
157 citations
Simon Fraser University
Burnaby, Canada
2 h-index
3 publications
126 citations
Queen's University Belfast
Belfast, United Kingdom
2 h-index
5 publications
408 citations

Dalian Polytechnic University
Dalian, China
1 h-index
4 publications
384 citations
National Institute of Standards and Technology
Gaithersburg, United States
1 h-index
1 publications
18 citations
1–8 of 35
3 publications · 142 citations
3
h-index
3 publications · 88 citations
3
h-index
TOG · 1 publications · 42 citations
2
h-index
1 publications · 15 citations
1
h-index
1 publications · 96 citations
1
h-index
1–5