3D mesh simplification for effective network transmission

Surface models used in 3D computer graphics are generally constructed with highly complex and large-volumed polygonal patches. These complex models can provide a convincing level of realism, but cause many problems due to the data redundancy. Therefore, a method is needed that can effectively decrease the large dataset with shape preservation of the original model. We present an edge cost function that reflects well the local geometric features of surface and implement a surface simplification algorithm based on iterative edge contraction by merging. The merging-based contraction scheme is more efficient in memory usage and useful in practical applications, requiring real-time data transmission, especially in network environment. The experimental results show that the proposed algorithm results in higher quality approximations of original models with excellent shape preservation than existing approaches.