OnlineWoerterBuecher.de
Internes

Lexikon


Delaunay triangulation


s, graphics> (After B. Delaunay) For a set s of points in the Euclidean plane, the unique triangulation DT(s) of s such that no point in s is inside the circumcircle of any triangle in DT(s). DT(s) is the dual of the {voronoi diagram} of s.

style="border-width:thin; border-color:#333333; border-style:dashed; padding:5px;" align="left">In addition suitable contents:
[ = ] [ ag ] [ al ] [ am ] [ an ] [ ar ] [ arc ] [ at ] [ au ] [ B ] [ ch ] [ ci ] [ cl ] [ cu ] [ D ] [ de ] [ du ] [ dual ] [ E ] [ er ] [ et ] [ Euclid ] [ fi ] [ file ] [ gl ] [ gr ] [ graph ] [ gu ] [ h ] [ hat ] [ hr ] [ id ] [ il ] [ in ] [ int ] [ io ] [ iq ] [ ir ] [ is ] [ la ] [ Lex ] [ li ] [ ma ] [ mc ] [ mo ] [ mod ] [ module ] [ na ] [ ne ] [ ng ] [ ni ] [ no ] [ ns ] [ ph ] [ pl ] [ point ] [ query ] [ rc ] [ re ] [ ro ] [ s ] [ se ] [ set ] [ si ] [ su ] [ T ] [ th ] [ tr ] [ ua ] [ um ]






Go Back ]

Free On-line Dictionary of Computing

Copyright © by OnlineWoerterBuecher.de - (2356 Reads)

All logos and trademarks in this site are property of their respective owner.

Page Generation in 0.0906 Seconds, with 16 Database-Queries
Zurück zur Startseite