OnlineWoerterBuecher.de
Internes

Lexikon


Delaunay triangulation


Cs, 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.

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 - (2352 Reads)

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

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