We develop a distributed algorithm to compute feature-aligned poly-square maps for large-scale 2D geometric regions and use it to construct low-distortion semi-structured quad meshes. Our proposed algorithm has two main compo- nents. The first is a feature-aware graph partitioning that considers workload balancing, minimal communication, geometric regularity, and feature-preserving. The second is a feature-preserved poly-square parameterization. We demonstrate that our algorithm is effective on meshing huge complex coastal/terrain data and can consequently benefit scientific simulations that run on such meshes using high-performance computer clusters
We present an effective optimization framework to compute polycube mapping. Composed of a set of sma...
Abstract—Creating high-quality quad meshes from triangulated surfaces is a highly non trivial task t...
We describe a new mesh clustering method that creates rectangular patches whose texels align across ...
We develop a distributed poly-square mapping algorithm for large-scale 2D geometric regions, which i...
We develop a partitioning algorithm to decompose complex 2D data into small simple subregions for ef...
AbstractWe develop a partitioning algorithm to decompose complex 2D data into small simple subregion...
We develop a partitioning algorithm to decompose complex 2D data into small and simple subregions su...
Creating high-quality quad meshes from triangulated surfaces is a highly nontrivial task that necess...
Geometric modeling is a fundamental and critical problem for many computer graphic and computer visi...
We introduce an approach for efficient distribution and adaptive rendering of 3D mesh models support...
We introduce a practical pipeline to create UV T-layouts for real-world quad dominant semi-regular m...
Polycube mapping can provide regular and global parametric representations for general solid models....
In this paper, we present an approach for managing very large three-dimensional polygonal models in ...
A parallel distributed approach to refine a mesh while preserving the curvature of a target geometry...
Displaying polygonal vector data is essential in various application scenarios such as geometry visu...
We present an effective optimization framework to compute polycube mapping. Composed of a set of sma...
Abstract—Creating high-quality quad meshes from triangulated surfaces is a highly non trivial task t...
We describe a new mesh clustering method that creates rectangular patches whose texels align across ...
We develop a distributed poly-square mapping algorithm for large-scale 2D geometric regions, which i...
We develop a partitioning algorithm to decompose complex 2D data into small simple subregions for ef...
AbstractWe develop a partitioning algorithm to decompose complex 2D data into small simple subregion...
We develop a partitioning algorithm to decompose complex 2D data into small and simple subregions su...
Creating high-quality quad meshes from triangulated surfaces is a highly nontrivial task that necess...
Geometric modeling is a fundamental and critical problem for many computer graphic and computer visi...
We introduce an approach for efficient distribution and adaptive rendering of 3D mesh models support...
We introduce a practical pipeline to create UV T-layouts for real-world quad dominant semi-regular m...
Polycube mapping can provide regular and global parametric representations for general solid models....
In this paper, we present an approach for managing very large three-dimensional polygonal models in ...
A parallel distributed approach to refine a mesh while preserving the curvature of a target geometry...
Displaying polygonal vector data is essential in various application scenarios such as geometry visu...
We present an effective optimization framework to compute polycube mapping. Composed of a set of sma...
Abstract—Creating high-quality quad meshes from triangulated surfaces is a highly non trivial task t...
We describe a new mesh clustering method that creates rectangular patches whose texels align across ...