On shape Delaunay tessellations
نویسندگان
چکیده
Shape Delaunay tessellations are a generalization of the classical Delaunay triangulation of a finite set of points in the plane, where the empty circle condition is replaced by emptiness of an arbitrary convex compact shape. We present some new and basic properties of shape Delaunay tessellations, concerning flipping, subgraph structures, and recognition.
منابع مشابه
Parallel algorithms for planar and spherical Delaunay construction with an application to centroidal Voronoi tessellations
A new algorithm, featuring overlapping domain decompositions, for the parallel construction of Delaunay and Voronoi tessellations is developed. Overlapping allows for the seamless stitching of the partial pieces of the global Delaunay tessellations constructed by individual processors. The algorithm is then modified, by the addition of stereographic projections, to handle the parallel construct...
متن کاملA systematic review of algorithms with linear-time behaviour to generate Delaunay and Voronoi tessellations
Triangulations and tetrahedrizations are important geometrical discretization procedures applied to several areas, such as the reconstruction of surfaces and data visualization. Delaunay and Voronoi tessellations are discretization structures of domains with desirable geometrical properties. In this work, a systematic review of algorithms with linear-time behaviour to generate 2D/3D Delaunay an...
متن کاملLarge Cells in Poisson-Delaunay Tessellations
It is proved that the shape of the typical cell of a Delaunay tessellation, derived from a stationary Poisson point process in d-dimensional Euclidean space, tends to the shape of a regular simplex, given that the volume of the typical cell tends to infinity. This follows from an estimate for the probability that the typical cell deviates by a given amount from regularity, given that its volume...
متن کاملStudy on Delaunay tessellations of 1-irregular cuboids for 3D mixed element meshes
Mixed elements meshes based on the modified octree approach contain several co-spherical point configurations. While generating Delaunay tessellations to be used together with the finite volume method, it is not necessary to partition them into tetrahedra; co-spherical elements can be used as final elements. This paper presents a study of all co-spherical elements that appear while tessellating...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 114 شماره
صفحات -
تاریخ انتشار 2014