New pages
Jump to navigation
Jump to search
(newest | oldest) View (newer 50 | older 50) (20 | 50 | 100 | 250 | 500)
- 10:42, 15 February 2023 Blinn and Newell (Environment Mapping Texture Mapping) (hist | edit) [243 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == - == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1976 == Reference ==")
- 10:42, 15 February 2023 Bresenham Algorithm (Rasterization Rasterization) (hist | edit) [460 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(n)$ == Space Complexity == $O({1})$ Words (Derived: for each iteration (i.e. each step along the line), only need to store a constant number of variables that are then overwritten in the next iteration.) == Description == == Approximate? == Approximate Approximation Factor: n/a == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1962 == Reference == Hearn, Baker (1997) pg. 88")
- 10:42, 15 February 2023 Digital Differential Analyzer (DDA) (Rasterization Rasterization) (hist | edit) [492 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(n)$ == Space Complexity == $O({1})$ Words (Derived: for each iteration (i.e. each step along the line), only need to store a constant number of variables that are then overwritten in the next iteration.) == Description == "Scan-conversion line algorithm" == Approximate? == Approximate Approximation Factor: n/a == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1983 == Reference == Hearn, Ba...")
- 10:42, 15 February 2023 Shani; Brafman; & Shimony; 2005 (POMDPs POMDPs) (hist | edit) [242 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2005 == Reference ==")
- 10:42, 15 February 2023 Bertsekas & Castanon; 1999; (POMDPs POMDPs) (hist | edit) [242 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1999 == Reference ==")
- 10:42, 15 February 2023 McAllester & Singh; 1999; (POMDPs POMDPs) (hist | edit) [242 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1999 == Reference ==")
- 10:42, 15 February 2023 Paquet; Tobin; & Chaib-draa; 2005; (POMDPs POMDPs) (hist | edit) [242 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2005 == Reference ==")
- 10:42, 15 February 2023 Barto;Bradtke; & Singhe; 1995; (POMDPs POMDPs) (hist | edit) [242 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1995 == Reference ==")
- 10:42, 15 February 2023 Washington; 1997; (POMDPs POMDPs) (hist | edit) [242 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1997 == Reference ==")
- 10:42, 15 February 2023 Satia & Lave; 1973; (POMDPs POMDPs) (hist | edit) [242 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1973 == Reference ==")
- 10:42, 15 February 2023 Spaan & Vlassis; 2005 (POMDPs POMDPs) (hist | edit) [242 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2005 == Reference ==")
- 10:42, 15 February 2023 Smith & Simmons; 2005; (POMDPs POMDPs) (hist | edit) [242 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2005 == Reference ==")
- 10:41, 15 February 2023 Poupart; 2005; (POMDPs POMDPs) (hist | edit) [242 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2005 == Reference ==")
- 10:41, 15 February 2023 Braziunas & Boutilier; 2004; (POMDPs POMDPs) (hist | edit) [242 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2004 == Reference ==")
- 10:41, 15 February 2023 Pineau; Gordon; & Thrun; 2003; (POMDPs POMDPs) (hist | edit) [242 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2003 == Reference ==")
- 10:41, 15 February 2023 Hauskrecht; 2000; (POMDPs POMDPs) (hist | edit) [242 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2000 == Reference ==")
- 10:41, 15 February 2023 Simplification via intermediate hierarchical rep-resentation - He; T.; Hong; 1996 (Mesh Simplification Mesh Simplification) (hist | edit) [242 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1996 == Reference ==")
- 10:41, 15 February 2023 Simplification via intermediate hierarchical rep-resentation - He; T.; Hong; L.; Kaufman 1995 (Mesh Simplification Mesh Simplification) (hist | edit) [242 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1995 == Reference ==")
- 10:41, 15 February 2023 Simplification via intermediate hierarchical rep-resentation - Andujar 1996 (Mesh Simplification Mesh Simplification) (hist | edit) [242 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1996 == Reference ==")
- 10:41, 15 February 2023 Wavelet-based - Eck; M.; DeRose; T.; 1995 (Mesh Simplification Mesh Simplification) (hist | edit) [242 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1995 == Reference ==")
- 10:41, 15 February 2023 Wavelet-based - Certain; A.; Popovic; J.; 1996 (Mesh Simplification Mesh Simplification) (hist | edit) [242 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1996 == Reference ==")
- 10:41, 15 February 2023 Wavelet-based - D.J. Hebert and H-J. Kim 1995 (Mesh Simplification Mesh Simplification) (hist | edit) [242 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1995 == Reference ==")
- 10:41, 15 February 2023 Wavelet-based - M.H. Gross; O.G. Staadt and R. Gatti 1996 (Mesh Simplification Mesh Simplification) (hist | edit) [242 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1996 == Reference ==")
- 10:41, 15 February 2023 Vertex clustering - Rossignac; J. and Borrel; P. 1997 (Mesh Simplification Mesh Simplification) (hist | edit) [242 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1997 == Reference ==")
- 10:41, 15 February 2023 Vertex clustering - Hoppe; H.; DeRose; T.; 1993 (Mesh Simplification Mesh Simplification) (hist | edit) [242 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1993 == Reference ==")
- 10:41, 15 February 2023 Vertex clustering - Reddy 1996 (Mesh Simplification Mesh Simplification) (hist | edit) [242 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1996 == Reference ==")
- 10:41, 15 February 2023 Vertex clustering - Low; K. L. and Tan; T. S 1997 (Mesh Simplification Mesh Simplification) (hist | edit) [242 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1997 == Reference ==")
- 10:41, 15 February 2023 Vertex clustering - Rossignac; J. and Borrel; P. 1993 (Mesh Simplification Mesh Simplification) (hist | edit) [242 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1993 == Reference ==")
- 10:41, 15 February 2023 Re-tiling - Turk; G 1992 (Mesh Simplification Mesh Simplification) (hist | edit) [242 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1992 == Reference ==")
- 10:41, 15 February 2023 Controlled vertex/edge/face decimation - Cohen; J.; Varshney; A 1996 (Mesh Simplification Mesh Simplification) (hist | edit) [242 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1996 == Reference ==")
- 10:41, 15 February 2023 Controlled vertex/edge/face decimation - Hamann 1994 (Mesh Simplification Mesh Simplification) (hist | edit) [242 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1994 == Reference ==")
- 10:41, 15 February 2023 Controlled vertex/edge/face decimation - R. Ronfard and J. Rossignac 1996 (Mesh Simplification Mesh Simplification) (hist | edit) [242 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1996 == Reference ==")
- 10:41, 15 February 2023 Controlled vertex/edge/face decimation - Guéziec 1996 (Mesh Simplification Mesh Simplification) (hist | edit) [242 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1996 == Reference ==")
- 10:41, 15 February 2023 Controlled vertex/edge/face decimation - M.E. Algorri and F. Schmitt 1996 (Mesh Simplification Mesh Simplification) (hist | edit) [242 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1996 == Reference ==")
- 10:41, 15 February 2023 Coplanar facets merging - A.D. Kalvin and R.H. Taylor 1996 (Mesh Simplification Mesh Simplification) (hist | edit) [242 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1996 == Reference ==")
- 10:41, 15 February 2023 Coplanar facets merging - Kalvin; A. D.; Cutting; C. B.; Haddad; B. and Noz; M. E. 1991 (Mesh Simplification Mesh Simplification) (hist | edit) [242 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1991 == Reference ==")
- 10:41, 15 February 2023 Coplanar facets merging - Hinker; P. and Hansen; C. 1993 (Mesh Simplification Mesh Simplification) (hist | edit) [242 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1993 == Reference ==")
- 10:41, 15 February 2023 Coplanar facets merging - M.J. De Haemer and M.J. Zyda 1991 (Mesh Simplification Mesh Simplification) (hist | edit) [242 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1991 == Reference ==")
- 10:41, 15 February 2023 Isometric graph partitioning - Leo Grady and Eric L. Schwartz (2006) ( Image Segmentation) (hist | edit) [252 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2006 == Reference ==")
- 10:41, 15 February 2023 Quasi-linear Topological watershed ( Image Segmentation) (hist | edit) [255 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(nlogn)$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2005 == Reference ==")
- 10:41, 15 February 2023 Multiple Resolution segmentation - J. Liu and Y. H. Yang (1994) ( Image Segmentation) (hist | edit) [252 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1994 == Reference ==")
- 10:41, 15 February 2023 Multi-scale MAP estimation - A. Bouman and M. Shapiro (2002) ( Image Segmentation) (hist | edit) [252 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2002 == Reference ==")
- 10:41, 15 February 2023 Bijaoui and Rué ( Image Segmentation) (hist | edit) [252 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1995 == Reference ==")
- 10:41, 15 February 2023 Florack and Kuijper ( Image Segmentation) (hist | edit) [252 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2000 == Reference ==")
- 10:41, 15 February 2023 Topological watershed ( Image Segmentation) (hist | edit) [252 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1997 == Reference ==")
- 10:41, 15 February 2023 Watershed transformation 1979 ( Image Segmentation) (hist | edit) [252 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1979 == Reference ==")
- 10:41, 15 February 2023 Iterated conditional modes algorithm ( Image Segmentation) (hist | edit) [252 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1986 == Reference ==")
- 10:41, 15 February 2023 Geman and Geman Markov random fields ( Image Segmentation) (hist | edit) [252 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1984 == Reference ==")
- 10:41, 15 February 2023 David Mumford and Jayant Shah (1989) ( Image Segmentation) (hist | edit) [252 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1989 == Reference ==")
- 10:41, 15 February 2023 S.L. Horowitz and T. Pavlidis - directed split and merge ( Image Segmentation) (hist | edit) [252 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1974 == Reference ==")