CoboCards App FAQ & Wünsche Feedback
Sprache: Deutsch Sprache
Kostenlos registrieren  Login

Zu dieser Karteikarte gibt es einen kompletten Satz an Karteikarten. Kostenlos!

Alle Oberthemen / Informatik / Computergrafik / Schwerpunktkolloquium: Basic Techniques, Geometry Processing, Global Illumination
50
What are the properties of a Delaunay triangulation?
The Delaunay triangulation maximizes the smallest interior angle.

The Delaunay triangulation of a point set is unique (unless a triangle circumcircle intersects more than 3 vertices).

Dual properties of Delaunay triangulations and Voronoi diagrams
Delauny triangulation Voronoi diagram
Each triangle circumcircle contains no other vertices in its interior. Around each Voronoi vertex, there exists a smallest circumcircle touching at least 3 Voronoi sites and containing no sites in its interior.
For every edge, there exists an empty circle containing both endpoints. For every Voronoi edge, there exists a circle containing both adjacent Voronoi sites but no other sites.

Neuer Kommentar
Karteninfo:
Autor: janisborn
Oberthema: Informatik
Thema: Computergrafik
Schule / Uni: RWTH Aachen
Ort: Aachen
Veröffentlicht: 18.05.2022

Abbrechen
E-Mail

Passwort

Login    

Passwort vergessen?
Deutsch  English