Journal articles: 'Computer-Aided Design [MESH]'

1

Hamid, Nor Faharina Abdul, Nurul Jannah Zulkefle, Tengku Fazrina Tengku Mohd Ariff, ZuryatiAb Ghani, and Rohana Ahmad. "Computer Aided Design / Computer Aided Manufacturing (CAD / CAM) Post and Core - A Review." Journal of Evolution of Medical and Dental Sciences 10, no. 36 (September 6, 2021): 3143–51. http://dx.doi.org/10.14260/jemds/2021/640.

Full text

Abstract:

BACKGROUND Nowadays, the use of computer aided design / computer aided manufacturing (CAD / CAM) in fabricating indirect restoration such as onlay, crown and bridge has increased tremendously. However, there is lack of clinical information and evidence on current material and fabrication techniques of CAD / CAM post and core. This paper describes the classification of the post and core system and review current perspectives on recent development of CAD / CAM post and core. An electronic search of the literature was performed via PubMed and Scopus database, using the keyword (post and core) and (CAD / CAM) and (CAD / CAM post and core) as MeSH term. Articles eligible for inclusion in the present review were published in English, journal article and dated from January 2000 until November 2020. A total of 31 publications consisting of 18 in-vitro studies, 7 case reports, 4 finite element analysis and 2 clinical techniques were included in this review. Analysis parameters included are options of chairside CAD / CAM materials, CAD / CAM system and milling machine used, advantages and disadvantages and future direction of CAD / CAM post and core. CAD /CAM post and core can be alternative option as compared to the custom-made post and core and prefabricated post and core. KEY WORDS Computer - Aided Design, Computer - Aided Manufacturing, Dental Material, Indirect Restoration, Post and Core

APA, Harvard, Vancouver, ISO, and other styles

2

Truong, Anh H., David W. Zingg, and Robert Haimes. "Surface Mesh Movement Algorithm for Computer-Aided-Design-Based Aerodynamic Shape Optimization." AIAA Journal 54, no. 2 (February 2016): 542–56. http://dx.doi.org/10.2514/1.j054295.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Alaverdyan, Sinok A., Igor N. Kabanov, Vyacheslav V. Komarov, and Valery Petrovich Meschanov. "Development and Computer-Aided Design of Metal Gratings for Microwave Mesh Polarizers." IEEE Transactions on Microwave Theory and Techniques 63, no. 8 (August 2015): 2509–14. http://dx.doi.org/10.1109/tmtt.2015.2446485.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Maggiordomo, Andrea, Henry Moreton, and Marco Tarini. "Micro-Mesh Construction." ACM Transactions on Graphics 42, no. 4 (July 26, 2023): 1–18. http://dx.doi.org/10.1145/3592440.

Full text

Abstract:

Micro-meshes (μ-meshes) are a new structured graphics primitive supporting a large increase in geometric fidelity, without commensurate memory and run-time processing costs, consisting of a base mesh enriched by a displacement map. A new generation of GPUs supports this structure with native hardware μ-mesh ray-tracing, that leverages a self-bounding, compressed displacement mapping scheme to achieve these efficiencies. In this paper, we present anautomatic method to convert an existing multi-million triangle mesh into this compact format, unlocking the advantages of the data representation for a large number of scenarios. We identify the requirements for high-quality μ-meshes, and show how existing re-meshing and displacement-map baking tools are ill-suited for their generation. Our method is based on a simplification scheme tailored to the generation of high-quality base meshes , optimized for tessellation and displacement sampling, in conjunction with algorithms for determining displacement vectors to control the direction and range of displacements. We also explore the optimization of μ-meshes for texture maps and the representation of boundaries. We demonstrate our method with extensive batch processing, converting an existing collection of high-resolution scanned models to the micro-mesh representation, providing an open-source reference implementation, and, as additional material, the data and an inspection tool.

APA, Harvard, Vancouver, ISO, and other styles

5

Sun, Liang, Weigang Yao, Trevor T. Robinson, Cecil G. Armstrong, and Simão P. Marques. "Automated Mesh Deformation for Computer-Aided Design Models That Exhibit Boundary Topology Changes." AIAA Journal 58, no. 9 (September 2020): 4128–41. http://dx.doi.org/10.2514/1.j058760.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Fan, Li Hua, Bo Liu, Bao Ling Xie, and Qi Chen. "Automatic Point Clouds Registration Method Based on Mesh Segmentation." Applied Mechanics and Materials 423-426 (September 2013): 2587–90. http://dx.doi.org/10.4028/www.scientific.net/amm.423-426.2587.

Full text

Abstract:

This paper proposes an automatic point clouds registration method based on High-Speed Mesh Segmentation. The proposed method works fast for doing an initial registration and extracting point clouds region feature. First, the features of the point region are used for matching point cloud regions. Second, matched regions sets are classified for calculating transform matrix of initial registration. Based on the initial registration result the Iterative Closest Point (ICP) algorithm which had been used for accuracy registration to composite point cloud pairs will be applied. The proposed registration approach is able to do automatic registration without any assumptions about their initial positions, and avoid the problems of traditional ICP in bad initial estimate. The proposed method plus with ICP algorithm provides an efficient 3D model for computer-aided engineering and computer-aided design.

APA, Harvard, Vancouver, ISO, and other styles

7

Thilmany, Jean. "Making a Mesh of Things." Mechanical Engineering 125, no. 09 (September 1, 2003): 54–56. http://dx.doi.org/10.1115/1.2003-sep-3.

Full text

Abstract:

Models need to be meshed and made acceptable for analysis before finite element analysis (FEA) can be run. Software providers that make pre-processing applications must keep up with changes in FEA technology to remain competitive. The mesh contains the data on material and structural properties that define how the part will react to certain load conditions. Today's closely integrated computer-aided design (CAD), pre-processing, and FEA applications allow CAD and entry-level FEA technologies to work together within a common user interface and give design engineers a quick, effortless way to see if their designs will meet specifications. Simplifying the FEA programs so a design engineer can use them limits the intricacy of the mesh as well as the depth of analysis. HyperMesh prepares CAD geometries for analysis. The meshed geometries are then exported to Procter & Gamble's customized package analysis system called Virtual Package Simulation. Today, engineers use mesh technologies and attendant FEA programs for an array of analyses. Some are related to manufacturing, but as often as not they've found their way into other industries.

APA, Harvard, Vancouver, ISO, and other styles

8

