In this work, simulations with scalene triangle meshes represented by a recently proposed graphbased adaptive mesh refinement technique are described. Previously, simulations exclusively with isosceles right triangles were presented with this graph-based scheme. This data structure represents triangular meshes in finite-volume discretizations in order to solve second-order partial differential ...

In this paper we present an approximation algorithm for solving the following optimal motion planning problem: Given a planar space composed of triangular regions , each of which is associated with a positive unit weight, and two points s and t, nd a path from s to t with the minimum weight, where the weight of a path is deened to be the weighted sum of the lengths of the sub-paths within each ...

Gold circular sector-like nanoantennas (with a radius of 500 nm and a taper angle of 60°, 90°, and 120°) on glass are investigated in a near-infrared wavelength range (900 - 2100 nm). Amplitude- and phase-resolved near-field images of circular sector-like antenna modes at telecom wavelength feature a concentric circular line of phase contrast, demonstrating resonant excitation of a standing wav...

in this paper, we introduce the concept of the   generalized aip-rings as a generalization of the generalized quasi-   baer rings   and generalized p.p.-rings. we show that the class of the generalized aip-rings is closed under direct products and morita invariance. we also characterize the 2-by-2 formal upper triangular matrix rings of this new class of rings. finally, we provide sever...

A graph is balanced if its clique-vertex incidence matrix is balanced, i.e., it does not contain a square submatrix of odd order with exactly two ones per row and per column. Interval graphs, obtained as intersection graphs of intervals of a line, are well-known examples of balanced graphs. A circular-arc graph is the intersection graph of a family of arcs on a circle. Circular-arc graphs gener...