We present a novel clustering algorithm for polygonal meshes which approximates a Centroidal Voronoi Diagram construction. The clustering provides an efficient way to construct uniform tessellations, and therefore leads to uniform coarsening of polygonal meshes, when the output triangulation has many fewer elements than the input mesh. The mesh topology is also simplified by the clustering algo...

— It is shown here that, for any finitely generated lattice r in certain semi simple groups over local fields of positive characteristics, H (r. Ad) is nonvanishing; this is in sharp contrast with the situation in characteristic zero. Let Kbe a local field (i. e. a non-discrete locally compact field), and let G be a connected semi simple algebraic group defined over K. Let G = G (K), and let r ...

The Mcube network has been proposed in [11] as a highly recursive and symmetrical interconnection network based on twisted links [1]. The Mcube topology has been developed and defined in terms of the structural constraints between components to enforce structural symmetry instead of specifying edges between node pairs. Mcubes have almost half the diameter of a comparable hypercube, a lower aver...

Thermal transducers, which can be interpreted as thermally actuated compliant mechanisms, have found a wide range of applications, due to the reason of accessible source, easy controllability and reliability. During the past decade topology optimization techniques have been developed as efficient tools to design distributed type of complaint mechanisms. The generated results have been accepted ...

In topology-based localization, each node in a network computes its hop-count distance to a finite number of reference nodes, or “landmarks”. This paper studies the impact of landmark placement on the accuracy of the resulting coordinate systems. The coordinates of each node are given by the hop-count distance to the landmarks. We show analytically that placing landmarks on the boundary of the ...

We apply methods from algebraic geometry to study uniform matrix product states. Our main results concern the topology of locus tensors expressed as uMPS, their defining equations and identifiability. By an interplay theorems algebra, quantum physics we answer several questions conjectures posed by Critch, Morton Hackbusch.

Fast Relabeling of Deformable Delaunay Tetrahedral Meshes Using a Compact Uniform Grid David C. Frogley Department of Computer Science, BYU Master of Science We address the problem of fast relabeling of deformable Delaunay tetrahedral meshes using a compact uniform grid, with CPU parallelization through OpenMP. This problem is important in visualizing the simulation of deformable objects and ar...

In this paper, a rational Bézier surface is proposed as a uniform approach to modeling all three types of molecular surfaces (MS): the van der Waals surface (vdWS), solvent accessible surface (SAS) and solvent excluded surface (SES). Each molecular surface can be divided into molecular patches, which can be defined by their boundary arcs. The solution consists of three steps: topology modeling,...

where 0 ≤ s ≤ t ≤ 1 and ⊗ denotes a tensor product. Lyons [17] proved that solutions of stochastic differential equations (SDEs) are continuous functions of the Brownian rough path w(s, t) = ( w(s, t)1, w(s, t)2). We give a precise definition of the Brownian rough path in the next section; see also [18] and [15]. The discontinuity of solutions of SDEs in the uniform convergence topology of w ca...

We extend the notion of localic completion of generalised metric spaces by Steven Vickers to the setting of generalised uniform spaces. A generalised uniform space (gus) is a set X equipped with a family of generalised metrics on X, where a generalised metric on X is a map from X ×X to the upper reals satisfying zero self-distance law and triangle inequality. For a symmetric generalised uniform...