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

In 1998 Land Information New Zealand introduced New Zealand Geodetic Datum 2000 (NZGD2000) as its new national datum. It is defined as a semi-dynamic datum and incorporates a national deformation model to ensure that the accuracy of the datum is maintained. The deformation model allows observations made at an epoch other than the datum reference epoch of 2000.0 to be modeled so that coordinates...

‎A tree containing exactly two non-pendant vertices is called a double-star‎. ‎Let $k_1$ and $k_2$ be two positive integers‎. ‎The double-star with degree sequence $(k_1+1‎, ‎k_2+1‎, ‎1‎, ‎ldots‎, ‎1)$ is denoted by $S_{k_1‎, ‎k_2}$‎. ‎It is known that a cubic graph has an $S_{1,1}$-decomposition if and only if it contains a perfect matching‎. ‎In this paper‎, ‎we study the $S_{1,2}$-decomposit...

We present a rupture model of the Northridge earthquake, determined from the joint inversion of near-source strong ground motion recordings, P and SH teleseismic body waves, Global Positioning System (GPS) displacement vectors, and permanent uplift measured along leveling lines. The fault is defined to strike 122 ° and dip 40 ° to the south-southwest. The average rake vector is determined to be...

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

In 2006 Barát and Thomassen conjectured that every planar 4-edge-connected 4-regular simple graph of size divisible by three admits a claw-decomposition. Later, Lai (2007) disproved this conjecture family graphs with edge-connectivity 4 which the smallest one contains 24 vertices. note, we first give smaller counterexample having only 18 vertices next construct 4-connected essentially 6-edge-co...