Abstract

This paper presents a progressive algorithm by which we can narrow down the searching domain for face identification and reconstruct various 3D objects from a single freehand line sketch drawing in short time. The sketch drawings served as an input for the reconstruction process in this paper are obtained from an inaccurate freehand sketch of a 3D wireframe object, which is the edge–vertex graph without any removal of hidden lines. The algorithm is executed through two stages. First, at the face identification stage, every possible faces are generated from the sketch and they are classified into implausible faces, basis faces and minimal faces by means of the geometrical and topological constraints in order to reduce the searching space. The proposed algorithm searches minimal space of the faces so that the actual faces of the given object could be identified in short time. Second, at the object reconstruction stage, we calculate a 3D structure progressively by optimizing the vertices coordinates of the object in accordance with the sketching order of faces. This progressive method reconstructs the most plausible 3D object in a short time by applying the 3D constraints that are derived from the relationship between an object and its sketch drawing in the optimization process. In addition, this method makes it possible for designers to change their viewpoints while sketching. In this paper, we are describing the progressive reconstruction algorithm, and giving the results of the implementation.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.