Filters








411 Hits in 7.4 sec

Hexahedral mesh generation via constrained quadrilateralization

Feifei Shang, Yangke Gan, Yufei Guo, Marco Livesu
2017 PLoS ONE  
The "divide-and-conquer" strategy used in this method is suitable for parallelization.  ...  The testing results show that the quality of the meshes generated by this method is similar to those produced by current state-of-the-art mesh generation methods.  ...  The qualities of our meshes are improved by Mesquite. The mesh files of SRF are downloaded from [38] . According to [38] , the qualities of all hex meshes have been improved by Mesquite.  ... 
doi:10.1371/journal.pone.0177603 pmid:28542355 pmcid:PMC5436764 fatcat:s2ytqh2hffdepj66wxpayve3ti

Shape-Up: Shaping Discrete Geometry with Projections

Sofien Bouaziz, Mario Deuss, Yuliy Schwartzburg, Thibaut Weise, Mark Pauly
2012 Computer graphics forum (Print)  
We show examples for computing planar and circular meshes, shape space exploration, mesh quality improvement, shape-preserving deformation, and conformal parametrization.  ...  École Polytechnique Fédérale de Lausanne, Switzerland point cloud quadrilateral mesh tetrahedral mesh polygon mesh conformal deformation isometric deformation square elements sphere constraint Figure 1  ...  for proof-reading the paper and giving valuable comments, and Pierre Alliez, David Bommes, Daniel Piker, and AIM@SHAPE for providing 3D models.  ... 
doi:10.1111/j.1467-8659.2012.03171.x fatcat:t7gqqk75cnbvnbfufnbkxszx5q

Poly-Spline Finite-Element Method

Teseo Schneider, Jérémie Dumas, Xifeng Gao, Mario Botsch, Daniele Panozzo, Denis Zorin
2019 ACM Transactions on Graphics  
We introduce an integrated meshing and finite element method pipeline enabling black-box solution of partial differential equations in the volume enclosed by a boundary representation.  ...  We demonstrate that our approach converges cubically under refinement, while requiring around 50% of the degrees of freedom than a similarly dense hexahedral mesh composed of triquadratic hexahedra.  ...  The support of each basis function is a union of a set of the images under д of cells in M. Fig. 4 . 4 Spline local grid (shown in dark), for an internal and boundary quadrilateral.  ... 
doi:10.1145/3313797 fatcat:aelhxq5idndjrjwbqdrgylsvke

Interior boundary-aligned unstructured grid generation and cell-centered versus vertex-centered CVD-MPFA performance