Ciocca, Leonardo, Giuseppe Lizio, Paolo Baldissara, Alessandro Sambuco, Roberto Scotti, and Giuseppe Corinaldesi. "Prosthetically CAD-CAM–Guided Bone Augmentation of Atrophic Jaws Using Customized Titanium Mesh: Preliminary Results of an Open Prospective Study." Journal of Oral Implantology 44, no. 2 (April 1, 2018): 131–37. http://dx.doi.org/10.1563/aaid-joi-d-17-00125.

Full text

Abstract:

This study evaluated the outcomes of computer-aided design–computer-aided machining (CAD-CAM)–customized titanium mesh used for prosthetically guided bone augmentation related to the occlusion-driven implant position, to the vertical bone volume gain of the mandible and maxilla, and to complications, such as mesh exposure. Nine patients scheduled for bone augmentation of atrophic sites were treated with custom titanium mesh and particulate bone grafts with autologous bone and anorganic bovine bone in a 1:1 ratio prior to implant surgery. The bone volume needed to augment was virtually projected based on implant position, width, and length, and the mesh design was programmed for the necessary retaining screws. After 6 to 8 months, bone augmentations of 1.72 to 4.1 mm (mean: 3.83 mm) for the mandibular arch and 2.14 to 6.88 mm (mean: 3.95 mm) for the maxilla were registered on cone-beam computerized tomography. Mesh premature (within 4 to 6 weeks) exposure was observed in 3 cases and delayed (after 4 to 6 weeks) in 3 other cases. One titanium mesh was removed before the programmed time but in all augmented sites was possible implant insertion. No complication occurred during prosthetic follow-up. Using CAD-CAM technology for prosthetically guided bone augmentation showed important postoperative morbidity of mesh exposure (66%). Because of this high prevalence of mesh exposure and the potential infection that could affect the expected bone augmentation, this study suggests a cautious approach to this procedure when designing the titanium mesh, to avoid flap tension that may cause mucosal rupture.

APA, Harvard, Vancouver, ISO, and other styles

9

Feng, Leman, Yiying Tong, and Mathieu Desbrun. "Q-zip." ACM Transactions on Graphics 40, no. 6 (December 2021): 1–13. http://dx.doi.org/10.1145/3478513.3480523.

Full text

Abstract:

Singularity editing of a quadrangle mesh consists in shifting singularities around for either improving the quality of the mesh elements or canceling extraneous singularities, so as to increase mesh regularity. However, the particular structure of a quad mesh renders the exploration of allowable connectivity changes non-local and hard to automate. In this paper, we introduce a simple, principled, and general quad-mesh editing primitive with which pairs of arbitrarily distant singularities can be efficiently displaced around a mesh through a deterministic and reversible chain of local topological operations with a minimal footprint. Dubbed Q-zip as it acts as a zipper opening up and collapsing down quad strips, our practical mesh operator for singularity editing can be easily implemented via parallel transport of a reference compass between any two irregular vertices. Batches of Q-zips performed in parallel can then be used for efficient singularity editing.

APA, Harvard, Vancouver, ISO, and other styles

10

Lin, Chao-Hung, Tong-Yee Lee, Hung-Kuo Chu, and Chih-Yuan Yao. "Progressive mesh metamorphosis." Computer Animation and Virtual Worlds 16, no. 3-4 (2005): 487–98. http://dx.doi.org/10.1002/cav.85.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Zhao, Feiyu. "A Novel Computational Paradigm for Reconstructing Solid CAD Features from a Segmented Manifold Triangular Mesh." Applied Sciences 14, no. 14 (July 16, 2024): 6183. http://dx.doi.org/10.3390/app14146183.

Full text

Abstract:

We introduce a novel computational paradigm for reconstructing solid computer-aided design (CAD) features from the surface of a segmented manifold triangular mesh. This paradigm addresses the challenge of capturing high-level design semantics for manifold triangular meshes and facilitates parametric and variational design capabilities. We categorize four prevalent features, namely extrusion, rotation, sweep, and loft, as generalized swept bodies driven by cross-sectional sketches and feature paths, providing a unified mathematical representation for various feature types. The numerical optimization-based approach conducts geometric processing on the segmented manifold triangular mesh patch, extracting cross-sectional sketch curves and feature paths from its surface, and then reconstructing appropriate features using the Open CASCADE kernel. We employ the personalized three-dimensional (3D) printed model as a case study. Parametric and variant designs of the 3D-printed models are achieved through feature reconstruction of the manifold triangular mesh obtained via 3D scanning.

APA, Harvard, Vancouver, ISO, and other styles

12

Kang, Yeonghoon, and Sungmin Kim. "Three-dimensional garment pattern design using progressive mesh cutting algorithm." International Journal of Clothing Science and Technology 31, no. 3 (June 3, 2019): 339–49. http://dx.doi.org/10.1108/ijcst-08-2018-0106.

Full text

Abstract:

Purpose The purpose of this paper is to develop the core module of computer-aided three-dimensional garment pattern design system. Design/methodology/approach A progressive mesh cutting algorithm and mesh reshaping algorithm have been developed to cut a single mesh into multiple patches. A flat projection algorithm has been developed to project 3D patches into 2D patterns. Findings The software developed in this study is expected to enable its users to design complex garment patterns without the in-depth knowledge of pattern design process. Research limitations/implications The mesh model used in this study was a fixed model. It will be extended to a deformable garment model that can be resized according to the underlying body model Practical implications The software developed in this study is expected to reduce the time required for time-consuming and trial-and-error-based pattern design process. Social implications Fashion designers will be able to design complex patterns by themselves and the dependence upon expert patterners could be reduced Originality/value The progressive mesh cutting algorithm developed in this study can cut a mesh model using arbitrary lines. The mesh reshaping algorithm can improve the mesh quality of divided patches to increase the numerical stability during subsequent pattern flattening process. The flip removal algorithm can effectively remove the partially flipped mesh elements.

APA, Harvard, Vancouver, ISO, and other styles

13

Gelețu, Gabriela Luminița, Alexandru Burlacu, Alice Murariu, Sorin Andrian, Loredana Golovcencu, Elena-Raluca Baciu, George Maftei, and Neculai Onica. "Customized 3D-Printed Titanium Mesh Developed for an Aesthetic Zone to Regenerate a Complex Bone Defect Resulting after a Deficient Odontectomy: A Case Report." Medicina 58, no. 9 (September 1, 2022): 1192. http://dx.doi.org/10.3390/medicina58091192.

Full text

Abstract:

