There are many occasions when the use of a uniform spatial grid would be prohibitively expensive for the numerical solution of partial differential equations (PDEs). In such situations, a popular strategy is to generate an adaptive mesh by either varying the number of mesh points, the order of the numerical method, or the location of mesh points throughout the domain, in order to best resolve t...

The algorithm may be programmed without multiplication or division instructions and is eficient with respect to speed of execution and memory utilization. This paper describes an algorithm for computer control of a type of digital plotter that is now in common use with digital computers .' The plotter under consideration is capable of executing, in response to an appropriate pulse, any one of t...

The goal of this project is to create a quality unstructured mesh generation tool. To this end, we have developed a C++ code that combines unconstrained Delaunay triangulation with spring dynamics in order to achieve a high-quality mesh. Our code will be made publicly available as part of the RedPack software package. As a test of this code, we consider in this paper the problem of generating a...

Platelet-rich plasma (PRP) has an important role in musculoskeletal surgery; however, it has been underutilized for accelerating the healing of abdominal wall defects in veterinary practice. Therefore, the aim of this study was to evaluate the use of commercial polyester/cotton fabric (Damour) as a new composite mesh for the repair of experimentally induced abdominal wall defects in canine mode...

To compute an approximation solution to this problem, we define a discrete mesh of points (xi; yj) on which we will approximate u. To keep things simple, we will assume that the mesh is uniformly spaced in both the x and y directions, and that the distance between adjancent mesh points is h. That is, xi+1 xi = h and yj+1 yj = h. We can then use a simple centered-difference approximation to the ...

A method for the extraction of the Extended Reeb Graph (ERG) from a closed 3D triangular mesh is presented. The ERG codes the relationships among critical points of the height function associated to the mesh, and it can represent isolated as well as degenerate critical points. The extraction process is based on a re-meshing strategy of the original mesh, which is forced to follow contour levels...

Polygonal meshes are used extensively in computer graphics. A polygonal mesh represents a shape, usually in 3D, by using a set of points, the vertices, connected by edges. Edges form the boundaries of faces. A mesh is convenient to work with because it explicitly represents the surface that one is working with—vertices, edges, and faces are discreetly enumerated and may be manipulated directly....

Multiresolution models support the interactive visualization of large volumetric data through selective refinement, an operation which permits to focus resolution only on the most relevant portions of the domain, or in the proximity of interesting field values. A 3D Multi-Tessellation (MT) is a multiresolution model, consisting of a coarse tetrahedral mesh at low resolution, and of a set of upd...

A stereoscopic family of permutations maps an mdimensional mesh into several 1-dimensional lines, in a way that jointly preserves distance information. Specifically, consider any two points and denote their distance on the m-dimensional mesh by d. Then the distance between their images, on the line on which these images are closest together, is O(dm). We initiate a systematic study of stereosco...

A bstract-In this paper, we present parallel algorithms to identifv (i.e., detect and enumerate) the extreme points of the convex hull of a set of planar points using a hypercube, pyramid, tree, mesh-of-trees, mesh with reconfigurable bus, EREW PRAM, and a modified AKS network. It is known that the problem of identifying the convex hull for a set of planar points given arbitrarily cannot be sol...