This paper proposes a new method for the compression of vector data map. Three key steps are encompassed in the proposed method, namely, the simplification of vector data map via the elimination of vertices, the compr...This paper proposes a new method for the compression of vector data map. Three key steps are encompassed in the proposed method, namely, the simplification of vector data map via the elimination of vertices, the compression of re- moved vertices based on a clustering model, and the decoding of the compressed vector data map. The proposed compres- sion method was implemented and applied to compress vector data map to investigate its performance in terms of the com- pression ratio and distortions of geometric shapes. The results show that the proposed method provides a feasible and effi- cient solution for the compression of vector data map and is able to achieve a promising ratio of compression and maintain the main shape characteristics of the spatial objects within the compressed vector data map.展开更多
This paper presents a gas-kinetic theory based multidimensional high-order method for the compressible Naiver–Stokes solutions. In our previous study, a spatially and temporally dependent third-order flux scheme with...This paper presents a gas-kinetic theory based multidimensional high-order method for the compressible Naiver–Stokes solutions. In our previous study, a spatially and temporally dependent third-order flux scheme with the use of a third-order gas distribution function is employed.However, the third-order flux scheme is quite complicated and less robust than the second-order scheme. In order to reduce its complexity and improve its robustness, the secondorder flux scheme is adopted instead in this paper, while the temporal order of method is maintained by using a two stage temporal discretization. In addition, its CPU cost is relatively lower than the previous scheme. Several test cases in two and three dimensions, containing high Mach number compressible flows and low speed high Reynolds number laminar flows, are presented to demonstrate the method capacity.展开更多
基金Supported by the National 863 Program of China （No. 2007AAI2Z241）, the Program for New Century Excellent Talents in University （No. NCET-07-0643）, the National Natural Science Foundation of China （No. 40571134, No. 40871185）, the National 973 Program of China （No. 108085）.
文摘This paper proposes a new method for the compression of vector data map. Three key steps are encompassed in the proposed method, namely, the simplification of vector data map via the elimination of vertices, the compression of re- moved vertices based on a clustering model, and the decoding of the compressed vector data map. The proposed compres- sion method was implemented and applied to compress vector data map to investigate its performance in terms of the com- pression ratio and distortions of geometric shapes. The results show that the proposed method provides a feasible and effi- cient solution for the compression of vector data map and is able to achieve a promising ratio of compression and maintain the main shape characteristics of the spatial objects within the compressed vector data map.
文摘This paper presents a gas-kinetic theory based multidimensional high-order method for the compressible Naiver–Stokes solutions. In our previous study, a spatially and temporally dependent third-order flux scheme with the use of a third-order gas distribution function is employed.However, the third-order flux scheme is quite complicated and less robust than the second-order scheme. In order to reduce its complexity and improve its robustness, the secondorder flux scheme is adopted instead in this paper, while the temporal order of method is maintained by using a two stage temporal discretization. In addition, its CPU cost is relatively lower than the previous scheme. Several test cases in two and three dimensions, containing high Mach number compressible flows and low speed high Reynolds number laminar flows, are presented to demonstrate the method capacity.