Background and Objectives: Alveolar ridge augmentation in the complex bone defect is a popular topic in implantology. Guided bone regeneration (GBR) is one of the most commonly applied methods to reconstruct alveolar bone. The application of a membrane is the fundamental principle of GBR. There are many membrane types used in oral surgery, but the advantage of the titanium mesh is the rigidity which provides space maintenance and prevents contour collapse. The smooth surface also reduces bacterial contamination. Using computer-aided design (CAD) and computer-aided manufacturing (CAM) in dentistry allows us to obtain the perfect architecture form of the mesh, which covers and protects the bone reconstruction. Case presentation: We present a surgical case of a 27-year-old female patient with severe aesthetic bone atrophy after a deficient odontectomy. Based on the GBR clinical applications, the technique consists of bone reconstruction and a customized titanium mesh application. Using mesh titanium in this case presentation was a reliable alternative to perform a lateral alveolar bone augmentation and reconstruct ridge deformities before reaching an ideal implant placement. Conclusions: According to our case report, the customized titanium mesh could be a valuable option for guided bone regeneration in aesthetic maxillary defects.

APA, Harvard, Vancouver, ISO, and other styles

14

Hu, Shi-Min, Zheng-Ning Liu, Meng-Hao Guo, Jun-Xiong Cai, Jiahui Huang, Tai-Jiang Mu, and Ralph R. Martin. "Subdivision-based Mesh Convolution Networks." ACM Transactions on Graphics 41, no. 3 (June 30, 2022): 1–16. http://dx.doi.org/10.1145/3506694.

Full text

Abstract:

Convolutionalneural networks (CNNs) have made great breakthroughs in two-dimensional (2D) computer vision. However, their irregular structure makes it hard to harness the potential of CNNs directly on meshes. A subdivision surface provides a hierarchical multi-resolution structure in which each face in a closed 2-manifold triangle mesh is exactly adjacent to three faces. Motivated by these two observations, this article presents SubdivNet , an innovative and versatile CNN framework for three-dimensional (3D) triangle meshes with Loop subdivision sequence connectivity. Making an analogy between mesh faces and pixels in a 2D image allows us to present a mesh convolution operator to aggregate local features from nearby faces. By exploiting face neighborhoods, this convolution can support standard 2D convolutional network concepts, e.g., variable kernel size, stride, and dilation. Based on the multi-resolution hierarchy, we make use of pooling layers that uniformly merge four faces into one and an upsampling method that splits one face into four. Thereby, many popular 2D CNN architectures can be easily adapted to process 3D meshes. Meshes with arbitrary connectivity can be remeshed to have Loop subdivision sequence connectivity via self-parameterization, making SubdivNet a general approach. Extensive evaluation and various applications demonstrate SubdivNet’s effectiveness and efficiency.

APA, Harvard, Vancouver, ISO, and other styles

15

Cherchi, Gianmarco, Fabio Pellacini, Marco Attene, and Marco Livesu. "Interactive and Robust Mesh Booleans." ACM Transactions on Graphics 41, no. 6 (November 30, 2022): 1–14. http://dx.doi.org/10.1145/3550454.3555460.

Full text

Abstract:

Boolean operations are among the most used paradigms to create and edit digital shapes. Despite being conceptually simple, the computation of mesh Booleans is notoriously challenging. Main issues come from numerical approximations that make the detection and processing of intersection points inconsistent and unreliable, exposing implementations based on floating point arithmetic to many kinds of degeneracy and failure. Numerical methods based on rational numbers or exact geometric predicates have the needed robustness guarantees, that are achieved at the cost of increased computation times that, as of today, has always restricted the use of robust mesh Booleans to offline applications. We introduce an algorithm for Boolean operations with robustness guarantees that is capable of operating at interactive frame rates on meshes with up to 200K triangles. We evaluate our tool thoroughly, considering not only interactive applications but also batch processing of large collections of meshes, processing of huge meshes containing millions of elements and variadic Booleans of hundreds of shapes altogether. In all these experiments, we consistently outperform prior robust floating point methods by at least one order of magnitude.

APA, Harvard, Vancouver, ISO, and other styles

16

Worchel, Markus, and Marc Alexa. "Differentiable Rendering of Parametric Geometry." ACM Transactions on Graphics 42, no. 6 (December 5, 2023): 1–18. http://dx.doi.org/10.1145/3618387.

Full text

Abstract:

We propose an efficient method for differentiable rendering of parametric surfaces and curves, which enables their use in inverse graphics problems. Our central observation is that a representative triangle mesh can be extracted from a continuous parametric object in a differentiable and efficient way. We derive differentiable meshing operators for surfaces and curves that provide varying levels of approximation granularity. With triangle mesh approximations, we can readily leverage existing machinery for differentiable mesh rendering to handle parametric geometry. Naively combining differentiable tessellation with inverse graphics settings lacks robustness and is prone to reaching undesirable local minima. To this end, we draw a connection between our setting and the optimization of triangle meshes in inverse graphics and present a set of optimization techniques, including regularizations and coarse-to-fine schemes. We show the viability and efficiency of our method in a set of image-based computer-aided design applications.

APA, Harvard, Vancouver, ISO, and other styles

17

Ubi Stanley E. "Optimization of isolated and combined pad foundation using computer aided application of finite element approach." Global Journal of Engineering and Technology Advances 6, no. 3 (March 30, 2021): 24–41. http://dx.doi.org/10.30574/gjeta.2021.6.3.0030.

Full text

Abstract:

Most Finite Element packages provide means to generate meshes automatically. However, the user is usually confronted with the problem of not knowing whether the mesh generated is appropriate for the problem at hand. Since the accuracy of the Finite Element results is mesh dependent, mesh selection forms a very important step in the analysis of isolated and combined footing pad foundation. SAFE is an ultimate tools use in the design of concrete floors and foundation system, hence provide a suitable means for the user. From framing layout all the way through to detail drawing production, SAFE integrate every aspect of engineering design which are in one process easy and intuitive environment. SAFE provides unmatched benefits to the engineer with its truly unique combination of power, comprehensive capabilities, and ease-of-use. In the context of this research, we have plotted graphs showing the relationship between the nodes and displacement with the stress patterns as generated from the software. It is understood from the graph that multiple elements in the process of meshing will make the footing to be at equilibrium. The research also carry the shape deformed diagram which shows the deformation of the footing due to the impose load (stress) on the footing, it also give the bending moment diagram of the footings. The basic structure and analysis of the single and double pad footing foundations have been designed using Finite Element Analysis (FEA) with the failure planes being considered. The results obtained, it is assumed that FEA is an ideal design method that breaks foundation design into basic elements and nodes that shows the action of the loading on the footings.

