. "The Program construct Deleanuy triangulation for a planat set of points. The average time complexity depends lineary on the amount of input points. The maximual time complexity is quadratic, the same as with the common used programs. Input and output formats are text, described in the documentation."@en . "u autora" . . "RIV/68407700:21110/10:00177072" . "12" . "Delon\u00E9ho triangulace" . . "Deleanuy triangulation; Voronoi diagram"@en . . "DOSovsk\u00FD program" . "Z(MSM6840770005)" . "Delon\u00E9ho triangulace" . . . "Delon\u00E9ho triangulace"@cs . "RIV/68407700:21110/10:00177072!RIV11-MSM-21110___" . . . "21110" . "[302DE4D2D483]" . . "Deleanuy triangulation"@en . . "Deleanuy triangulation"@en . . "Van\u00ED\u010Dek, Tom\u00E1\u0161" . "nejsou stanoveny" . . . "1"^^ . "1"^^ . . . . "Delon\u00E9ho triangulace"@cs . "Program vytvo\u0159\u00ED Delon\u00E9ho triangulaci pro mno\u017Einu bod\u016F v rovin\u011B. Pr\u016Fm\u011Brn\u00E1 \u010Dasov\u00E1 slo\u017Eitost algoritmu je line\u00E1rn\u011B z\u00E1visl\u00E1 na po\u010Dtu vstupn\u00EDch bod\u016F. Maxim\u00E1ln\u00ED slo\u017Eitost je stejn\u00E1 jako u obvykl\u00FDch algoritm\u016F, z\u00E1vis\u00ED na po\u010Dtu vstupn\u00EDch bod\u016F kvadraticky. Vstupn\u00ED a v\u00FDstupn\u00ED form\u00E1ty programu jsou textov\u00E9, jsou pops\u00E1ny v dokumentaci."@cs . "Program vytvo\u0159\u00ED Delon\u00E9ho triangulaci pro mno\u017Einu bod\u016F v rovin\u011B. Pr\u016Fm\u011Brn\u00E1 \u010Dasov\u00E1 slo\u017Eitost algoritmu je line\u00E1rn\u011B z\u00E1visl\u00E1 na po\u010Dtu vstupn\u00EDch bod\u016F. Maxim\u00E1ln\u00ED slo\u017Eitost je stejn\u00E1 jako u obvykl\u00FDch algoritm\u016F, z\u00E1vis\u00ED na po\u010Dtu vstupn\u00EDch bod\u016F kvadraticky. Vstupn\u00ED a v\u00FDstupn\u00ED form\u00E1ty programu jsou textov\u00E9, jsou pops\u00E1ny v dokumentaci." . . "253230" .