Shahid Manzoor, Michael G. Edwards, Ali H. Dogru, Tareq M. Al-Shaalan
2017 Computational Geosciences  
An unstructured grid generation procedure is proposed that automates control-volume and/or control point boundary alignment and yields a PEBI-mesh both with respect to primal and dual (essentially PEBI  ...  Grid generation for reservoir simulation must honor classical key constraints and be boundary aligned such that control-volume boundaries are aligned with geological features such as layers, shale barriers  ...  Acknowledgements We gratefully acknowledge Saudi Aramco for supporting this work.  ... 
doi:10.1007/s10596-017-9686-4 fatcat:gw4ojhvqgfcphaih7caqhd3fsy

Topology-Consistent Design for 3D Freeform Meshes with Harmonic Interpolation [chapter]

Bin Sheng, Enhua Wu
2007 Lecture Notes in Computer Science  
In this paper, we present an interactive modeling system for generating freeform surfaces using a 2D user interface.  ...  Finally, the shape of the triangule surface mesh that follows the 3D boundary curves is computed by using harmonic interpolation.  ...  Fig. 3 . 3 An illustration of the BFT data structure for a tetrahedron Definition 1 . 1 Let ρ(G) be an embedding of a graph G = (V, E) with face set F .  ... 
doi:10.1007/978-3-540-74873-1_16 fatcat:xo5bwhpm3ngg5gtmbuuuy3uj34

Quad-Mesh Generation and Processing: A Survey

David Bommes, Bruno Lévy, Nico Pietroni, Enrico Puppo, Claudio Silva, Marco Tarini, Denis Zorin
2013 Computer graphics forum (Print)  
In this survey we discuss the advantages and problems of techniques operating on quadrilateral meshes, including surface analysis and mesh quality, simplification, adaptive refinement, alignment with features  ...  At the same time, quadrilateral meshes, especially semi-regular ones, have advantages for many applications, and significant progress was made in quadrilateral mesh generation and processing during the  ...  Acknowledgments Silva has been supported by grants from the National Science Foundation, the Department of Energy, and Exxon-Mobil.  ... 
doi:10.1111/cgf.12014 fatcat:324kimsmqvgm3ea7obxr7cq5ue

A divide-and-conquer approach for automatic polycube map construction

Ying He, Hongyu Wang, Chi-Wing Fu, Hong Qin
2009 Computers & graphics  
quadrilateral mesh generation.  ...  This paper aims to develop an effective method to construct polycube maps for surfaces with complicated topology and geometry.  ...  Acknowledgments Models are courtesy of Aim@shape, Cyberware, and Stanford University.  ... 
doi:10.1016/j.cag.2009.03.024 fatcat:5r7nnnqanbbslepjhx2pzmgw4a

Spherical parametrization and remeshing

Emil Praun, Hugues Hoppe
2003 ACM Transactions on Graphics  
The a priori construction of the chart boundaries or cut paths is heuristic, and constrains the quality of the attainable parametrization.  ...  Both geometry and other signals are stored as 2D grids, with grid samples in implicit correspondence, obviating the need to store a parametrization.  ...  Acknowledgments We thank the Digital Michelangelo Project at Stanford University for the David surface model.  ... 
doi:10.1145/882262.882274 fatcat:3mwqccnqyjdavntyikkx7xcxdy

Spherical parametrization and remeshing

Emil Praun, Hugues Hoppe
2003 ACM SIGGRAPH 2003 Papers on - SIGGRAPH '03  
The a priori construction of the chart boundaries or cut paths is heuristic, and constrains the quality of the attainable parametrization.  ...  Both geometry and other signals are stored as 2D grids, with grid samples in implicit correspondence, obviating the need to store a parametrization.  ...  Acknowledgments We thank the Digital Michelangelo Project at Stanford University for the David surface model.  ... 
doi:10.1145/1201775.882274 fatcat:cfkssjuqzre4rjrqnrru2fiany

A freeform shape optimization of complex structures represented by arbitrary polygonal or polyhedral meshes

Jie Shen, David Yoon
2004 International Journal for Numerical Methods in Engineering  
In this paper we propose a new scheme for freeform shape optimization on arbitrary polygonal or polyhedral meshes.  ...  polygonal meshes, which supports multi-resolution shape optimization and does not require CAD information; (3) freeform shape optimization of arbitrary polygonal or polyhedral meshes.  ...  Thanks also go to anonymous reviewers who provided many valuable comments for improving the quality of this paper.  ... 
doi:10.1002/nme.1050 fatcat:caqkkv6ps5exlf5qhdm2hpnyy4

Recent Advances in Remeshing of Surfaces [chapter]

Pierre Alliez, Giuliana Ucelli, Craig Gotsman, Marco Attene
2008 Mathematics and Visualization  
We also list some open questions and directions for future research.  ...  We classify the techniques into five categories based on their end goal: structured, compatible, high quality, feature and error-driven remeshing.  ...  Fig. 9 . 9 Joint spherical parameterization: First, an initial sphere embedding is computed for each mesh.  ... 
doi:10.1007/978-3-540-33265-7_2 fatcat:n7yaueoafrhm7hhcvkwcihsf54

Time Critical Isosurface Refinement and Smoothing

C. L. Bajaj, V. Pascucci
2000 2000 IEEE Symposium on Volume Visualization (VV 2000)  
In this paper we introduce a technique for on-line construction and smoothing of progressive isosurfaces (see Figure 1 ).  ...  Drawbacks of this class of approaches include: (i) the inability to maintain interactivity when the displayed surface changes frequently, (ii) inability to control the global geometry of the embedding  ...  The 2D mesh partitions the region of space of interest in triangles. Each vertex is associated with an input function value.  ... 
doi:10.1109/vv.2000.10013 fatcat:sqs4t55ksnekbk4pbyhrel7mey

A Geometry-aware Data Partitioning Algorithm for Parallel Quad Mesh Generation on Large-scale 2D Regions

Wuyi Yu, Xin Li
2015 Procedia Engineering  
With this decomposition, subregions are distributed to multiple processors for parallel quadrilateral mesh generation.  ...  We develop a partitioning algorithm to decompose complex 2D data into small simple subregions for effective parallel quad meshing.  ...  Fig. 2 : 2 An example graph for connectivity constraint. Fig. 3 : 10 Fig. 4 : 3104 Partitioning a 2D "Key" Region for Parallel Quad Mesh Generation.  ... 
doi:10.1016/j.proeng.2015.10.121 fatcat:k4f47lns4nhzpog4gb3tfwm24i

Time critical isosurface refinement and smoothing

V. Pascucci, C. L. Bajaj
2000 Proceedings of the 2000 IEEE symposium on Volume visualization - VVS '00  
In this paper we introduce a technique for on-line construction and smoothing of progressive isosurfaces (see Figure 1 ).  ...  Drawbacks of this class of approaches include: (i) the inability to maintain interactivity when the displayed surface changes frequently, (ii) inability to control the global geometry of the embedding  ...  The 2D mesh partitions the region of space of interest in triangles. Each vertex is associated with an input function value.  ... 
doi:10.1145/353888.353894 dblp:conf/vvs/PascucciB00 fatcat:amm2z27lfzelvoi2jr7j5vcgwe

Stabilized MorteX method for mesh tying along embedded interfaces [article]

Basava Raju Akula and Julien Vignollet and Vladislav A. Yastrebov
2019 arXiv   pre-print
The optimal mesh convergence and removal of spurious oscillations is also demonstrated on the Eshelby inclusion problem for high contrasts of inclusion/matrix materials.  ...  The method is tested on two patch tests (compression and bending) for different interpolations and element types as well as for different material and mesh contrasts.  ...  We are also grateful to Nikolay Osipov and Stéphane Quilici from the Z-set team for their help with the implementation of the method.  ... 
arXiv:1902.04003v1 fatcat:krwctjfmmngxnkp7uvuvud5p6u
« Previous Showing results 1 — 15 out of 411 results