Petro Vlahos Algorithm (Image Compositing Image Compositing)

From Algorithm Wiki
Revision as of 10:35, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2} k/r)$ == Space Complexity == $O(nk)$?? words (Keeps track of all pixels across all images) == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == Word RAM? == Year == 1985 == Reference ==")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(n^{2} k/r)$

Space Complexity

$O(nk)$?? words

(Keeps track of all pixels across all images)

Description

Approximate?

Approximate

Approximation Factor:

Randomized?

No, deterministic

Model of Computation

Word RAM?

Year

1985

Reference

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Petro_Vlahos_Algorithm_(Image_Compositing_Image_Compositing)&oldid=44504"