1. Converting Hybrid Wire-frames to B-rep Models
- Author
-
Jie-Hui Gong, Jiaguang Sun, Hui Zhang, Yi-Wen Zhang, School of Software (THSS), Tsinghua University [Beijing] (THU), Computer Aided Design (CAD ), Laboratoire Franco-Chinois d'Informatique, d'Automatique et de Mathématiques Appliquées (LIAMA), Centre de Coopération Internationale en Recherche Agronomique pour le Développement (Cirad)-Institut National de la Recherche Agronomique (INRA)-Chinese Academy of Sciences [Changchun Branch] (CAS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institute of Automation - Chinese Academy of Sciences-Centre National de la Recherche Scientifique (CNRS)-Centre de Coopération Internationale en Recherche Agronomique pour le Développement (Cirad)-Institut National de la Recherche Agronomique (INRA)-Chinese Academy of Sciences [Changchun Branch] (CAS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institute of Automation - Chinese Academy of Sciences-Centre National de la Recherche Scientifique (CNRS)-Inria Paris-Rocquencourt, Institut National de Recherche en Informatique et en Automatique (Inria), Purdue Research and Education Center for Information Systems in Engineering (PRECISE), Purdue University [West Lafayette], cgcad, Thss, Tsinghua University [Beijing], and Tsinghua, Thss
- 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 - 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
- Published
- 2007
- Full Text
- View/download PDF