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

Authors

93

  1. SK
    Shankar Krishnan

    Nanyang Technological University, Singapore

    3 publications · 88 citations

    3

    h-index

  2. JK
    John Keyser

    Texas A&M University, United States

    3 publications · 88 citations

    3

    h-index

  3. DM
    Dinesh Manocha

    University of North Carolina at Chapel Hill, United States

    3 publications · 88 citations

    3

    h-index

  4. JC
    Jonathan Corney

    University of Strathclyde, United Kingdom

    2 publications · 77 citations

    2

    h-index

  5. CA
    Cecil Armstrong

    Queen's University Belfast, United Kingdom

    2 publications · 175 citations

    2

    h-index

1–5 of 93

Venues

  1. IEEE Computer Graphics and Applications

    3 publications · 142 citations

    3

    h-index

  2. Computer Aided Geometric Design

    3 publications · 88 citations

    3

    h-index

  3. ACM Transactions on Graphics

    TOG · 1 publications · 42 citations

    2

    h-index

  4. 1

    h-index

  5. Engineering With Computers

    1 publications · 96 citations

    1

    h-index

1–5