Abstract
Problem statement: Displaced subdivision representation possesses a number of attractive features for efficient and convenient processing tasks like editing, geometry compression, animation, scalability and adaptive rendering of polygonal models. In this representation, a detailed surface model was built as a scalar-valued displacement map over a smooth domain surface. The construction of the smooth domain surface from a polygonal model was a challenging task in the conversion process. Approach: For building the smooth domain surface, we proposed an efficient algorithm that was based on √3-subdivision scheme, memory efficient simplification and a linear time optimization technique. Results: At some fixed level of detail, the vertex and triangle complexity of the displaced surface generated by the proposed algorithm was far less and so it resulted in better compression ratios and transmission speed. Conclusion: The proposed algorithm created surfaces of better quality, computationally more efficient and occupied less memory as compared to the original algorithm by Lee.
Highlights
Recent advances in scanning technologies, CAD/CAD systems and computer vision techniques have made it possible to acquire 3D information that is widely represented in the form of polygonal surfaces, which are, now-a-days, widespread in various application areas of Computer Graphics (CG)
A polygonal surface can be represented as a displaced subdivision surface, which consists of a control mesh and a set of scalar offsets that define the polygonal surface as a scalar displacement map over the smooth domain surface generated from the control mesh by subdivision
To force the subdivision surface to pass through these vertices, there is a need to readjust the positions of these vertices; this objective is accomplished by exploiting a kind of optimization technique; in the sequel we present the detail of this technique
Summary
Recent advances in scanning technologies, CAD/CAD systems and computer vision techniques have made it possible to acquire 3D (three dimensional) information that is widely represented in the form of polygonal surfaces, which are, now-a-days, widespread in various application areas of Computer Graphics (CG). Hussain et al.[10] proposed a conversion method for transforming polygonal mesh representation into displaced subdivision surface; this method differs from the technique proposed by Lee et al.[13] in the construction of smooth domain surface It exploits a simple and efficient heuristic based simplification method and linear time optimization approach to push the vertices of the raw control mesh. Employing the method of Lagrange multipliers, this problem is equivalent to the solution of the following system of linear equations: Polygonal surface as a displacement map: Optimized control mesh Mo is subdivided up to level k using refinement operators of √3-subdivision. To compute the intersections efficiently, we make use of OBB tree data structure[6]
Sign-in/Register to view highlights & summary 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 callDisclaimer: 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.
