Boolean operations of 2-manifolds through vertex neighborhood classification
ACM Transactions on Graphics (TOG)
Geometric approaches to nonplanar quadric surface intersection curves
ACM Transactions on Graphics (TOG)
Boundary evaluation of non-convex primitives to produce parametric trimmed surfaces
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Introduction to Solid Modeling
Introduction to Solid Modeling
Geometric and solid modeling: an introduction
Geometric and solid modeling: an introduction
Representations for Rigid Solids: Theory, Methods, and Systems
ACM Computing Surveys (CSUR)
Solid Modeling with Designbase: Theory and Implementation
Solid Modeling with Designbase: Theory and Implementation
Robust Set Operations on Polyhedral Solids
IEEE Computer Graphics and Applications
An Editable Nonmanifold Boundary Representation
IEEE Computer Graphics and Applications
Using Tangent Balls to Find Plane Sections of Natural Quadrics
IEEE Computer Graphics and Applications
Face-based data structure and its application to robust geometric modeling
SMA '95 Proceedings of the third ACM symposium on Solid modeling and applications
Class relationships and user extensibility in solid geometric modeling
COOTS'96 Proceedings of the 2nd conference on USENIX Conference on Object-Oriented Technologies (COOTS) - Volume 2
A comprehensive process of reverse engineering from 3D meshes to CAD models
Computer-Aided Design
| Hi-index | 0.00 |
An incremental boundary-evaluation algorithm that exploits adjacency information in B-reps to minimize the number of explicit edge classifications required is presented. Evaluations of the implemented algorithm show that it performs reliably and well, although global optimization schemes could increase performance significantly. The steps of the algorithm, which include self-edge partitioning, cross-edge self-edge (CESE) classification, inference of self-edge classifications, and checking for split and merged shells, are discussed.