Dagstuhl-seminar 01121, ''computational Geometry'' Three-dimensional Mesh Generation for Domains with Small Angles a Separation Bound for Real Algebraic Expressions

نویسنده

  • Rolf Klein
چکیده

51 participants attended this meeting. As in previous Dagstuhl seminars about Computational Geometry, the exchange of ideas and information about the latest developments in the fields of computational and combinatorial geometry was the main purpose of this meeting. In addition, there was a focus on a few topics on individual days of the meeting, featuring longer keynote talks as well as more technical contributions:

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quadtree and Octree Grid Generation

Engineering analysis often involves the accurate numerical solution of boundary value problems in discrete form. Hierarchical quadtree (or octree) grid generation offers an efficient method for the spatial discretisation of arbitrary-shaped two- (or three-) dimensional domains. It consists of recursive algebraic splitting of sub-domains into quadrants (or cubes), leading to an ordered hierarchi...

متن کامل

Report from Dagstuhl Seminar 17072 Applications of Topology to the Analysis of 1 - Dimensional

This report documents the program and the outcomes of Dagstuhl Seminar 17072 “Applications of Topology to the Analysis of 1-Dimensional Objects”. Seminar February 12–17, 2017 – http://www.dagstuhl.de/17072 1998 ACM Subject Classification I.3.5 Computational Geometry and Object Modeling

متن کامل

Three-Dimensional Delaunay Mesh Generation

We propose an algorithm to compute a conforming Delaunay mesh of a bounded domain specified by a piecewise linear complex. Arbitrarily small input angles are allowed, and the input complex is not required to be a manifold. Our algorithm encloses the input edges with a small buffer zone, a union of balls whose sizes are proportional to the local feature sizes at their centers. In the output mesh...

متن کامل

Delaunay refinement algorithms for triangular mesh generation

Delaunay refinement is a technique for generating unstructured meshes of triangles for use in interpolation, the finite element method, and the finite volume method. In theory and practice, meshes produced by Delaunay refinement satisfy guaranteed bounds on angles, edge lengths, the number of triangles, and the grading of triangles from small to large sizes. This article presents an intuitive f...

متن کامل

A mesh generation procedure to simulate bimaterials

It is difficult to develop an algorithm which is able to generate the appropriate mesh around the interfaces in bimaterials. In this study, a corresponding algorithm is proposed for this class of unified structures made from different materials with arbitrary shapes. The non-uniform mesh is generated adaptively based on advancing front technique available in Abaqus software. Implementing severa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008