For a non-trivial connected graph G, a set S ⊆ V (G) is called an edge geodetic set of G if every edge of G is contained in a geodesic joining some pair of vertices in S. The edge geodetic number g1(G) of G is the minimum order of its edge geodetic sets and any edge geodetic set of order g1(G) is an edge geodetic basis. A connected edge geodetic set of G is an edge geodetic set S such that the ...

Ray-triangle intersection is a crucial calculation in ray tracing. We present a new algorithm for finding these intersections, occupying a different place in the spectrum of time-space tradeoffs than existing algorithms do. Our algorithm provides faster ray-triangle intersection calculations at the expense of precomputing and storing a small amount of extra information for each triangle. Runnin...

We extend the transformation-optics paradigm to a complex spatial coordinate domain, in order to deal with electromagnetic metamaterials characterized by balanced loss and gain, giving special emphasis to parity-time (PT) symmetric metamaterials. We apply this general theory to complex-source-point radiation and anisotropic transmission resonances, illustrating the capability and potentials of ...

We extend the transformation-optics paradigm to a complex spatial coordinate domain, in order to deal with electromagnetic metamaterials characterized by balanced loss and gain, giving special emphasis to parity-time (PT) symmetric metamaterials. We apply this general theory to complex-source-point radiation and anisotropic transmission resonances, illustrating the capability and potentials of ...

A coordinate transformation framework for understanding how neurons compute sensorimotor behaviors has generated significant advances toward our understanding of basic brain function. This influential scaffold focuses on neuronal encoding of spatial information represented in different coordinate systems (e.g., eye-centered, hand-centered) and how multiple brain regions partake in transforming ...

A set S of vertices of a connected graph G is a geodetic set if every vertex of G lies on an x−y geodesic for some elements x and y in S. The minimum cardinality of a geodetic set ofG is the geodetic number ofG, denoted by g(G). A set S of vertices of a graph G is an edge geodetic set if every edge of G lies on an x − y geodesic for some elements x and y in S. The minimum cardinality of an edge...

With the implementation of India’s new map policy user community is looking towards a transformation in the spatial database (from Everest 1830 ellipsoid, Polyconic projection system to WGS 84 ellipsoid, UTM projection system). To bring them on same platform, problem of existence of different transformation parameters has to be dealt with, since due to unavailability of such data from Survey of...

The non-orthogonal boundary-fitted coordinate transformation method is applied to the solution of steady three-dimensional conservation equations of mass, momentum, energy and speciescontinuity to obtain the laminar velocity, temperature and concentration fields for simulation of polymerization of styrene in arbitrary cross-sectional duct reactors. Variable physical properties (except for speci...

a subset $s$ of vertices in a graph $g$ is called a geodetic set if every vertex not in $s$ lies on a shortest path between two vertices from $s$‎. ‎a subset $d$ of vertices in $g$ is called dominating set if every vertex not in $d$ has at least one neighbor in $d$‎. ‎a geodetic dominating set $s$ is both a geodetic and a dominating set‎. ‎the geodetic (domination‎, ‎geodetic domination) number...

A set S of vertices of a graph G is a geodetic set if every vertex of G lies in at least one interval between the vertices of S. The size of a minimum geodetic set in G is the geodetic number of G. Upper bounds for the geodetic number of Cartesian product graphs are proved and for several classes exact values are obtained. It is proved that many metrically defined sets in Cartesian products hav...