Google Earth provides an open source, easy to access and cost free image data that support map interest community. Therefore, depending of this community on Google Earth, grows up day by day. More than simply providing locational information, Google Earth allows users to add their own content such as photos or descriptions of areas or landmarks. They can also extrapolate information from the sa...

The establishment of the Croatian National Spatial Data Infrastructure has started at the beginning of the 1990's. The main agitator of the activities was the State Geodetic Administration of the Republic of Croatia. They started to build the documentation that describe vision and goals, while through studies and pilot projects they developed procedures and exact steps for realization of the go...

We show that the geodetic game, introduced by Fraenkel and Harary, is decidable in polynomial time on AT-free graphs.

A k-geodetic digraph G is a digraph in which, for every pair of vertices u and v (not necessarily distinct), there is at most one walk of length ≤ k from u to v. If the diameter of G is k, we say that G is strongly geodetic. Let N(d, k) be the smallest possible order for a k-geodetic digraph of minimum out-degree d, then N(d, k) ≥ 1 + d+ d2 + . . .+ dk = M(d, k), where M(d, k) is the Moore boun...

japan is a region of active plate tectonics, well known for its japanese trench a geological feature evolving as a result of north pacific (np) oceanic plate pushing and sub-ducting underneath the north american (na) plate. multiple plate tectonics have been continuously recorded in the region since 1979 by the network of gps stations called geonet. the network operating and monitoring more tha...

For any two vertices u and v in a graph G (digraph D, respectively), a u-v geodesic is a shortest path between u and v (from u to v, respectively). Let I(u, v) (ID(u, v), respectively) denote the set of all vertices lying on a u-v geodesic. For a vertex subset S, let IG(S) (ID(S), respectively) denote the union of all IG(u, v) (ID(u, v), respectively) for u, v ∈ S. The geodetic number g(G) (g(D...

The computation of geodetic coordinates is the basis surveying and foundation to modern techniques for network analyses design integrated survey schemes monitoring detecting structural deformations. positional accuracy achievable by Direct Indirect models position determination depends on varying lengths, azimuths latitude first point stations. Existing knowledge gaps preclude a comprehensive u...

A recent variation of the classical geodetic problem, the strong geodetic problem, is defined as follows. If G is a graph, then sg(G) is the cardinality of a smallest vertex subset S, such that one can assign a fixed geodesic to each pair {x, y} ⊆ S so that these (|S| 2 ) geodesics cover all the vertices of G. In this paper, the strong geodetic problem is studied on Cartesian product graphs. A ...

A decade of observations in geodetic mode with the VLBA network gave valuable results. Approximately 1/5 of all geodetic observations are recorded in VLBA mode and processed at the Socorro correlator. Ten years of observations allowed us to reliably measure slow intra-plate motion of the VLBA stations located on the North-American plate. It also helped us to achieve scientific objectives of geo...

Future linear accelerators require new survey techniques to achieve the necessary alignment precision. For TESLA, the demanded accuracy for the alignment of the components is 0.5mm horizontal and 0.2mm vertical, both on each 600m section. Other proposed linear colliders require similar accuracies. These demands can not be fulfilled with common, open-air geodetic methods, mainly because of refra...