Surface Patches from Unorganized Space Curves

Abstract

Figure 1: Our system takes as input a wireframe model produced from a 3D curve sketch, and outputs a set of curved surface patches representing the object. The output objects need not be manifold, or connected. From left to right, phoenix, roadster, spider and boat curve networks created with ILoveSketch on top, and the output sets of surface patches on the bottom. AbstractRecent 3D sketch tools produce networks of three-space curves that suggest the contours of shapes. The shapes may be non-manifold, closed three-dimensional, open two-dimensional, or mixed. We describe a system that automatically generates intuitively appealing piecewise-smooth surfaces from such a curve network, and an intelligent user interface for modifying the automatically chosen surface patches. Both the automatic and the semi-automatic parts of the system use a linear algebra representation of the set of surface patches to track the topology. On complicated inputs from ILoveSketch [BBS08], our system allows the user to build the desired surface with just a few mouse-clicks.

An algorithm for estimating surface normal from its boundary curves

“…Although it has ation, it is limited by the inferior quality of a thus-yielded model because of the Five methods to create a surface approximation for a single, complex patch boundary: (a) the lofting curve networks driven quadrangulation of Bessmeltsev et al [9] (c) linearized Laplacian smoothing of al. [8] (d) minimal ruled surface of Abbasinejad et al [10] (e) our method, which estimates surface normal that 0000 stimating geometric inforthe design intention on the basis of the proposed method algeometric information by establishing an optimization equation reflecting to create surface model in most previous studies are based posed new method that estimating surface structing 3D model from curve network with better solving approaches adopted by existing the proposed curved surface modeling. Section 4 contains an elaborated description of the algorithm used for the determination of geometric features and the modeling process based on these Section 6 contains conclubased interface over a decade ago, it has been the object of inby Igarashi et al [4] converts a 2D silhouette into a 3D surface by adding an inflated to the surface surrounded by the silhouette, thus enabling intuitive modeling from a simple sketch.…”

“…Although it has the advanbecause of the insufficient Five methods to create a surface approximation for a single, complex patch boundary: (a) the lofting curve networks driven quadrangulation of Bessmeltsev et al [9] (c) linearized Laplacian smoothing of al. [8] (d) minimal ruled surface of Abbasinejad et al [10] (e) our method, which estimates surface normal that exploitation of geometric data.…”

“…Schaefer et al [7] doesn't get the consistent results when used in complex curve netwo Bessmeltsev et al [9] takes too much time so it can't show its result in real-time. Abbasinejad et al [8][10] possibly time but have weakness that can't provide sufficient visual feedback. Our study compensates these defect by reflect design intent and constructing surface model based on them.…”

“…Abbasinejad et al [8] defined problems through lineariz In this method, any given circle is rendered in tr houette of each curve patch and generating a model similar to tage of rapid linear algebraic computation, it is limited by the inferior quality of a thus have discontinuity that is unacceptable in surface modeling. With these features, RMF is suitable for estimating geometric info Using this newly defined frame, we determined the normal vector to the curve that matches the design intention on the basis of related studies.…”

“…Abbasinejad et al [8] defined problems through linearization by using a Laplacian method instead of an optimization approach. endered in triangular meshes, followed by model construction by joining meshes on the si houette of each curve patch and generating a model similar to a soap film by using linear interpolation.…”