A set of vertices S in a graph is called geodetic if every vertex of this graph lies on some shortest path between two vertices from S. In this paper, minimum geodetic sets in median graphs are studied with respect to the operation of peripheral expansion. Along the way geodetic sets of median prisms are considered and median graphs that possess a geodetic set of size two are characterized. © 2...

Precise Point Positioning (PPP) makes use of the undifferenced pseudorange and carrier phase measurements with ionospheric-free (IF) combinations to achieve centimeter-level positioning accuracy. Conventionally, the IF ambiguities are estimated as float values. To improve the PPP positioning accuracy and shorten the convergence time, the integer phase clock model with between-satellites single-...

Location-based online collaborative platforms are proving to be an effective and widely adopted solution for geospatial data collection, update and sharing. Popular collaborative projects like OpenStreetMap, Wikimapia and other services that collect and publish user-generated geographic contents have been fostered by the increasing availability of location-aware palmtop devices. These instrumen...

From flat Earth, to round Earth, to a rough and oblate Earth, people's understanding of the shape of our planet and its landscapes has changed dramatically over the course of history. These advances in geodesy— the study of Earth's size, shape, orientation, and gravitational field, and the variations of these quantities over time—developed because of humans' curiosity about the Earth and becaus...

A set S of vertices of a connected graph G is convex, if for any pair of vertices u, v ∈ S , every shortest path joining u and v is contained in S . The convex hull CH(S ) of a set of vertices S is defined as the smallest convex set in G containing S . The set S is geodetic, if every vertex of G lies on some shortest path joining two vertices in S, and it is said to be a hull set if its convex ...

W e consider the rational linear relations between real numbers whose squared trigonometric functions have rational values, angles we call “geodetic.” We construct a convenient basis for the vector space over generated by these angles. Geodetic angles and rational linear combinations of geodetic angles appear naturally in Euclidean geometry; for illustration we apply our results to equidecompos...

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...