Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Developing New National Geodetic Reference Frame of Nepal
View through CrossRef
Geodetic reference frame is fundamental geodetic infrastructure required for positioning for surveying and mapping purposes. This paper presents a method to develop national level geodetic reference frame tied to global reference frame by utilizing the long-term GNSS observations. The key to realize a national reference frame is to transform Earth-Centered Earth-Fixed (ECEF) X, Y, and Z coordinates from International Terrestrial Reference Frame (ITRF) to national reference frame is by application of 14-Helmert transformation parameters. Initially, precise point positioning (PPP) provides the X, Y, and Z coordinates of reference stations with respect to ITRF, which in turn transformed to national geodetic reference frame. This paper discusses the development of 14-Helmert transformation parameter taking example of Nepal geodetic reference frame being built in near future.
Title: Developing New National Geodetic Reference Frame of Nepal
Description:
Geodetic reference frame is fundamental geodetic infrastructure required for positioning for surveying and mapping purposes.
This paper presents a method to develop national level geodetic reference frame tied to global reference frame by utilizing the long-term GNSS observations.
The key to realize a national reference frame is to transform Earth-Centered Earth-Fixed (ECEF) X, Y, and Z coordinates from International Terrestrial Reference Frame (ITRF) to national reference frame is by application of 14-Helmert transformation parameters.
Initially, precise point positioning (PPP) provides the X, Y, and Z coordinates of reference stations with respect to ITRF, which in turn transformed to national geodetic reference frame.
This paper discusses the development of 14-Helmert transformation parameter taking example of Nepal geodetic reference frame being built in near future.
Related Results
The upper connected edge geodetic number of a graph
The upper connected edge geodetic number of a graph
For a non-trivial connected graph G, a set S ? V (G) is called an edge
geodetic set of G if every edge of G is contained in a geodesic joining some
pair of vertices in S. The...
On the modernization of National Geodetic Network with GNSS CORS Reference Frame
On the modernization of National Geodetic Network with GNSS CORS Reference Frame
New technical developments, growing applications and requests for higher accuracy in georeferencing of national reference frame raise a demand on high accuracy National Terrestrial...
Дистанційне зондування як ефективний інструмент проєктування доріг
Дистанційне зондування як ефективний інструмент проєктування доріг
The subject of this study is the process of engineering and geodetic surveys for developing road projects. The purpose of this article is to improve the efficiency of the process o...
Connected Geodetic Global Domination Number of a
Graph
Connected Geodetic Global Domination Number of a
Graph
A set S of vertices in a connected graph {G=(V,E)} is called a geodetic set if
every vertex not in S lies on a shortest path between two vertices from S. A set D of vertices in G i...
The Connected Geodetic Global Domination Number of
a Graph
The Connected Geodetic Global Domination Number of
a Graph
A set S of vertices in a connected graph {G=(V,E)} is called a geodetic set if
every vertex not in S lies on a shortest path between two vertices from S. A set D of vertices in G i...
Astronomy And Gravity Surveying In Nepal
Astronomy And Gravity Surveying In Nepal
Astronomical observations and gravity measurements were carried out in Nepal along the boundary since 1800. They are very important due to high deflection of verticals with irregul...
Geodetic sets for directed acyclic planar geodetic graphs
Geodetic sets for directed acyclic planar geodetic graphs
A set of vertices $S$ of a directed graph G is {\em geodetic} if every vertex of G lies on a shortest path from a vertex of S to a vertex of S. A directed graph is geodetic if ther...
On the upper geodetic global domination number of a graph
On the upper geodetic global domination number of a graph
A set S of vertices in a connected graph G = (V, E) is called a geodetic set if every vertex not in S lies on a shortest path between two vertices from S. A set D of vertices in G ...