APA, Harvard, Vancouver, ISO, and other styles

18

Yu, Chang, Yi Xu, Ye Kuang, Yuanming Hu, and Tiantian Liu. "MeshTaichi." ACM Transactions on Graphics 41, no. 6 (November 30, 2022): 1–17. http://dx.doi.org/10.1145/3550454.3555430.

Full text

Abstract:

Meshes are an indispensable representation in many graphics applications because they provide conformal spatial discretizations. However, mesh-based operations are often slow due to unstructured memory access patterns. We propose MeshTaichi, a novel mesh compiler that provides an intuitive programming model for efficient mesh-based operations. Our programming model hides the complex indexing system from users and allows users to write mesh-based operations using reference-style neighborhood queries. Our compiler achieves its high performance by exploiting data locality. We partition input meshes and prepare the wanted relations by inspecting users' code during compile time. During run time, we further utilize on-chip memory (shared memory on GPU and L1 cache on CPU) to access the wanted attributes of mesh elements efficiently. Our compiler decouples low-level optimization options with computations, so that users can explore different localized data attributes and different memory orderings without changing their computation code. As a result, users can write concise code using our programming model to generate efficient mesh-based computations on both CPU and GPU backends. We test MeshTaichi on a variety of physically-based simulation and geometry processing applications with both triangle and tetrahedron meshes. MeshTaichi achieves a consistent speedup ranging from 1.4× to 6×, compared to state-of-the-art mesh data structures and compilers.

APA, Harvard, Vancouver, ISO, and other styles

19

Zhao, Zheng-Yu, Qing Fang, Wenqing Ouyang, Zheng Zhang, Ligang Liu, and Xiao-Ming Fu. "Developability-driven piecewise approximations for triangular meshes." ACM Transactions on Graphics 41, no. 4 (July 2022): 1–13. http://dx.doi.org/10.1145/3528223.3530117.

Full text

Abstract:

We propose a novel method to compute a piecewise mesh with a few developable patches and a small approximation error for an input triangular mesh. Our key observation is that a deformed mesh after enforcing discrete developability is easily partitioned into nearly developable patches. To obtain the nearly developable mesh, we present a new edge-oriented notion of discrete developability to define a developability-encouraged deformation energy, which is further optimized by the block nonlinear Gauss-Seidel method. The key to successfully applying this optimizer is three types of auxiliary variables. Then, a coarse-to-fine segmentation technique is developed to partition the deformed mesh into a small set of nearly discrete developable patches. Finally, we refine the segmented mesh to reduce the discrete Gaussian curvature while keeping the patches smooth and the approximation error small. In practice, our algorithm achieves a favorable tradeoff between the number of developable patches and the approximation error. We demonstrate the feasibility and practicability of our method over various examples, including seventeen physical manufacturing models with paper.

APA, Harvard, Vancouver, ISO, and other styles

20

Guo, YuFei, YongQing Hai, and JianFei Liu. "Direct modifications of tetrahedral meshes." Engineering Computations 37, no. 9 (May 25, 2020): 3361–85. http://dx.doi.org/10.1108/ec-12-2019-0573.

Full text

Abstract:

Purpose During the industrial design process, a product is usually modified and analyzed repeatedly until reaching the final design. Modifying the model and regenerating a mesh for every update during this process is very time consuming. To improve efficiency, it is necessary to circumvent the computer-aided design modeling stage when possible and directly modify the meshes to save valuable time. The purpose of this paper is to develop a method for mesh modifications. Design/methodology/approach In contrast to existing studies, which focus on one or a class of modifications, this paper comprehensively studies mesh union, mesh gluing, mesh cutting and mesh partitioning. To improve the efficiency of the method, the paper presents a fast and effective surface mesh remeshing algorithm based on a ball-packing method and controls the remeshing regions with a size field. Findings Examples and results show that the proposed mesh modification method is efficient and effective. The proposed method can be also applied to meshes with different material properties, which is very different with previous work that is only suitable for the meshes with same material property. Originality/value This paper proposes an efficient and comprehensive tetrahedral mesh modification method, through which engineers can directly modify meshes instead of models and save time.

APA, Harvard, Vancouver, ISO, and other styles

21

Kim, Hyomin, Hyeonseo Nam, Jungeon Kim, Jaesik Park, and Seungyong Lee. "LaplacianFusion." ACM Transactions on Graphics 41, no. 6 (November 30, 2022): 1–14. http://dx.doi.org/10.1145/3550454.3555511.

Full text

Abstract:

We propose LaplacianFusion , a novel approach that reconstructs detailed and controllable 3D clothed-human body shapes from an input depth or 3D point cloud sequence. The key idea of our approach is to use Laplacian coordinates, well-known differential coordinates that have been used for mesh editing, for representing the local structures contained in the input scans, instead of implicit 3D functions or vertex displacements used previously. Our approach reconstructs a controllable base mesh using SMPL, and learns a surface function that predicts Laplacian coordinates representing surface details on the base mesh. For a given pose, we first build and subdivide a base mesh, which is a deformed SMPL template, and then estimate Laplacian coordinates for the mesh vertices using the surface function. The final reconstruction for the pose is obtained by integrating the estimated Laplacian coordinates as a whole. Experimental results show that our approach based on Laplacian coordinates successfully reconstructs more visually pleasing shape details than previous methods. The approach also enables various surface detail manipulations, such as detail transfer and enhancement.

APA, Harvard, Vancouver, ISO, and other styles

22

Jones, Benjamin, Yuxuan Mei, Haisen Zhao, Taylor Gotfrid, Jennifer Mankoff, and Adriana Schulz. "Computational Design of Knit Templates." ACM Transactions on Graphics 41, no. 2 (April 30, 2022): 1–16. http://dx.doi.org/10.1145/3488006.

Full text

Abstract:

We present an interactive design system for knitting that allows users to create template patterns that can be fabricated using an industrial knitting machine. Our interactive design tool is novel in that it allows direct control of key knitting design axes we have identified in our formative study and does so consistently across the variations of an input parametric template geometry. This is achieved with two key technical advances. First, we present an interactive meshing tool that lets users build a coarse quadrilateral mesh that adheres to their knit design guidelines. This solution ensures consistency across the parameter space for further customization over shape variations and avoids helices, promoting knittability. Second, we lift and formalize low-level machine knitting constraints to the level of this coarse quad mesh. This enables us to not only guarantee hand- and machine-knittability, but also provides automatic design assistance through auto-completion and suggestions. We show the capabilities through a set of fabricated examples that illustrate the effectiveness of our approach in creating a wide variety of objects and interactively exploring the space of design variations.

