Spelling suggestions: "subject:"mest smoothing""
1 |
Non-Iterative, Feature-Preserving Mesh SmoothingJones, Thouis R., Durand, Frédo, Desbrun, Mathieu 01 1900 (has links)
With the increasing use of geometry scanners to create 3D models, there is a rising need for fast and robust mesh smoothing to remove inevitable noise in the measurements. While most previous work has favored diffusion-based iterative techniques for feature-preserving smoothing, we propose a radically different approach, based on robust statistics and local first-order predictors of the surface. The robustness of our local estimates allows us to derive a non-iterative feature-preserving filtering technique applicable to arbitrary "triangle soups". We demonstrate its simplicity of implementation and its efficiency, which make it an excellent solution for smoothing large, noisy, and non-manifold meshes. / Singapore-MIT Alliance (SMA)
|
2 |
Tetrahedral Meshes in Biomedical Applications: Generation, Boundary Recovery and Quality EnhancementsGhadyani, Hamid R 30 March 2009 (has links)
Mesh generation is a fundamental precursor to finite element implementations for solution of partial differential equations in engineering and science. This dissertation advances the field in three distinct but coupled areas. A robust and fast three dimensional mesh generator for arbitrarily shaped geometries was developed. It deploys nodes throughout the domain based upon user-specified mesh density requirements. The system is integer and pixel based which eliminates round off errors, substantial memory requirements and cpu intensive calculations. Linked, but fully detachable, to the mesh generation system is a physical boundary recovery routine. Frequently, the original boundary topology is required for specific boundary condition applications or multiple material constraints. Historically, this boundary preservation was not available. An algorithm was developed, refined and optimized that recovers the original boundaries, internal and external, with fidelity. Finally, a node repositioning algorithm was developed that maximizes the minimum solid angle of tetrahedral meshes. The highly coveted 2D Delaunay property that maximizes the minimum interior angle of a triangle mesh does not extend to its 3D counterpart, to maximize the minimum solid angle of a tetrahedron mesh. As a consequence, 3D Delaunay created meshes have unacceptable sliver tetrahedral elements albeit composed of 4 high quality triangle sides. These compromised elements are virtually unavoidable and can foil an otherwise intact mesh. The numerical optimization routine developed takes any preexisting tetrahedral mesh and repositions the nodes without changing the mesh topology so that the minimum solid angle of the tetrahedrons is maximized. The overall quality enhancement of the volume mesh might be small, depending upon the initial mesh. However, highly distorted elements that create ill-conditioned global matrices and foil a finite element solver are enhanced significantly.
|
3 |
Parallel Mesh Adaptation and Graph Analysis Using Graphics Processing UnitsMcguiness, Timothy P 01 January 2011 (has links) (PDF)
In the field of Computational Fluid Dynamics, several types of mesh adaptation strategies are used to enhance a mesh’s quality, thereby improving simulation speed and accuracy. Mesh smoothing (r-refinement) is a simple and effective technique, where nodes are repositioned to increase or decrease local mesh resolution. Mesh partitioning divides a mesh into sections, for use on distributed-memory parallel machines. As a more abstract form of modeling, graph theory can be used to simulate many real-world problems, and has applications in the fields of computer science, sociology, engineering and transportation, to name a few. One of the more important graph analysis tasks involves moving through the graph to evaluate and calculate nodal connectivity. The basic structures of meshes and graphs are the same, as both rely heavily on connectivity information, representing the relationships between constituent nodes and edges. This research examines the parallelization of these algorithms using commodity graphics hardware; a low-cost tool readily available to the computing community. Not only does this research look at the benefits of the fine-grained parallelism of an individual graphics processor, but the use of Message Passing Interface (MPI) on large-scale GPU-based supercomputers is also studied.
|
4 |
Size Function Based Mesh RelaxationHowlett, John David 18 March 2005 (has links) (PDF)
This thesis addresses the problem of relaxing a finite element mesh to more closely match a size function. The main contributions include new methods for performing size function based mesh relaxation, as well as an algorithm for measuring the performance of size function based mesh relaxation methods.
|
5 |
Finite Element Modeling Of Electromagnetic Scattering Problems Via Hexahedral Edge ElementsYilmaz, Asim Egemen 01 July 2007 (has links) (PDF)
In this thesis, quadratic hexahedral edge elements have been applied to the three dimensional for open region electromagnetic scattering problems. For this purpose, a semi-automatic all-hexahedral mesh generation algorithm is developed and implemented. Material properties inside the elements and along the edges are also determined and prescribed during the mesh generation phase in order to be used in the solution phase. Based on the condition number quality metric, the generated mesh is optimized by means of the Particle Swarm Optimization (PSO) technique. A framework implementing hierarchical hexahedral edge elements is implemented to investigate the performance of linear and quadratic hexahedral edge elements. Perfectly Matched Layers (PMLs), which are implemented by using a complex coordinate transformation, have been used for mesh truncation in the software. Sparse storage and relevant efficient matrix ordering are used for the representation of the system of equations. Both direct and indirect sparse matrix solution methods are implemented and used.
Performance of quadratic hexahedral edge elements is deeply investigated over the radar cross-sections of several curved or flat objects with or without patches. Instead of the de-facto standard of 0.1 wavelength linear element size, 0.3-0.4 wavelength quadratic element size was observed to be a new potential criterion for electromagnetic scattering and radiation problems.
|
6 |
A Fractional Step Zonal Model and Unstructured Mesh Generation Frame-work for Simulating Cabin FlowsTarroc Gil, Sergi January 2021 (has links)
The simulation of physical systems in the early stages of conceptual designs has shown to be a key factor for adequate decision making and avoiding big and expensive issues downstream in engineering projects. In the case of aircraft cabin design, taking into account the thermal comfort of the passengers as well as the proper air circulation and renovation can make this difference. However, current numerical fluid simulations (CFD) are too computationally expensive for integrating them in early design stages where extensive comparative studies have to be performed. Instead, Zonal Models (ZM) appear to be a fast-computation approach that can provide coarse simulations for aircraft cabin flows. In this thesis, a Zonal Model solver is developed as well as a geometry-definition and meshing framework, both in Matlab®, for performing coarse, flexible and computationally cheap flow simulations of user-defined cabin designs. On one hand, this solver consists of a Fractional Step approach for coarse unstructured bi-dimensional meshes. On the other, the cabin geometry can be introduced by hand for simple shapes, but also with Computational Aided Design tools (CAD) for more complex designs. Additionally, it can be chosen to generate the meshes from scratch or morph them from previously generated ones. / <p>The presentation was online</p>
|
Page generated in 0.0753 seconds