Back to Search
Start Over
Converting Hybrid Wire-frames to B-rep Models
- Source :
- SPM '07: Proceedings of the 2007 ACM symposium on Solid and physical modeling, ACM, SPM '07: Proceedings of the 2007 ACM symposium on Solid and physical modeling, ACM, Jun 2007, Beijing, China. pp.283-289, ⟨10.1145/1236246.1236286⟩, ACM Symposium on Solid and Physical Modeling (SPM2007), ACM Symposium on Solid and Physical Modeling (SPM2007), Jun 2007, Beijing, China, Symposium on Solid and Physical Modeling
- Publication Year :
- 2007
- Publisher :
- HAL CCSD, 2007.
-
Abstract
- International audience; Solid reconstruction from engineering drawings is one of the efficient technologies to product solid models. The B-rep oriented approach provides a practical way for reconstructing a wide range of objects. However, its major limitation is the computational complexity involved in the search for all valid faces from the intermediate wire-frame, especially for objects with complicated face topologies. In previous work, we presented a hint-based algorithm to recognize quadric surfaces from orthographic views and generate a hybrid wire-frame as the intermediate model of our B-rep oriented method. As a key stage in the process of solid reconstructing, we propose an algorithm to convert the hybrid wire-frame to the final B-rep model by extracting all the rest faces of planes based on graph theory. The entities lying on the same planar surface are first collected in a plane graph. After all the cycles are traced in a simplified edge-adjacency matrix of the graph, the face loops of the plane are formed by testing loop containment and assigning loop directions. Finally, the B-rep model is constructed by sewing all the plane faces based on the M¨obius rule. The method can efficiently construct 2- manifold objects with a variety of face topologies, which is illustrated by results of implementation
- Subjects :
- 0209 industrial biotechnology
Loop (graph theory)
Computer science
ACM: J.: Computer Applications/J.6: COMPUTER-AIDED ENGINEERING
graph theory
[INFO.INFO-GR] Computer Science [cs]/Graphics [cs.GR]
ComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION
02 engineering and technology
Möbius rule
model conversion
ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.0: Graph algorithms
symbols.namesake
020901 industrial engineering & automation
ACM: I.: Computing Methodologies/I.3: COMPUTER GRAPHICS/I.3.5: Computational Geometry and Object Modeling/I.3.5.0: Boundary representations
String graph
0202 electrical engineering, electronic engineering, information engineering
Adjacency matrix
ComputingMethodologies_COMPUTERGRAPHICS
business.industry
020207 software engineering
Graph theory
Directed graph
[INFO.INFO-IA]Computer Science [cs]/Computer Aided Engineering
[INFO.INFO-GR]Computer Science [cs]/Graphics [cs.GR]
solid reconstruction
Planar graph
2-manifold
symbols
Graph (abstract data type)
Artificial intelligence
Null graph
business
Algorithm
MathematicsofComputing_DISCRETEMATHEMATICS
Subjects
Details
- Language :
- English
- Database :
- OpenAIRE
- Journal :
- SPM '07: Proceedings of the 2007 ACM symposium on Solid and physical modeling, ACM, SPM '07: Proceedings of the 2007 ACM symposium on Solid and physical modeling, ACM, Jun 2007, Beijing, China. pp.283-289, ⟨10.1145/1236246.1236286⟩, ACM Symposium on Solid and Physical Modeling (SPM2007), ACM Symposium on Solid and Physical Modeling (SPM2007), Jun 2007, Beijing, China, Symposium on Solid and Physical Modeling
- Accession number :
- edsair.doi.dedup.....9c3f0e941f63dca517891cefeaf71935
- Full Text :
- https://doi.org/10.1145/1236246.1236286⟩