62 research outputs found
A Parallel Feature-preserving Mesh Variable Offsetting Method with Dynamic Programming
Mesh offsetting plays an important role in discrete geometric processing. In
this paper, we propose a parallel feature-preserving mesh offsetting framework
with variable distance. Different from the traditional method based on distance
and normal vector, a new calculation of offset position is proposed by using
dynamic programming and quadratic programming, and the sharp feature can be
preserved after offsetting. Instead of distance implicit field, a spatial
coverage region represented by polyhedral for computing offsets is proposed.
Our method can generate an offsetting model with smaller mesh size, and also
can achieve high quality without gaps, holes, and self-intersections. Moreover,
several acceleration techniques are proposed for the efficient mesh offsetting,
such as the parallel computing with grid, AABB tree and rays computing. In
order to show the efficiency and robustness of the proposed framework, we have
tested our method on the quadmesh dataset, which is available at
[https://www.quadmesh.cloud]. The source code of the proposed algorithm is
available on GitHub at [https://github.com/iGame-Lab/PFPOffset]
A generic energy‐conserving discrete element modeling strategy for concave particles represented by surface triangular meshes
A generic energy-conserving linear normal contact model for concave particles in the discrete element method (DEM) is presented in the current paper. It is derived based on a recently enhanced general energy-conserving contact theory for arbitrarily shaped particles. A set of more effective evaluation schemes required in the model are also given, which shows that only the intersection boundary between two contact shapes, instead of their contact region or surfaces, is required to be explicitly obtained, thereby substantially improving both efficiency and applicability of the proposed contact model over the previous version. A surface triangular mesh is used to represent any 3D concave particle. The computational issues associated with the contact of two surface triangulated 3D shapes, including the contact detection, the determination of intersection boundary segments, the computation of contact features and parallelisation, critical time step, and friction and damping treatment for multiple contacts are described in detail. Two sets of numerical examples involving various concave 3D shapes with a large number of surface triangles are presented to demonstrate either the superb energy-conserving property of the proposed model model, or its effectiveness, robustness and universal nature for wider and more complex problems
Parallel Multiscale Contact Dynamics for Rigid Non-spherical Bodies
The simulation of large numbers of rigid bodies of non-analytical shapes or vastly varying sizes which collide with each other is computationally challenging. The fundamental problem is the identification of all contact points between all particles at every time step. In the Discrete Element Method (DEM), this is particularly difficult for particles of arbitrary geometry that exhibit sharp features (e.g. rock granulates). While most codes avoid non-spherical or non-analytical shapes due to the computational complexity, we introduce an iterative-based contact detection method for triangulated geometries. The new method is an improvement over a naive brute force approach which checks all possible geometric constellations of contact and thus exhibits a lot of execution branching. Our iterative approach has limited branching and high floating point operations per processed byte. It thus is suitable for modern Single Instruction Multiple Data (SIMD) CPU hardware. As only the naive brute force approach is robust and always yields a correct solution, we propose a hybrid solution that combines the best of the two worlds to produce fast and robust contacts. In terms of the DEM workflow, we furthermore propose a multilevel tree-based data structure strategy that holds all particles in the domain on multiple scales in grids. Grids reduce the total computational complexity of the simulation. The data structure is combined with the DEM phases to form a single touch tree-based traversal that identifies both contact points between particle pairs and introduces concurrency to the system during particle comparisons in one multiscale grid sweep. Finally, a reluctant adaptivity variant is introduced which enables us to realise an improved time stepping scheme with larger time steps than standard adaptivity while we still minimise the grid administration overhead. Four different parallelisation strategies that exploit multicore architectures are discussed for the triad of methodological ingredients. Each parallelisation scheme exhibits unique behaviour depending on the grid and particle geometry at hand. The fusion of them into a task-based parallelisation workflow yields promising speedups. Our work shows that new computer architecture can push the boundary of DEM computability but this is only possible if the right data structures and algorithms are chosen
Numerical and Geometric Optimizations for Surface and Tolerance Modeling
Optimization techniques are widely used in many research and engineering areas. This dissertation presents numerical and geometric optimization methods for solving geometric and solid modeling problems.
Geometric optimization methods are designed for manufacturing process planning, which optimizes the process by changing dependency relationships among geometric primitives from the original design diagram. Geometric primitives are used to represent part features, and dependencies in the dimensions between parts are represented by a topological graph. The ordering of these dependencies can have a significant effect on the tolerance zones in the part. To obtain tolerance zones from the dependencies, the conventional parametric method of tolerance analysis is de-composed into a set of geometric computations, which are combined and cascaded to obtain the tolerance zones in the geometric representations. Geometric optimization is applied to the topological graph in order to find a solution that provides not only an optimal dimensioning scheme but also an optimal plan for manufacturing the physical part. The applications of our method include tolerance analysis, dimension scheme optimization, and process planning.
Two numerical optimization methods are proposed for local and global surface parameterizations. One is the nonlinear optimization, which is used for building the local field-aware parameterization. Given a local chart of the surface, a two-phase method is proposed, which generates a folding-free parameterization while still being aware of the geodesic metric. The parameterization method is applied in a view-dependent 3D painting system, which constitutes a local, adaptive and interactive painting environment. The other is the mixed-integer quadratic optimization, which is used for generating a quad mesh from a given triangular mesh. With a given cross field, the computation of parametric coordinates is formulated to be a mixed-integer optimization problem, which parameterizes the surface with good quality by adding redundant integer variables. The mixed integer system is solved more efficiently by an improved adaptive rounding solver. To obtain the final quadrangular mesh, an isoline tracing method and a breadth-first traversal mesh generation method are proposed so that the final mesh result has face information, which is useful for further model processing
From 3D Models to 3D Prints: an Overview of the Processing Pipeline
Due to the wide diffusion of 3D printing technologies, geometric algorithms
for Additive Manufacturing are being invented at an impressive speed. Each
single step, in particular along the Process Planning pipeline, can now count
on dozens of methods that prepare the 3D model for fabrication, while analysing
and optimizing geometry and machine instructions for various objectives. This
report provides a classification of this huge state of the art, and elicits the
relation between each single algorithm and a list of desirable objectives
during Process Planning. The objectives themselves are listed and discussed,
along with possible needs for tradeoffs. Additive Manufacturing technologies
are broadly categorized to explicitly relate classes of devices and supported
features. Finally, this report offers an analysis of the state of the art while
discussing open and challenging problems from both an academic and an
industrial perspective.Comment: European Union (EU); Horizon 2020; H2020-FoF-2015; RIA - Research and
Innovation action; Grant agreement N. 68044
Collision detection in 3D space
Práce se zabývá detekcí kolizí v 3D simulačním prostoru. V první části jsou popsány nejpoužívanější algoritmy pro detekci, stejně jako některé knihovny hotových řešení. Druhá část práce obsahuje popis testovacího softwaru vytvořeného na základě knihovny OpenGL, včetně popisu důležitých částí. V poslední části práce jsou také prezentovány výsledky testování a porovnání vybraných algoritmů na vytvořených testovacích úlohách.The thesis deals with collision detection in 3D simulation space. In the first part, the most used algorithms for detection are presented as well as some complete solution libraries. The second part contains the description of the testing software, which is based on OpenGL library, including the description of important segments. The final section presents some testing problems on which the chosen algorithms were tested, results and method comparison.
Rounding, filleting and smoothing of implicit surfaces
© 2017 CAD Solutions, LLC We describe an approach for performing constant radius offsetting and the related operations of filleting, rounding and smoothing for implicit surfaces. The offsetting operation is used as the basic component for defining the remaining operations. These operations are important operations for any modelling system. While it is known how to perform these operations for parametric representation and polygon meshes, there is limited prior work for implicit surfaces and procedural volumetric objects. The proposed approach is based on repeatedly computing the distance to a given implicit surface and its offset surfaces. We illustrate the results obtained by this approach with several examples, including procedurally defined microstructures and CAD objects
- …