APA, Harvard, Vancouver, ISO, and other styles

23

Kubota, Tetsuyuki, and Peter Chow. "Development of CAD-to-CAE Model Preparation Technology." Applied Mechanics and Materials 459 (October 2013): 325–29. http://dx.doi.org/10.4028/www.scientific.net/amm.459.325.

Full text

Abstract:

This paper explains and demonstrates how to reduce time for preparation of 3-dimensional (3D) geometrical Computer-Aided-Engineering (CAE) model from 3D Computer-Aided-Design (CAD) data. In generally, CAE model preparation is labor intensive and takes long time. Main part of preparation work is simplification of 3D-CAD data to decrease mesh scale and without impacting the solution accuracy. The purpose of this study is to create automatic CAE model preparation technology for reduction of preparation time. In this study, automatic model preparation method is developed by using of geometrical and topological information of 3D-CAD data. Benchmark test is performed to proof the efficiency of the method.

APA, Harvard, Vancouver, ISO, and other styles

24

Sugio, Carolina Yoshi Campos, Bianca Tavares Rangel, Amanda Aparecida Maia Neves Garcia, Anna Clara Gurgel Gomes, Adolfo Coelho de Oliveira Lopes, Estevam Augusto Bonfante, and Karin Hermana Neppelenbroek. "Intra-radicular retention with custom designed CAD-CAM fibRe-reinforced composite post-core: a dental technique." Primary Dental Journal 13, no. 2 (June 2024): 53–57. http://dx.doi.org/10.1177/20501684241249546.

Full text

Abstract:

A technique is outlined for utilising a polymeric composite reinforced with glass fibres in a three-dimensional mesh as a post-core in aesthetic cases. The clinical procedure involves obtaining an impression of the root canal space, scanning the definitive cast, and milling a fibre-reinforced composite post-core. Subsequently, the intra-radicular post-core is cemented using an adhesive resin cement. The use of custom-made computer-aided design–computer-aided manufacturing (CAD-CAM) fibre-reinforced composite post-core facilitates repairability, provides better adaptation to the root canal space, avoids uneven cement thickness, ensures chemical adhesion to resin cement, and promotes favourable aesthetics when combined with all-ceramic crowns.

APA, Harvard, Vancouver, ISO, and other styles

25

Hamidi, Mohamed, Aladine Chetouani, Mohamed El Haziti, Mohammed El Hassouni, and Hocine Cherifi. "Blind Robust 3D Mesh Watermarking Based on Mesh Saliency and Wavelet Transform for Copyright Protection." Information 10, no. 2 (February 18, 2019): 67. http://dx.doi.org/10.3390/info10020067.

Full text

Abstract:

Three-dimensional models have been extensively used in several applications including computer-aided design (CAD), video games, medical imaging due to the processing capability improvement of computers, and the development of network bandwidth. Therefore, the necessity of implementing 3D mesh watermarking schemes aiming to protect copyright has increased considerably. In this paper, a blind robust 3D mesh watermarking method based on mesh saliency and wavelet transform for copyright protection is proposed. The watermark is inserted by quantifying the wavelet coefficients using quantization index modulation (QIM) according to the mesh saliency of the 3D semiregular mesh. The synchronizing primitive is the distance between the mesh center and salient points in the descending order. The experimental results show the high imperceptibility of the proposed scheme while ensuring a good robustness against a wide range of attacks including smoothing, additive noise, element reordering, similarity transformations, etc.

APA, Harvard, Vancouver, ISO, and other styles

26

Shen, Tianchang, Jacob Munkberg, Jon Hasselgren, Kangxue Yin, Zian Wang, Wenzheng Chen, Zan Gojcic, Sanja Fidler, Nicholas Sharp, and Jun Gao. "Flexible Isosurface Extraction for Gradient-Based Mesh Optimization." ACM Transactions on Graphics 42, no. 4 (July 26, 2023): 1–16. http://dx.doi.org/10.1145/3592430.

Full text

Abstract:

This work considers gradient-based mesh optimization, where we iteratively optimize for a 3D surface mesh by representing it as the isosurface of a scalar field, an increasingly common paradigm in applications including photogrammetry, generative modeling, and inverse physics. Existing implementations adapt classic isosurface extraction algorithms like Marching Cubes or Dual Contouring; these techniques were designed to extract meshes from fixed, known fields, and in the optimization setting they lack the degrees of freedom to represent high-quality feature-preserving meshes, or suffer from numerical instabilities. We introduce FlexiCubes, an isosurface representation specifically designed for optimizing an unknown mesh with respect to geometric, visual, or even physical objectives. Our main insight is to introduce additional carefully-chosen parameters into the representation, which allow local flexible adjustments to the extracted mesh geometry and connectivity. These parameters are updated along with the underlying scalar field via automatic differentiation when optimizing for a downstream task. We base our extraction scheme on Dual Marching Cubes for improved topological properties, and present extensions to optionally generate tetrahedral and hierarchically-adaptive meshes. Extensive experiments validate FlexiCubes on both synthetic benchmarks and real-world applications, showing that it offers significant improvements in mesh quality and geometric fidelity.

APA, Harvard, Vancouver, ISO, and other styles

27

Ma, Song-Hua, and Ling Tian. "Analysis feature recognition and mixed-dimensional model reconstruction from finite element analysis mesh model." Proceedings of the Institution of Mechanical Engineers, Part C: Journal of Mechanical Engineering Science 228, no. 7 (September 18, 2013): 1197–207. http://dx.doi.org/10.1177/0954406213504860.

Full text

Abstract:

Instead of extracting mid-surfaces from computer-aided design model, an automatic dimensional reduction approach is proposed, which simplifies the finite element analysis model into the mixed-dimensional model. The input finite element analysis model is first decomposed into a set of locally prominent cross-sections. Each prominent cross-section is digitalized as a d-dimensional point and clustered in the embedded space. By the clustered points, both long-slender and thin-wall regions are detected and recognized with the help of aspect ratio. Further the identified features are reduced into skeletons and mid-surfaces, respectively, and the elements of lower dimensionality are generated simultaneously. This dimensional reduction procedure is general and feasible. In this case, multi-resolution mesh models could be created without being transformed back into computer-aided design software, which is essential to the multi-disciplinary simulation. Finally, the simplification degree tests show that the nodes and elements are largely decreased; furthermore, the proposed approach is more effective than the traditional manual method on time consuming.

