کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
440745 691261 2014 13 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Efficient decomposition of line drawings of connected manifolds without face identification
ترجمه فارسی عنوان
تجزیه کارآیی نقاشی های خطی منیفولد های متصل بدون شناسایی چهره
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر گرافیک کامپیوتری و طراحی به کمک کامپیوتر
چکیده انگلیسی


• Decomposes a complex drawing into its constituting simple manifolds.
• Does not require face information to achieve the task.
• Basic two stage strategy: basic decomposition and subsequent repair.
• Reduces the time for subsequent face finding and 3D reconstruction greatly.

This paper presents an algorithm for decomposing complex line drawings which depict connected 3D manifolds into multiple simpler drawings of individual manifolds. The decomposition process has three stages: decomposition at non-manifold vertices, along non-manifold edges and across internal faces. Once non-manifold vertices and/or edges are found, the decomposition can be performed straightforwardly. Thus the major task in this paper is decomposition across internal faces. This has two steps: basic decomposition and repair of incomplete parts. The decomposition process is performed before face identification which is computationally expensive. After decomposition, the time for face finding is much reduced and this, in turn, greatly improves the process for 3D reconstruction, which is the ultimate goal.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computer-Aided Design - Volume 51, June 2014, Pages 18–30
نویسندگان
, ,