default search action
Computer-Aided Design, Volume 85
Volume 85, April 2017
- Franck Ledoux, Katherine Lewis:
Editorial. 1 - Jean-François Remacle:
A two-level multithreaded Delaunay kernel. 2-9 - Daming Feng, Christos Tsolakis, Andrey N. Chernikov, Nikos P. Chrisochoides:
Scalable 3D hybrid parallel Delaunay image-to-mesh conversion algorithm for distributed shared memory architectures. 10-19 - Xin Li, Wuyi Yu, Celong Liu:
Geometry-aware partitioning of complex domains for parallel quad meshing. 20-33 - Steven J. Owen, Ryan M. Shih, Corey Ernst:
A template-based approach for parallel hexahedral two-refinement. 34-52 - Adrien Loseille, Frédéric Alauzet, Victorien Menier:
Unique cavity-based operator and hierarchical domain partitioning for fast parallel generation of anisotropic meshes. 53-67 - Navamita Ray, Iulian R. Grindeanu, Xinglin Zhao, Vijay Mahadevan, Xiangmin Jiao:
Array-based, parallel hierarchical mesh refinement algorithms for unstructured meshes. 68-82 - Ahmad A. Rushdi, Scott A. Mitchell, Ahmed H. Mahmoud, Chandrajit Bajaj, Mohamed S. Ebeida:
All-quad meshing without cleanup. 83-98 - Chaman Singh Verma, Krishnan Suresh:
A robust combinatorial approach to reduce singularities in quadrilateral meshes. 99-110 - Franco Dassi, Simona Perotto, Hang Si, Timo Streckenbach:
A priori anisotropic mesh adaptation driven by a higher dimensional embedding. 111-122 - Rui Wang, Chun Shen, Jinming Chen, Haiyan Wu, Shuming Gao:
Sheet operation based block decomposition of solid models for hex meshing. 123-137 - Sâm Landier:
Boolean operations on arbitrary polygonal and polyhedral meshes. 138-153 - Christopher M. Tierney, Liang Sun, Trevor T. Robinson, Cecil G. Armstrong:
Using virtual topology operations to generate analysis topology. 154-167
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.