Filters

2014 - 201914

More filters

2020 - 202214
Reset filters

Settings

End date: 2019 × Start date: 2010 × Type: Text × Publisher: Amsterdam [u.a.] : Elsevier × WGL Institute: WIAS ×

Search Results

Now showing 1 - 10 of 14
  • Thumbnail Image
    Item
    On Indecomposable Polyhedra and the Number of Steiner Points
    (Amsterdam [u.a.] : Elsevier, 2015) Goerigk, Nadja; Si, Hang
    The existence of indecomposable polyhedra, that is, the interior of every such polyhedron cannot be decomposed into a set of tetrahedra whose vertices are all of the given polyhedron, is well-known. However, the geometry and combinatorial structure of such polyhedra are much less studied. In this article, we investigate the structure of some well-known examples, the so-called Schönhardt polyhedron [10] and the Bagemihl's generalization of it [1], which will be called Bagemihl's polyhedra. We provide a construction of an additional point, so-called Steiner point, which can be used to decompose the Schönhardt and the Bagemihl's polyhedra. We then provide a construction of a larger class of three-dimensional indecomposable polyhedra which often appear in grid generation problems. We show that such polyhedra have the same combinatorial structure as the Schönhardt's and Bagemihl's polyhedra, but they may need more than one Steiner point to be decomposed. Given such a polyhedron with n ≥ 6 vertices, we show that it can be decomposed by adding at most interior Steiner points. We also show that this number is optimal in theworst case.
  • Thumbnail Image
    Item
    The enhanced Sanov theorem and propagation of chaos
    (Amsterdam [u.a.] : Elsevier, 2017) Deuschel, Jean-Dominique; Friz, Peter K.; Maurelli, Mario; Slowik, Martin
    We establish a Sanov type large deviation principle for an ensemble of interacting Brownian rough paths. As application a large deviations for the (-layer, enhanced) empirical measure of weakly interacting diffusions is obtained. This in turn implies a propagation of chaos result in a space of rough paths and allows for a robust analysis of the particle system and its McKean–Vlasov type limit, as shown in two corollaries.
  • Thumbnail Image
    Item
    Toward mixed-element meshing based on restricted Voronoi diagrams
    (Amsterdam [u.a.] : Elsevier, 2014) Pellerin, J.; Lévy, B.; Caumon, G.
    In this paper we propose a method to generate mixed-element meshes (tetrahedra, triangular prisms, square pyramids) for B-Rep models. The vertices, edges, facets, and cells of the final volumetric mesh are determined from the combinatorial analysis of the intersections between the model components and the Voronoi diagram of sites distributed to sample the model. Inside the volumetric regions, Delaunay tetrahedra dual of the Voronoi diagram are built. Where the intersections of the Voronoi cells with the model surfaces have a unique connected component, tetrahedra are modified to fit the input triangulated surfaces. Where these intersections are more complicated, a correspondence between the elements of the Voronoi diagram and the elements of the mixedelement mesh is used to build the final volumetric mesh. The method which was motivated by meshing challenges encountered in geological modeling is demonstrated on several 3D synthetic models of subsurface rock volumes.
  • Thumbnail Image
    Item
    On Tetrahedralisations Containing Knotted and Linked Line Segments
    (Amsterdam [u.a.] : Elsevier, 2017) Si, Hang; Ren, Yuxue; Lei, Na; Gu, Xianfeng
    This paper considers a set of twisted line segments in 3d such that they form a knot (a closed curve) or a link of two closed curves. Such line segments appear on the boundary of a family of 3d indecomposable polyhedra (like the Schönhardt polyhedron) whose interior cannot be tetrahedralised without additional vertices added. On the other hand, a 3d (non-convex) polyhedron whose boundary contains such line segments may still be decomposable as long as the twist is not too large. It is therefore interesting to consider the question: when there exists a tetrahedralisation contains a given set of knotted or linked line segments? In this paper, we studied a simplified question with the assumption that all vertices of the line segments are in convex position. It is straightforward to show that no tetrahedralisation of 6 vertices (the three-line-segments case) can contain a trefoil knot. Things become interesting when the number of line segments increases. Since it is necessary to create new interior edges to form a tetrahedralisation. We provided a detailed analysis for the case of a set of 4 line segments. This leads to a crucial condition on the orientation of pairs of new interior edges which determines whether this set is decomposable or not. We then prove a new theorem about the decomposability for a set of n (n ≥ 3) knotted or linked line segments. This theorem implies that the family of polyhedra generalised from the Schonhardt polyhedron by Rambau [1] are all indecomposable.
  • Thumbnail Image
    Item
    On Tetrahedralisations of Reduced Chazelle Polyhedra with Interior Steiner Points
    (Amsterdam [u.a.] : Elsevier, 2016) Si, Hang; Goerigk, Nadja
    The non-convex polyhedron constructed by Chazelle, known as the Chazelle polyhedron [4], establishes a quadratic lower bound on the minimum number of convex pieces for the 3d polyhedron partitioning problem. In this paper, we study the problem of tetrahedralising the Chazelle polyhedron without modifying its exterior boundary. It is motivated by a crucial step in tetrahedral mesh generation in which a set of arbitrary constraints (edges or faces) need to be entirely preserved. The goal of this study is to gain more knowledge about the family of 3d indecomposable polyhedra which needs additional points, so-called Steiner points, to be tetrahedralised. The requirement of only using interior Steiner points for the Chazelle polyhedron is extremely challenging. We first “cut off” the volume of the Chazelle polyhedron by removing the regions that are tetrahedralisable. This leads to a 3d non-convex polyhedron whose vertices are all in the two slightly shifted saddle surfaces which are used to construct the Chazelle polyhedron. We call it the reduced Chazelle polyhedron. It is an indecomposable polyhedron. We then give a set of (N + 1)2 interior Steiner points that ensures the existence of a tetrahedralisation of the reduced Chazelle polyhedron with 4(N + 1) vertices. The proof is done by transforming a 3d tetrahedralisation problem into a 2d edge flip problem. In particular, we design an edge splitting and flipping algorithm and prove that it gives to a tetrahedralisation of the reduced Chazelle polyhedron.
  • Thumbnail Image
    Item
    Preface
    (Amsterdam [u.a.] : Elsevier, 2016) Canann, Scott; Owen, Steven; Si, Hang
    [No abstract available]
  • Thumbnail Image
    Item
    Generalized Regular Quadrilateral Mesh Generation based on Surface Foliation
    (Amsterdam [u.a.] : Elsevier, 2017) Lei, Na; Zheng, Xiaopeng; Si, Hang; Luo, Zhongxuan; Gu, Xianfeng
    This work introduces a novel algorithm for quad-mesh generation based on surface foliation theory. The algorithm is based on the equivalence among colorable quad-meshes, measure foliations and holomorphic differentials. The holomorphic differentials can be obtained by graph-valued harmonic maps. The algorithm has several merits: it can be applied for surfaces with general topologies; the resulting quad-meshes have global tensor product structure and the least number of singularities; the algorithmic pipeline is fully automatic. The experimental results demonstrate the efficiency and efficacy of the proposed method.
  • Thumbnail Image
    Item
    Scattering matrices and Dirichlet-to-Neumann maps
    (Amsterdam [u.a.] : Elsevier, 2017) Behrndt, Jussi; Malamud, Mark M.; Neidhardt, Hagen
    A general representation formula for the scattering matrix of a scattering system consisting of two self-adjoint operators in terms of an abstract operator valued Titchmarsh–Weyl m-function is proved. This result is applied to scattering problems for different self-adjoint realizations of Schrödinger operators on unbounded domains, Schrödinger operators with singular potentials supported on hypersurfaces, and orthogonal couplings of Schrödinger operators. In these applications the scattering matrix is expressed in an explicit form with the help of Dirichlet-to-Neumann maps.
  • Thumbnail Image
    Item
    Guaranteed quality isotropic surface remeshing based on uniformization
    (Amsterdam [u.a.] : Elsevier, 2017) Ma, Ming; Yu, Xiaokang; Lei, Na; Si, Hang; Gu, Xianfeng
    Surface remeshing plays a significant role in computer graphics and visualization. Numerous surface remeshing methods have been developed to produce high quality meshes. Generally, the mesh quality is improved in terms of vertex sampling, regularity, triangle size and triangle shape. Many of such surface remeshing methods are based on Delaunay refinement. In particular, some surface remeshing methods generate high quality meshes by performing the planar Delaunay refinement on the conformal uniformization domain. However, most of these methods can only handle topological disks. Even though some methods can cope with high-genus surfaces, they require partitioning a high-genus surface into multiple simply connected segments, and remesh each segment in the parameterized domain. In this work, we propose a novel surface remeshing method based on uniformization theorem using dynamic discrete Yamabe flow and Delaunay refinement, which is capable of handling surfaces with complicated topologies, without the need of partitioning. The proposed method has the following merits: Dimension deduction, it converts all 3D surface remeshing to 2D planar meshing; Theoretic rigor, the existence of the constant curvature measures and the lower bound of the corner angles of the generated meshes can be proven. Experimental results demonstrate the efficiency and efficacy of our proposed method.
  • Thumbnail Image
    Item
    A rough path perspective on renormalization
    (Amsterdam [u.a.] : Elsevier, 2019) Bruned, Y.; Chevyrev, I.; Friz, P.K.; Preiß, R.
    We develop the algebraic theory of rough path translation. Particular attention is given to the case of branched rough paths, whose underlying algebraic structure (Connes-Kreimer, Grossman-Larson) makes it a useful model case of a regularity structure in the sense of Hairer. Pre-Lie structures are seen to play a fundamental rule which allow a direct understanding of the translated (i.e. renormalized) equation under consideration. This construction is also novel with regard to the algebraic renormalization theory for regularity structures due to Bruned–Hairer–Zambotti (2016), the links with which are discussed in detail. © 2019 The Author(s)