Abstract In urban areas, the Global Navigation Satellite System (GNSS) can lead to position errors of tens meters due signal obstruction and severe multipath effects. cases 3D-positioning, vertical coordinate is estimated less accurately than are horizontal coordinates. Multisensor systems enhance navigation performance in terms accuracy, availability, continuity integrity. However, addition mu...

A digraph G = (V, E) with diameter D is said to be s-geodetic, for 1 ≤ s ≤ D, if between any pair of (not necessarily different) vertices x, y ∈ V there is at most one x → y path of length ≤ s. Thus, any loopless digraph is at least 1-geodetic. A similar definition applies for a graph G, but in this case the concept is closely related to its girth g, for then G is s-geodetic with s = b(g − 1)/2...

Abstract: The forward intersection method is already widely used in the geodetic survey of coordinates inaccessible points, especially when only angle measurements are available, this case, also called triangulation method. However, mathematical solution 3D with analytical definition spatial lines, resolved by Minimum Distances Method, still not widespread academic and professional environment....

This paper describes about the modeling of errors (like ionospheric delays, atmospheric delays, Troposphericelays, Multipath effects and dilution of precision etc.,) affecting the GPS signals as they travel from satellite to user on Earth. These errors degrade the accuracy of GPS position. An attempt is made to improve the accuracy in locating the GPS receiver by filtering the range measurement...

In this study, the coordinate changes of benchmarks and survey marks after 20.07.2017 (MW:6.6) Bodrum-Kos earthquake were calculated. Post-earthquake GNSS measurements collected on five continuously operating reference stations eight in region. By comparing obtained coordinates with ones before earthquake, deformation occurred geodetic infrastructure was determined maps created. To control resu...

Given a graph G and a subset W ⊆ V (G), a Steiner W -tree is a tree of minimum order that contains all of W . Let S(W ) denote the set of all vertices in G that lie on some Steiner W -tree; we call S(W ) the Steiner interval of W . If S(W ) = V (G), then we call W a Steiner set of G. The minimum order of a Steiner set of G is called the Steiner number of G. Given two vertices u, v in G, a short...

The need to determine accurate heights relative to the North American Vertical Datum of 1988 (NAVD 88) is more prevalent today than ever before. Projects are no longer isolated unto themselves, or designed in a box. Due to global and regional issues such as the environment, and municipal planning, the need to represent the topographic features of the earth accurately in three dimensions is of p...

We study convexity properties of graphs. In this paper we present a linear-time algorithm for the geodetic number in tree-cographs. Settling a 10-year-old conjecture, we prove that the Steiner number is at least the geodetic number in AT-free graphs. Computing a maximal and proper monophonic set in AT-free graphs is NP-complete. We present polynomial algorithms for the monophonic number in perm...