APA, Harvard, Vancouver, ISO, and other styles

28

Heistermann, Martin, Jethro Warnett, and David Bommes. "Min-Deviation-Flow in Bi-directed Graphs for T-Mesh Quantization." ACM Transactions on Graphics 42, no. 4 (July 26, 2023): 1–25. http://dx.doi.org/10.1145/3592437.

Full text

Abstract:

Subdividing non-conforming T-mesh layouts into conforming quadrangular meshes is a core component of state-of-the-art (re-)meshing methods. Typically, the required constrained assignment of integer lengths to T-Mesh edges is left to generic branch-and-cut solvers, greedy heuristics, or a combination of the two. This either does not scale well with input complexity or delivers suboptimal result quality. We introduce the Minimum-Deviation-Flow Problem in bi-directed networks (Bi-MDF) and demonstrate its use in modeling and efficiently solving a variety of T-Mesh quantization problems. We develop a fast approximate solver as well as an iterative refinement algorithm based on matching in graphs that solves Bi-MDF exactly. Compared to the state-of-the-art QuadWild [Pietroni et al. 2021] implementation on the authors' 300 dataset, our exact solver finishes after only 0.49% (total 17.06s) of their runtime (3491s) and achieves 11% lower energy while an approximation is computed after 0.09% (3.19s) of their runtime at the cost of 24% increased energy. A novel half-arc-based T-Mesh quantization formulation extends the feasible solution space to include previously unattainable quad meshes. The Bi-MDF problem is more general than our application in layout quantization, potentially enabling similar speedups for other optimization problems that fit into the scheme, such as quad mesh refinement.

APA, Harvard, Vancouver, ISO, and other styles

29

Zong, Chen, Jiacheng Xu, Jiantao Song, Shuangmin Chen, Shiqing Xin, Wenping Wang, and Changhe Tu. "P2M: A Fast Solver for Querying Distance from Point to Mesh Surface." ACM Transactions on Graphics 42, no. 4 (July 26, 2023): 1–13. http://dx.doi.org/10.1145/3592439.

Full text

Abstract:

Most of the existing point-to-mesh distance query solvers, such as Proximity Query Package (PQP), Embree and Fast Closest Point Query (FCPW), are based on bounding volume hierarchy (BVH). The hierarchical organizational structure enables one to eliminate the vast majority of triangles that do not help find the closest point. In this paper, we develop a totally different algorithmic paradigm, named P2M , to speed up point-to-mesh distance queries. Our original intention is to precompute a KD tree (KDT) of mesh vertices to approximately encode the geometry of a mesh surface containing vertices, edges and faces. However, it is very likely that the closest primitive to the query point is an edge e (resp., a face f ), but the KDT reports a mesh vertex υ instead. We call υ an interceptor of e (resp., f ). The main contribution of this paper is to invent a simple yet effective interception inspection rule and an efficient flooding interception inspection algorithm for quickly finding out all the interception pairs. Once the KDT and the interception table are precomputed, the query stage proceeds by first searching the KDT and then looking up the interception table to retrieve the closest geometric primitive. Statistics show that our query algorithm runs many times faster than the state-of-the-art solvers.

APA, Harvard, Vancouver, ISO, and other styles

30

Lee, Tong-Yee, Chao-Hung Lin, Hung-Kuo Chu, Yu-Shuen Wang, Shao-Wei Yen, and Chang-Rung Tsai. "Mesh pose-editing using examples." Computer Animation and Virtual Worlds 18, no. 4-5 (2007): 235–45. http://dx.doi.org/10.1002/cav.178.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Lyon, M., M. Campen, and L. Kobbelt. "Quad Layouts via Constrained T‐Mesh Quantization." Computer Graphics Forum 40, no. 2 (May 2021): 305–14. http://dx.doi.org/10.1111/cgf.142634.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Dielen, Alexander, Isaak Lim, Max Lyon, and Leif Kobbelt. "Learning Direction Fields for Quad Mesh Generation." Computer Graphics Forum 40, no. 5 (August 2021): 181–91. http://dx.doi.org/10.1111/cgf.14366.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Jiang, Zhongshi, Jiacheng Dai, Yixin Hu, Yunfan Zhou, Jeremie Dumas, Qingnan Zhou, Gurkirat Singh Bajwa, Denis Zorin, Daniele Panozzo, and Teseo Schneider. "Declarative Specification for Unstructured Mesh Editing Algorithms." ACM Transactions on Graphics 41, no. 6 (November 30, 2022): 1–14. http://dx.doi.org/10.1145/3550454.3555513.

Full text

Abstract:

We introduce a novel approach to describe mesh generation, mesh adaptation, and geometric modeling algorithms relying on changing mesh connectivity using a high-level abstraction. The main motivation is to enable easy customization and development of these algorithms via a declarative specification consisting of a set of per-element invariants, operation scheduling, and attribute transfer for each editing operation. We demonstrate that widely used algorithms editing surfaces and volumes can be compactly expressed with our abstraction, and their implementation within our framework is simple, automatically parallelizable on shared-memory architectures, and with guaranteed satisfaction of the prescribed invariants. These algorithms are readable and easy to customize for specific use cases. We introduce a software library implementing this abstraction and providing automatic shared-memory parallelization.

APA, Harvard, Vancouver, ISO, and other styles

34

Brückler, Hendrik, David Bommes, and Marcel Campen. "Volume parametrization quantization for hexahedral meshing." ACM Transactions on Graphics 41, no. 4 (July 2022): 1–19. http://dx.doi.org/10.1145/3528223.3530123.

Full text

Abstract:

Developments in the field of parametrization-based quad mesh generation on surfaces have been impactful over the past decade. In this context, an important advance has been the replacement of error-prone rounding in the generation of integer-grid maps, by robust quantization methods. In parallel, parametrization-based hex mesh generation for volumes has been advanced. In this volumetric context, however, the state-of-the-art still relies on fragile rounding, not rarely producing defective meshes, especially when targeting a coarse mesh resolution. We present a method to robustly quantize volume parametrizations, i.e., to determine guaranteed valid choices of integers for 3D integer-grid maps. Inspired by the 2D case, we base our construction on a non-conforming cell decomposition of the volume, a 3D analogue of a T-mesh. In particular, we leverage the motorcycle complex, a recent generalization of the motorcycle graph, for this purpose. Integer values are expressed in a differential manner on the edges of this complex, enabling the efficient formulation of the conditions required to strictly prevent forcing the map into degeneration. Applying our method in the context of hexahedral meshing, we demonstrate that hexahedral meshes can be generated with significantly improved flexibility.

