**Are you an EPFL student looking for a semester project?**

Work with us on data science and visualisation projects, and deploy your project as an app on top of GraphSearch.

Lecture# Level Control: Adjustment and Error Elimination

Description

This lecture covers the concept of level control, focusing on the adjustment process to eliminate errors. The instructor explains the importance of equal spans and the sighting axis in achieving accurate measurements. Geomatics elements are introduced to detect and correct faults in level adjustment, ensuring the necessary precision before any measurement operation.

Login to watch the video

Official source

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

In course

In MOOC

Related concepts (7)

ENV-140: Fundamentals of geomatics

Bases de la géomatique pour les ingénieurs civil et en environnement. Présentation des méthodes d'acquisition, de gestion et de représentation des géodonnées. Apprentissage pratique avec des méthodes

Elements of Geomatics

Ce cours de base en géomatique présente les concepts et méthodes d’acquisition, de gestion et de représentation des géodonnées. Il inclut les bases de topométrie, géodésie et cartographie, avec un acc

Minimum spanning tree

A minimum spanning tree (MST) or minimum weight spanning tree is a subset of the edges of a connected, edge-weighted undirected graph that connects all the vertices together, without any cycles and with the minimum possible total edge weight. That is, it is a spanning tree whose sum of edge weights is as small as possible. More generally, any edge-weighted undirected graph (not necessarily connected) has a minimum spanning forest, which is a union of the minimum spanning trees for its connected components.

Spanning tree

In the mathematical field of graph theory, a spanning tree T of an undirected graph G is a subgraph that is a tree which includes all of the vertices of G. In general, a graph may have several spanning trees, but a graph that is not connected will not contain a spanning tree (see about spanning forests below). If all of the edges of G are also edges of a spanning tree T of G, then G is a tree and is identical to T (that is, a tree has a unique spanning tree and it is itself).

Euclidean minimum spanning tree

A Euclidean minimum spanning tree of a finite set of points in the Euclidean plane or higher-dimensional Euclidean space connects the points by a system of line segments with the points as endpoints, minimizing the total length of the segments. In it, any two points can reach each other along a path through the line segments. It can be found as the minimum spanning tree of a complete graph with the points as vertices and the Euclidean distances between points as edge weights.

Iron sights

Iron sights are a system of physical alignment markers (usually made of metallic material) used as a sighting device to assist the accurate aiming of ranged weapons (such as a firearm, airgun, crossbow and compound bow), or less commonly as a primitive finder sight for optical telescopes. The earliest sighting device, it relies completely on the viewer's naked eye (mostly under ambient lighting), and is distinctly different to optical sights such as telescopic sights, reflector (reflex) sights, holographic sights and laser sights, which make use of optical manipulation and/or active illumination.

Reflector sight

A reflector sight or reflex sight is an optical sight that allows the user to look through a partially reflecting glass element and see an illuminated projection of an aiming point or some other image superimposed on the field of view. These sights work on the simple optical principle that anything at the focus of a lens or curved mirror (such as an illuminated reticle) will appear to be sitting in front of the viewer at infinity.

Instructors (3)