1,239 research outputs found
Flipping Cubical Meshes
We define and examine flip operations for quadrilateral and hexahedral
meshes, similar to the flipping transformations previously used in triangular
and tetrahedral mesh generation.Comment: 20 pages, 24 figures. Expanded journal version of paper from 10th
International Meshing Roundtable. This version removes some unwanted
paragraph breaks from the previous version; the text is unchange
Linear Complexity Hexahedral Mesh Generation
We show that any polyhedron forming a topological ball with an even number of
quadrilateral sides can be partitioned into O(n) topological cubes, meeting
face to face. The result generalizes to non-simply-connected polyhedra
satisfying an additional bipartiteness condition. The same techniques can also
be used to reduce the geometric version of the hexahedral mesh generation
problem to a finite case analysis amenable to machine solution.Comment: 12 pages, 17 figures. A preliminary version of this paper appeared at
the 12th ACM Symp. on Computational Geometry. This is the final version, and
will appear in a special issue of Computational Geometry: Theory and
Applications for papers from SCG '9
Arbitrary order 2D virtual elements for polygonal meshes: Part II, inelastic problem
The present paper is the second part of a twofold work, whose first part is
reported in [3], concerning a newly developed Virtual Element Method (VEM) for
2D continuum problems. The first part of the work proposed a study for linear
elastic problem. The aim of this part is to explore the features of the VEM
formulation when material nonlinearity is considered, showing that the accuracy
and easiness of implementation discovered in the analysis inherent to the first
part of the work are still retained. Three different nonlinear constitutive
laws are considered in the VEM formulation. In particular, the generalized
viscoplastic model, the classical Mises plasticity with isotropic/kinematic
hardening and a shape memory alloy (SMA) constitutive law are implemented. The
versatility with respect to all the considered nonlinear material constitutive
laws is demonstrated through several numerical examples, also remarking that
the proposed 2D VEM formulation can be straightforwardly implemented as in a
standard nonlinear structural finite element method (FEM) framework
Flip Distance Between Triangulations of a Planar Point Set is APX-Hard
In this work we consider triangulations of point sets in the Euclidean plane,
i.e., maximal straight-line crossing-free graphs on a finite set of points.
Given a triangulation of a point set, an edge flip is the operation of removing
one edge and adding another one, such that the resulting graph is again a
triangulation. Flips are a major way of locally transforming triangular meshes.
We show that, given a point set in the Euclidean plane and two
triangulations and of , it is an APX-hard problem to minimize
the number of edge flips to transform to .Comment: A previous version only showed NP-completeness of the corresponding
decision problem. The current version is the one of the accepted manuscrip
Quadrilateral Meshes with Bounded Minimum Angle
This paper presents an algorithm that utilizes a quadtree to construct a strictly convex quadrilateral mesh for a simple polygonal region in which no newly created angle is smaller than . This is the first known result, to the best of our knowledge, on quadrilateral mesh generation with a provable guarantee on the minimum angle
- …