Results 31 to 40 of about 89,668 (297)

An Animated Visualization Method for Large-Scale Unstructured Unsteady Flow

Applied Sciences, 2023
Animation visualization is one of the primary methods for analyzing unsteady flow fields. In this paper, we addressed the issue of data visualization for large-scale unsteady flow fields using animation.
Xiaokun Tian, Chao Yang, Yadong Wu, Zhouqiao He, Yan Hu   +4 more
doaj   +1 more source

Entropy-based Mesh Simplification [PDF]

Computer-Aided Design and Applications, 2010
AbstractComplex mesh models usually affect the performance of algorithms for CAD applications. Therefore, it is often desirable to use simplified models and at the same time preserves the general features of the shape. In this paper, we present an entropy based surface mesh simplification algorithm which can rapidly and efficiently produce high quality
Lian Ping Xing, Kin Chuen Hui
openaire   +1 more source

Animated mesh simplification based on motion features in visual sensor networks

International Journal of Distributed Sensor Networks, 2019
The three-dimensional animated model is widely used in scientific visualization, entertainment, and virtual applications, especially in visual sensor networks. The main purpose of simplification is to capture the shape sequence of an object with very few
Hongjie Yang, Fan Zhou, Ge Lin, Mouguang Lin, Shujin Lin   +4 more
doaj   +1 more source

Surface Saliency Detection Based on Curvature Co-Occurrence Histograms

IEEE Access, 2018
This paper presents a 3-D surface saliency feature detection method, which can measure the importance geometry region of the point clouds. Different from existing approaches that are based on 3-D filter banks, the new method first constructs the ...
Ning Wei, Kaiyuan Gao, Rongrong Ji, Peng Chen   +3 more
doaj   +1 more source

Subdivision surface fitting to a dense mesh using ridges and umbilics [PDF]

, 2014
Fitting a sparse surface to approximate vast dense data is of interest for many applications: reverse engineering, recognition and compression, etc. The present work provides an approach to fit a Loop subdivision surface to a dense triangular mesh of ...
Jiang, Yong, Keates, Simeon, Kosinka, Jiri, Ma, Xinhui   +3 more
core   +7 more sources

Mesh Simplification for Unfolding^*

Computer Graphics Forum
AbstractWe present a computational approach for unfolding 3D shapes isometrically into the plane as a single patch without overlapping triangles. This is a hard, sometimes impossible, problem, which existing methods are forced to soften by allowing for map distortions or multiple patches.
M. Bhargava, C. Schreck, M. Freire, P. A. Hugron, S. Lefebvre, S. Sellán, B. Bickel   +6 more
openaire   +4 more sources

Simplification of locally refined gradient meshes

Graphical Models
Gradient meshes are powerful vector graphic primitives known for producing smooth and detailed color transitions. However, their fixed rectangular topology complicates editing, as adding detail in one region introduces control points across the entire ...
E. Kato, T. Ophelders, A. Telea, J. Kosinka   +3 more
doaj   +1 more source

An Efficient Visualization Method for Polygonal Data with Dynamic Simplification

ISPRS International Journal of Geo-Information, 2018
Polygonal data often require rendering with symbolization and simplification in geovisualization. A common issue in existing methods is that simplification, symbolization and rendering are addressed separately, causing computational and data redundancies
Mingguang Wu, Taisheng Chen, Kun Zhang, Zhimin Jing, Yangli Han, Menglin Chen, Hong Wang, Guonian Lv   +7 more
doaj   +1 more source

INDOOR SPATIAL DATA CONSTRUCTION FROM TRIANGLE MESH [PDF]

The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2018
The 3D triangle mesh is widely used to represent indoor space. One of widely used methods of generating 3D triangle mesh data of indoor space is the construction from the point cloud collected using LIDAR.
D. Kim, A. Bolat, K.-J. Li
doaj   +1 more source

HP-multigrid as smoother algorithm for higher order discontinuous Galerkin discretizations of advection dominated flows. Part II. Optimization of the Runge-Kutta smoother [PDF]

, 2011
Using a detailed multilevel analysis of the complete hp-Multigrid as Smoother algorithm accurate predictions are obtained of the spectral radius and operator norms of the multigrid error transformation operator.
Rhebergen, S., Vegt, J.J.W. van der
core   +4 more sources