• Title/Summary/Keyword: mesh skinning

Search Result 6, Processing Time 0.022 seconds

3D Surface Approximation to Serial 2D Cross Sections (단면정보로부터 3차원 근사곡면의 생성)

  • 박형준;김광수
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 1994.10a
    • /
    • pp.719-724
    • /
    • 1994
  • This paper describes a hybrid surface-based method for smooth 3D surface approximation to a sequence of 2D cross sections. The resulting surface is a hybrid G $^{1}$ surface represented by a mesh of triangular and rectangular Bezier patches defined on skinning, branching, or capping regions. Each skinning region is approximated with a closed B_spline surface, which is transformed into a mesh of Bezier patches. Triangular G $^{1}$ surfaces are constructed over brabching and capping regions such that the transitions between each capping regions such that the transitions between each triangular surface and its neighboring skinning surfaces are G $^{1}$ continuous. Since each skinning region is represented by an approximated rectangular C $^{2}$ suface instead of an interpolated trctangular G $^{[-1000]}$ surface, the proposed method can provide more smooth surfaces and realize more efficient data reduction than triangular surfacebased method.

  • PDF

A study on Optimizing Mobile 3D Game Engine using JSR-184

  • Cho, Jong-Keun;Lee, Shin-Jun;Choo, Moon-Won
    • International Journal of Contents
    • /
    • v.3 no.4
    • /
    • pp.8-14
    • /
    • 2007
  • This study focuses on modeling mobile 3D game engine and suggesting modified skinned-mesh schema based on JSR-184 in order to improve the performance in terms of memory consumption and time complexity. Most of the 3D games have used OpenGL-ES low-level APls, which may limit portability and fast developing time. Hence, the 3D mobile game engine providing high-level APls which works on GSM (Global System for Mobile Communication) phones on J2ME, is proposed here in order to optimize the performance for Java environment abiding JSR-184 standard. To prove performance enhancement, skinned-mesh schema on JSR-184 engine is modified and tested. The experimental results are shown.

A Basic Study on the Fairing Method of Ship Hull Surface (선형의 순정 기법에 관한 기초 연구)

  • D.J. Kim;T.K. Yoon
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.31 no.2
    • /
    • pp.15-21
    • /
    • 1994
  • In the previous researches on mesh curve fairing method, a set of discrete data points in a mesh can be selected as variables. End tangent vectors can not be variables. This restriction makes some problems in preparing the end tangent vectors at the bow or stern parts, because their slopes are not infinites or zeros. In this paper end tangent vectors are included as variables and the more smooth results are obtained. Also two methods of constructing ship hull surface from mesh curves are examined. It is shown that the skinning method is better than non-uniform B-spline fitting method in representing the area near boundary. The generation of a ship surface is given as an example.

  • PDF

Motion Simplification of Virtual Character (가상 캐릭터의 동작 단순화 기법)

  • Ahn, Jung-Hyun;Oh, Seung-Woo;Wohn, Kwang-Yun
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.33 no.10
    • /
    • pp.759-767
    • /
    • 2006
  • The level-of-detail (LoD), which is a method of reducing polygons on mesh, is one of the most fundamental techniques in real-time rendering. In this paper, we propose a novel level-of-detail technique applied to the virtual character's motion (Motion LoD). The movement of a virtual character can be defined as the transformation of each joint and it's relation to the mesh. The basic idea of the proposed 'Motion LoD' method is to reduce number of joints in an articulated figure and minimize the error between original and simplified motion. For the motion optimization, we propose an error estimation method and a linear system reconstructed from this error estimation for a fast optimization. The proposed motion simplification method is effectively useful for motion editing and real-time crowd animation.

Composite $G^{1}$ surface construction from 2D cross-sections (2차원 단면 데이터로부터 복합 $G^{1}$ 자유곡면 생성)

  • Park, Hyung-Jun;Na, Sang-Wook;Bae, Chae-Yeol
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2004.05a
    • /
    • pp.44-47
    • /
    • 2004
  • This paper proposes an approach for composite surface reconstruction from 2D serial cross-sections, where the number of contours varies from section to section. In a triangular surface-based approach taken in most reconstruction methods, a triangular $G^{1}$ surface is constructed by stitching triangular patches over a triangular net generated from the compiled contours. In the proposed approach, the resulting surface is a composite $G^{1}$ surface consisting of three kinds of surfaces: skinned, surface is first represented by a B-spline surface approximating the serial contours of the skinned region and then serial contours of the skinned region and then transformed into a mesh of rectangular Bezier patches. On branched and capped regions, triangular $G^{1}$ surfaces are constructed so that the connections between the triangular surfaces and their neighboring surfaces are $G^{1}$ continuous. Since each skinned region is represented by an approximated rectangular $G^{2}$ surface instead of an interpolated triangular $G^{1}$ surface, the proposed approach can provide more visually pleasing surfaces and realize more efficient data reduction than the triangular surface-based approach. Some experimental results demonstrate its usefulness and quality.

  • PDF

An Accelerated IK Solver for Deformation of 3D Models with Triangular Meshes (삼각형 메쉬로 이루어진 3D 모델의 변형을 위한 IK 계산 가속화)

  • Park, Hyunah;Kang, Daeun;Kwon, Taesoo
    • Journal of the Korea Computer Graphics Society
    • /
    • v.27 no.5
    • /
    • pp.1-11
    • /
    • 2021
  • The purpose of our research is to efficiently deform a 3D models which is composed of a triangular mesh and a skeleton. We designed a novel inverse kinematics (IK) solver that calculates the updated positions of mesh vertices with fewer computing operations. Through our user interface, one or more markers are selected on the surface of the model and their target positions are set, then the system updates the positions of surface vertices to construct a deformed model. The IK solving process for updating vertex positions includes many computations for obtaining transformations of the markers, their affecting joints, and their parent joints. Many of these computations are often redundant. We precompute those redundant terms in advance so that the 3-nested loop computation structure was improved to a 2-nested loop structure, and thus the computation time for a deformation is greatly reduced. This novel IK solver can be adopted for efficient performance in various research fields, such as handling 3D models implemented by LBS method, or object tracking without any markers.