APA, Harvard, Vancouver, ISO, and other styles

35

Portaneri, Cédric, Mael Rouxel-Labbé, Michael Hemmer, David Cohen-Steiner, and Pierre Alliez. "Alpha wrapping with an offset." ACM Transactions on Graphics 41, no. 4 (July 2022): 1–22. http://dx.doi.org/10.1145/3528223.3530152.

Full text

Abstract:

Given an input 3D geometry such as a triangle soup or a point set, we address the problem of generating a watertight and orientable surface triangle mesh that strictly encloses the input. The output mesh is obtained by greedily refining and carving a 3D Delaunay triangulation on an offset surface of the input, while carving with empty balls of radius alpha. The proposed algorithm is controlled via two user-defined parameters: alpha and offset. Alpha controls the size of cavities or holes that cannot be traversed during carving, while offset controls the distance between the vertices of the output mesh and the input. Our algorithm is guaranteed to terminate and to yield a valid and strictly enclosing mesh, even for defect-laden inputs. Genericity is achieved using an abstract interface probing the input, enabling any geometry to be used, provided a few basic geometric queries can be answered. We benchmark the algorithm on large public datasets such as Thingi10k, and compare it to state-of-the-art approaches in terms of robustness, approximation, output complexity, speed, and peak memory consumption. Our implementation is available through the CGAL library.

APA, Harvard, Vancouver, ISO, and other styles

36

Altunbasak, Y., and A. M. Tekalp. "Occlusion-adaptive, content-based mesh design and forward tracking." IEEE Transactions on Image Processing 6, no. 9 (September 1997): 1270–80. http://dx.doi.org/10.1109/83.623190.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Casagrande, Angelo, Pénélope Leyland, and Luca Formaggia. "Parallel Mesh Adaptive Techniques for Complex Flow Simulation: Geometry Conservation." Modelling and Simulation in Engineering 2012 (2012): 1–13. http://dx.doi.org/10.1155/2012/495935.

Full text

Abstract:

Dynamic mesh adaptation on unstructured grids, by localised refinement and derefinement, is a very efficient tool for enhancing solution accuracy and optimising computational time. One of the major drawbacks, however, resides in the projection of the new nodes created, during the refinement process, onto the boundary surfaces. This can be addressed by the introduction of a library capable of handling geometric properties given by a CAD (computer-aided design) description. This is of particular interest also to enhance the adaptation module when the mesh is being smoothed, and hence moved, to then reproject it onto the surface of the exact geometry.

APA, Harvard, Vancouver, ISO, and other styles

38

Shen, Yuefan, Hongbo Fu, Zhongshuo Du, Xiang Chen, Evgeny Burnaev, Denis Zorin, Kun Zhou, and Youyi Zheng. "GCN-Denoiser: Mesh Denoising with Graph Convolutional Networks." ACM Transactions on Graphics 41, no. 1 (February 28, 2022): 1–14. http://dx.doi.org/10.1145/3480168.

Full text

Abstract:

In this article, we present GCN-Denoiser, a novel feature-preserving mesh denoising method based on graph convolutional networks ( GCNs ). Unlike previous learning-based mesh denoising methods that exploit handcrafted or voxel-based representations for feature learning, our method explores the structure of a triangular mesh itself and introduces a graph representation followed by graph convolution operations in the dual space of triangles. We show such a graph representation naturally captures the geometry features while being lightweight for both training and inference. To facilitate effective feature learning, our network exploits both static and dynamic edge convolutions, which allow us to learn information from both the explicit mesh structure and potential implicit relations among unconnected neighbors. To better approximate an unknown noise function, we introduce a cascaded optimization paradigm to progressively regress the noise-free facet normals with multiple GCNs. GCN-Denoiser achieves the new state-of-the-art results in multiple noise datasets, including CAD models often containing sharp features and raw scan models with real noise captured from different devices. We also create a new dataset called PrintData containing 20 real scans with their corresponding ground-truth meshes for the research community. Our code and data are available at https://github.com/Jhonve/GCN-Denoiser.

APA, Harvard, Vancouver, ISO, and other styles

39

Fang, Xianzhong, Mathieu Desbrun, Hujun Bao, and Jin Huang. "TopoCut." ACM Transactions on Graphics 41, no. 4 (July 2022): 1–15. http://dx.doi.org/10.1145/3528223.3530149.

Full text

Abstract:

Given a complex three-dimensional domain delimited by a closed and non-degenerate input triangle mesh without any self-intersection, a common geometry processing task consists in cutting up the domain into cells through a set of planar cuts, creating a "cut-cell mesh", i.e., a volumetric decomposition of the domain amenable to visualization (e.g., exploded views), animation (e.g., virtual surgery), or simulation (finite volume computations). A large number of methods have proposed either efficient or robust solutions, sometimes restricting the cuts to form a regular or adaptive grid for simplicity; yet, none can guarantee both properties, severely limiting their usefulness in practice. At the core of the difficulty is the determination of topological relationships among large numbers of vertices, edges, faces and cells in order to assemble a proper cut-cell mesh: while exact geometric computations provide a robust solution to this issue, their high computational cost has prompted a number of faster solutions based on, e.g., local floating-point angle sorting to significantly accelerate the process --- but losing robustness in doing so. In this paper, we introduce a new approach to planar cutting of 3D domains that substitutes topological inference for numerical ordering through a novel mesh data structure, and revert to exact numerical evaluations only in the few rare cases where it is strictly necessary. We show that our novel concept of topological cuts exploits the inherent structure of cut-cell mesh generation to save computational time while still guaranteeing exactness for, and robustness to, arbitrary cuts and surface geometry. We demonstrate the superiority of our approach over state-of-the-art methods on almost 10,000 meshes with a wide range of geometric and topological complexity. We also provide an open source implementation.

APA, Harvard, Vancouver, ISO, and other styles

40

Sun, Xiaopeng, Qi Zhang, and Xiaopeng Wei. "Semi-supervised 3D Mesh Hierarchical Segmentation." Journal of Computer-Aided Design & Computer Graphics 22, no. 4 (June 10, 2010): 592–98. http://dx.doi.org/10.3724/sp.j.1089.2010.10791.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Sun, Yan, Xuelin Deng, Liangli He, and Haiyan Yao. "Regularization Method for Discrete Mesh Points." Journal of Computer-Aided Design & Computer Graphics 34, no. 05 (May 1, 2022): 804–10. http://dx.doi.org/10.3724/sp.j.1089.2022.19003.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Wang, Yimin, and Jianmin Zheng. "Tubular triangular mesh parameterization and applications." Computer Animation and Virtual Worlds 21, no. 2 (March 2010): 91–102. http://dx.doi.org/10.1002/cav.325.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Xin, Shiqing, Pengfei Wang, Rui Xu, Dongming Yan, Shuangmin Chen, Wenping Wang, Caiming Zhang, and Changhe Tu. "SurfaceVoronoi." ACM Transactions on Graphics 41, no. 6 (November 30, 2022): 1–12. http://dx.doi.org/10.1145/3550454.3555453.

