Logo des Repositoriums
Zur Startseite
  • English
  • Deutsch
Anmelden
  1. Startseite
  2. SuUB
  3. Forschungsdokumente
  4. Geometric Proximity Graphs
 
Zitierlink DOI
10.26092/elib/2353
Verlagslink DOI
10.1201/9780367803735

Geometric Proximity Graphs

Veröffentlichungsdatum
2006
Autoren
Langetepe, Elmar  
Zachmann, Gabriel  
Zusammenfassung
This chapter focuses on geometric proximity graphs which can serve as a powerful tool to capture the structure or shape of otherwise unstructured point sets. These graphs have numerous applications in areas such as computer graphics, computer vision, geography, information retrieval, routing in ad-hoc networks, and computational biology, among many others. The chapter presents a small number of neighborhood graphs (other than polygonal meshes) and a few applications in computer graphics, where they can help to detect structure in point clouds. There are other geometric graphs that are more or less closely related to proximity graphs, such as the minimum spanning tree (MST) and the Delaunay graph (DG). The MST spans (i.e., connects) all points by a tree of minimal length. The DG is the dual of the Voronoi diagram.
Schlagwörter
graphs

; 

Geometric Proximity Graphs

; 

Geometric Data Structures
Verlag
A K Peters/CRC Press
Institution
andere Institution  
Dokumenttyp
Artikel/Aufsatz
Zeitschrift/Sammelwerk
Geometric Data Structures for Computer Graphics  
Zweitveröffentlichung
Ja
Dokumentversion
Postprint
Lizenz
https://creativecommons.org/licenses/by-nc-nd/4.0/
Sprache
Englisch
Dateien
Lade...
Vorschaubild
Name

Langetepe-Zachmann_Geometric data structures_accepted-version_PDF-A.pdf

Size

3.12 MB

Format

Adobe PDF

Checksum

(MD5):e0eac081c23b1f32fddc36ff0cdd9cb4

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science

  • Datenschutzbestimmungen
  • Endnutzervereinbarung
  • Feedback schicken