Q-Tran is a new indirect algorithm to transform triangular tessellation of bounded three-dimensional surfaces into all-quadrilateral meshes. The proposed method is simple, fast and produces quadrilaterals with provablygood quality and hence it does not require a smoothing post-processing step. The method is capable of identifying and recovering structured regions in the input tessellation. The ...

In this work, we introduce a new scheme to extract hierarchical isocontours from regular and irregular 2D sampled data and to encode it at single rate or progressively. A dynamic tessellation is used to represent and adapt the 2D data to the isocontour. This adaptation induces a controlled multi-resolution representation of the isocontour. This representation can then be encoded while controlli...

Delaunay tessellation is applied for the first time in the analysis of protein structure. By representing amino acid residues in protein chains by C alpha atoms, the protein is described as a set of points in three-dimensional space. Delaunay tessellation of a protein structure generates an aggregate of space-filling irregular tetrahedra, or Delaunay simplices. The vertices of each simplex defi...

Surface curvature properties are often as important as surface position in understanding shape. Curvature properties are typically computed at mesh vertices by operating on an associated ring neighbourhood of faces. Such approaches are not well suited to noisy, non-uniformly sampled meshes with irregular tessellations. In this paper, we present a principled approach to curvature estimation that...

We describe the implementation of algorithms to construct and maintain threedimensional dynamic Delaunay triangulations with kinetic vertices using a threesimplex data structure. The code is capable of constructing the geometric dual, the Voronoi or Dirichlet tessellation. Initially, a given list of points is triangulated. Time evolution of the triangulation is not only governed by kinetic vert...

When we map an area or create a digital database for it, the first task is often to partition the space into smaller units. There are traditionally two methods of partitioning: vector and raster. A vector partition delineates the boundary of features by polylines while a raster partition subdivides the space into a regular matrix of square or rectangular pixels. These two are complementary meth...

In this paper, we present a fast and efficient mesh coarsening algorithm for 3D triangular meshes. Theis approach can be applied to very complex 3D meshes of arbitrary topology and with millions of vertices. The algorithm is based on the clustering of the input mesh elements, which divides the faces of an input mesh into a given number of clusters for clustering purpose by approximating the Cen...

This paper presents a computational framework for modelling the fracture process in concrete under static and dynamic tensile loading considering its mesostructural characteristics. 3D mesostructure of composed real-shape coarse aggregates, mortar, interfacial transition zone between them voids was developed using an in-house code based on Voronoi tessellation splining techniques. Cohesive mode...

Computer-aided design of porous structures is a challenging task because of the high degree of irregularity and intricacy associated with the geometries. Most of the existing design approaches either target designing artifacts with regular-shaped pores or reconstructing geometric models from existing porous objects. For regular porous structures, it is difficult to control the pore shapes and d...