Many obsolete coordinate systems used in the past have fallen into disuse. However, the contents of historical documents still refer to these obsolete coordinates and thus translation systems are important in locating historical events. We present a specialized Linked Open Data API constructed to translate obsolete British Trench Map coordinates from the Great War into modern WGS84 coordinates....

[1] Variations in fluid loads such as the oceans and the atmosphere deform the surface of the Earth. The accuracy of station coordinates, in particular, heights, that can be estimated depends on how well one can separate these surface deformations from the associated translational motion between the center of mass of the solid Earth and the total Earth (CM). We applied simulated atmospheric pre...

This paper presents a constrained connected automated vehicles (CAVs) trajectory optimization method on curved roads with infrastructure assistance. Specifically, this systematically formulates problems in spatial domain and curvilinear coordinate. As an alternative of temporal Cartesian coordinate formulation, our formulation provides the flexibility to describe complex road geometries, traffi...

Abstract For a few years now, GNSS multi-frequency quadrifilar helix antennas (QHA) are available to be used for precise applications. We performed test measurements with two types of QHA and compared them geodetic patch antenna. Although code carrier phase noise high-frequent multipath was determined larger as the antenna, fast-static horizontal coordinate accuracies on same level demonstrate ...

This contribution reviews a few basic concepts of optimization and design of a geodetic network. Proper assessment and analysis of networks is an important task in many geodetic-surveying projects. Appropriate quality-control measures should be defined, and an optimal design should be sought. The quality of a geodetic network is characterized by precision, reliability, and cost. The aim is to p...

Geodetic numbers of graphs and digraphs have been investigated in the literature recently. The main purpose of this paper is to study the geodetic spectrum of a graph. For any two vertices u and v in an oriented graph D, a u–v geodesic is a shortest directed path from u to v. Let I (u, v) denote the set of all vertices lying on a u–v geodesic. For a vertex subset A, let I (A) denote the union o...

Given a simple connected graph G = (V, E) the geodetic closure I[S] ⊂ V of a subset S of V is the union of all sets of nodes lying on some geodesic (or shortest path) joining a pair of nodes vk, vl ∈ S. The geodetic number, denoted by g(G), is the smallest cardinality of a node set S∗ such that I[S∗] = V . In “The geodetic number of a graph”, Mathematical and Computer Modelling 17 (June 1993) 8...

This paper describes a new approach to the problem of generating the class of all geodetic graphs homeomorphic to a given geodetic one. An algorithmic procedure is elaborated to carry out a systematic finding of such a class of graphs. As a result, the enumeration of the class of geodetic graphs homeomorphic to certain Moore graphs has been performed.