New Algorithm to Speed up the Computation of a Visibility Graph

Publikation: Beitrag in Buch/Bericht/TagungsbandKonferenzbeitrag

Abstract

This poster describes a new algorithm called B# which is needed to find the visibility graph of a polygonal region with obstacles defined by simple polygons. It focuses on finding the entire visibility graph among polygonal obstacles which has been tuned in a variety of test cases. The obstacles are restricted to simple cases, i.e. where no edge intersects any other edges. The visibility graph problem itself has long been studied and has been applied to a variety of areas. A common use for it has been for finding the shortest path. The B# algorithm has been implemented adjustments made and experimental comparisons via time measurements carried out. A comparison between “Naïve algorithm” and “Naive algorithm with B#” was performed with different numbers of vertices. The B# algorithm by itself doesn’t calculate the visibility graph. It selects the next best obstacle where the calculation should proceed.
OriginalspracheEnglisch
Titel1st OAGM-ARW Joint Workshop Vision Meets Robotics
PublikationsstatusVeröffentlicht - 2016
VeranstaltungOAGM & ARW Joint Workshop on Computer Vision and Robotics - Wels, Österreich
Dauer: 11 Mai 201613 Mai 2016
https://www.fh-ooe.at/en/kongresse/2016/oagm-arw/

Konferenz

KonferenzOAGM & ARW Joint Workshop on Computer Vision and Robotics
Land/GebietÖsterreich
OrtWels
Zeitraum11.05.201613.05.2016
Internetadresse

Fingerprint

Untersuchen Sie die Forschungsthemen von „New Algorithm to Speed up the Computation of a Visibility Graph“. Zusammen bilden sie einen einzigartigen Fingerprint.

Zitieren