Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 3 of 3 for “"Gabriel graph"”.

  1. Partial Delaunay triangulations based routing, address configuration and date-centric storage in ad hock network

    … that guarantees delivery in connected unit disk graphs (where two nodes are connected if and only if their distance is no more than the transmission radius, which is equal for all nodes). The FACE mode is a recovery mode used when no neighbor closer to destination exists. FACE mode requires …

    ottawa-retro Repository record for Partial Delaunay triangulations based routing, address configuration and date-centric storage in ad hock network (opens in a new tab)

  2. Parameterfreies hierarchisches Graph-Clustering-Verfahren zur Interpretation raumbezogener Daten

    … in raumbezogenen Daten innerhalb von Geographischen Informationssystemen (GIS) voraus. Zunächst beschreiben wir einen Ansatz zur Generierung von 3D-Gebäuden, welche als Hypothese aus Katasterkarten abgleitet werden. Diese Vorgehensweise stellt ein Beispiel für die DLM-Interpretation auf …

    stuttgart Repository record for Parameterfreies hierarchisches Graph-Clustering-Verfahren zur Interpretation raumbezogener Daten (opens in a new tab)

  3. Transforming Point Data into Proximity Graphs

    … is essential. Since the early 1980’s, proximity graphs have served as one of the classical approaches to characterize neighborhood relationships; the most popular proximity graphs include Delaunay Triangulation (DT), Gabriel graphs (GG), relative neighborhood graphs (RNG), and minimum spanning …

    houston Repository record for Transforming Point Data into Proximity Graphs (opens in a new tab)