elib
DLR-Header
DLR-Logo -> http://www.dlr.de
DLR Portal Home | Imprint | Privacy Policy | Contact | Deutsch
Fontsize: [-] Text [+]

Efficient Localization Of Points In A Set Of Concave Polyhedra

Glatzl, Philipp (2009) Efficient Localization Of Points In A Set Of Concave Polyhedra. Master's.

[img]
Preview
PDF
2MB

Abstract

Within this Master thesis, a software has been developed that is capable of performing an efficient aircraft localization to the ATC-sector it is currently located at. For this purpose, this thesis contains a chapter about spherical trigonometry, as aircraft should be localized on the earth surface. Particularly the subject of spherical triangles is important to assure the possibility for geometric calculation on a sphere. Another major focus is on point localization, which handles an aircraft as a point and an ATC-sector as polygon respectively polyhedron.

Item URL in elib:https://elib.dlr.de/58777/
Document Type:Thesis (Master's)
Title:Efficient Localization Of Points In A Set Of Concave Polyhedra
Authors:
AuthorsInstitution or Email of AuthorsAuthor's ORCID iDORCID Put Code
Glatzl, PhilippUNSPECIFIEDUNSPECIFIEDUNSPECIFIED
Date:30 April 2009
Open Access:Yes
Number of Pages:115
Status:Published
Keywords:Aicraft, Localization, Sectors
Department:Institut für Informatik, Universität Innsbruck
HGF - Research field:Aeronautics, Space and Transport
HGF - Program:Aeronautics
HGF - Program Themes:ATM and Operation (old)
DLR - Research area:Aeronautics
DLR - Program:L AO - Air Traffic Management and Operation
DLR - Research theme (Project):L - Effiziente Flugführung und Flugbetrieb (old)
Location: Oberpfaffenhofen
Institutes and Institutions:Institute of Communication and Navigation > Communications Systems
Deposited By: Bauer, Christian
Deposited On:24 Jun 2009 08:11
Last Modified:31 Jul 2019 19:24

Repository Staff Only: item control page

Browse
Search
Help & Contact
Information
electronic library is running on EPrints 3.3.12
Website and database design: Copyright © German Aerospace Center (DLR). All rights reserved.