Full text

Abstract:

In this paper, we propose to compute Voronoi diagrams over mesh surfaces driven by an arbitrary geodesic distance solver, assuming that the input is a triangle mesh as well as a collection of sites P = { Pi } m i =1 on the surface. We propose two key techniques to solve this problem. First, as the partition is determined by minimizing the m distance fields, each of which rooted at a source site, we suggest keeping one or more distance triples, for each triangle, that may help determine the Voronoi bisectors when one uses a mark-and-sweep geodesic algorithm to predict the multi-source distance field. Second, rather than keep the distance itself at a mesh vertex, we use the squared distance to characterize the linear change of distance field restricted in a triangle, which is proved to induce an exact VD when the base surface reduces to a planar triangle mesh. Specially, our algorithm also supports the Euclidean distance, which can handle thin-sheet models (e.g. leaf) and runs faster than the traditional restricted Voronoi diagram (RVD) algorithm. It is very extensible to deal with various variants of surface-based Voronoi diagrams including (1) surface-based power diagram, (2) constrained Voronoi diagram with curve-type breaklines, and (3) curve-type generators. We conduct extensive experimental results to validate the ability to approximate the exact VD in different distance-driven scenarios.

APA, Harvard, Vancouver, ISO, and other styles

44

Liu, Yu-Shen, Hui Zhang, Jun-Hai Yong, Pi-Qiang Yu, and Jia-Guang Sun. "Mesh blending." Visual Computer 21, no. 11 (August 31, 2005): 915–27. http://dx.doi.org/10.1007/s00371-005-0306-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Winkler, Tim, Kai Hormann, and Craig Gotsman. "Mesh massage." Visual Computer 24, no. 7-9 (June 5, 2008): 775–85. http://dx.doi.org/10.1007/s00371-008-0259-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Sorgente, T., S. Biasotti, G. Manzini, and M. Spagnuolo. "A Survey of Indicators for Mesh Quality Assessment." Computer Graphics Forum 42, no. 2 (May 2023): 461–83. http://dx.doi.org/10.1111/cgf.14779.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Li, Yuan, Xiangyang He, Yankai Jiang, Huan Liu, Yubo Tao, and Lin Hai. "MeshFormer: High‐resolution Mesh Segmentation with Graph Transformer." Computer Graphics Forum 41, no. 7 (October 2022): 37–49. http://dx.doi.org/10.1111/cgf.14655.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Diazzi, Lorenzo, and Marco Attene. "Convex polyhedral meshing for robust solid modeling." ACM Transactions on Graphics 40, no. 6 (December 2021): 1–16. http://dx.doi.org/10.1145/3478513.3480564.

Full text

Abstract:

We introduce a new technique to create a mesh of convex polyhedra representing the interior volume of a triangulated input surface. Our approach is particularly tolerant to defects in the input, which is allowed to self-intersect, to be non-manifold, disconnected, and to contain surface holes and gaps. We guarantee that the input surface is exactly represented as the union of polygonal facets of the output volume mesh. Thanks to our algorithm, traditionally difficult solid modeling operations such as mesh booleans and Minkowski sums become surprisingly robust and easy to implement, even if the input has defects. Our technique leverages on the recent concept of indirect geometric predicate to provide an unprecedented combination of guaranteed robustness and speed, thus enabling the practical implementation of robust though flexible solid modeling systems. We have extensively tested our method on all the 10000 models of the Thingi10k dataset, and concluded that no existing method provides comparable robustness, precision and performances.

APA, Harvard, Vancouver, ISO, and other styles

49

Chen, Zhen, Hsiao-Yu Chen, Danny M. Kaufman, Mélina Skouras, and Etienne Vouga. "Fine Wrinkling on Coarsely Meshed Thin Shells." ACM Transactions on Graphics 40, no. 5 (October 31, 2021): 1–32. http://dx.doi.org/10.1145/3462758.

Full text

Abstract:

We propose a new model and algorithm to capture the high-definition statics of thin shells via coarse meshes. This model predicts global, fine-scale wrinkling at frequencies much higher than the resolution of the coarse mesh; moreover, it is grounded in the geometric analysis of elasticity, and does not require manual guidance, a corpus of training examples, nor tuning of ad hoc parameters. We first approximate the coarse shape of the shell using tension field theory, in which material forces do not resist compression. We then augment this base mesh with wrinkles, parameterized by an amplitude and phase field that we solve for over the base mesh, which together characterize the geometry of the wrinkles. We validate our approach against both physical experiments and numerical simulations, and we show that our algorithm produces wrinkles qualitatively similar to those predicted by traditional shell solvers requiring orders of magnitude more degrees of freedom.

APA, Harvard, Vancouver, ISO, and other styles

50

Brückler, Hendrik, and Marcel Campen. "Collapsing Embedded Cell Complexes for Safer Hexahedral Meshing." ACM Transactions on Graphics 42, no. 6 (December 5, 2023): 1–24. http://dx.doi.org/10.1145/3618384.

Full text

Abstract:

We present a set of operators to perform modifications, in particular collapses and splits, in volumetric cell complexes which are discretely embedded in a background mesh. Topological integrity and geometric embedding validity are carefully maintained. We apply these operators strategically to volumetric block decompositions, so-called T-meshes or base complexes, in the context of hexahedral mesh generation. This allows circumventing the expensive and unreliable global volumetric remapping step in the versatile meshing pipeline based on 3D integer-grid maps. In essence, we reduce this step to simpler local cube mapping problems, for which reliable solutions are available. As a consequence, the robustness of the mesh generation process is increased, especially when targeting coarse or block-structured hexahedral meshes. We furthermore extend this pipeline to support feature alignment constraints, and systematically respect these throughout, enabling the generation of meshes that align to points, curves, and surfaces of special interest, whether on the boundary or in the interior of the domain.

APA, Harvard, Vancouver, ISO, and other styles

Journal articles on the topic 'Computer-Aided Design [MESH]'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles