New pages
Jump to navigation
Jump to search
(newest | oldest) View (newer 50 | older 50) (20 | 50 | 100 | 250 | 500)
- 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 ==")
- 10:41, 15 February 2023 Chen's lambda-connected segmentation ( 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 == 1991 == Reference ==")
- 10:41, 15 February 2023 Kass; Witkin and Terzopoulos ( 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 == 1987 == Reference ==")
- 10:41, 15 February 2023 R. Nock and F. Nielsen Statistical Region Merging ( 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 == 2004 == Reference ==")
- 10:40, 15 February 2023 Dual clustering - Guberman ( 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 == 2012 == Reference ==")
- 10:40, 15 February 2023 Barghout; Lauren Visual Taxometric approach ( 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 == 2014 == Reference ==")
- 10:40, 15 February 2023 Recursive Region Splitting ( 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 == 1978 == Reference ==")
- 10:40, 15 February 2023 Linda G. Shapiro and George C. Stockman (2001) ( 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 == 2001 == Reference ==")
- 10:40, 15 February 2023 Hanrahan–Krueger (Specular Reflection Texture Mapping) (hist | edit) [259 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2} logn)$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1995 == Reference ==")
- 10:40, 15 February 2023 Ward anisotropic (Specular Reflection Texture Mapping) (hist | edit) [268 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{1.67} log^{2} n)$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1989 == Reference ==")
- 10:40, 15 February 2023 Cook–Torrance (microfacets) (Specular Reflection Texture Mapping) (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 == 1973 == Reference ==")
- 10:40, 15 February 2023 Blinn–Phong (Specular Reflection Texture Mapping) (hist | edit) [252 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{3})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1977 == Reference ==")
- 10:40, 15 February 2023 Phong (Specular Reflection Texture Mapping) (hist | edit) [252 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{3})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1971 == Reference ==")
- 10:40, 15 February 2023 Westin; S. H.; Arvo; J. R.; and Torrance; K. E 1992 (Diffuse Reflection Texture Mapping) (hist | edit) [254 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(k n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1992 == Reference ==")
- 10:40, 15 February 2023 Cabral; B.; Max; N.; and Springmeyer; R 1990 (Diffuse Reflection Texture Mapping) (hist | edit) [254 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(k n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1990 == Reference ==")
- 10:40, 15 February 2023 Nakamae; E.; Kaneda; K.; Okamoto; T.; and Nishita 1990 (Diffuse Reflection Texture Mapping) (hist | edit) [258 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(k^{3} n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1990 == Reference ==")
- 10:40, 15 February 2023 Kajiya; J. Anisotropic Reflection Models 1985 (Diffuse Reflection Texture Mapping) (hist | edit) [254 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(k n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1985 == Reference ==")
- 10:40, 15 February 2023 He; X. D.; Torrance; K. E.; Sillion; 1991 (Diffuse Reflection Texture Mapping) (hist | edit) [254 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(k n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1991 == Reference ==")
- 10:40, 15 February 2023 H.W.Jensen 2001 (Diffuse Reflection Texture Mapping) (hist | edit) [254 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(k^{3} n)$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2001 == Reference ==")
- 10:40, 15 February 2023 P.Hanrahan and W.Krueger 1993 (Diffuse Reflection Texture Mapping) (hist | edit) [254 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(k n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1993 == Reference ==")
- 10:40, 15 February 2023 CNN Based Gatys; Leon A 2001 (Texture Synthesis Texture Synthesis) (hist | edit) [252 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{3})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2001 == Reference ==")
- 10:40, 15 February 2023 Kwatra 2003 (Texture Synthesis Texture Synthesis) (hist | edit) [303 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{3})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2003 == Reference == https://dl.acm.org/doi/abs/10.1145/882262.882264")
- 10:40, 15 February 2023 Contribution Culling (Culling Culling) (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 == 1987 == Reference ==")
- 10:40, 15 February 2023 Occlusion Culling (Culling Culling) (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:40, 15 February 2023 Sector-Based Culling (Culling Culling) (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 == 1991 == Reference ==")
- 10:40, 15 February 2023 View frustum culling (Culling Culling) (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 == 2008 == Reference ==")
- 10:40, 15 February 2023 T. Tuytelaars and L. Van Gool 2000 (Blob Detection Feature Detection) (hist | edit) [252 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{3})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2000 == Reference ==")
- 10:40, 15 February 2023 Local scale-invariant Lowe 1999 (Blob Detection Feature Detection) (hist | edit) [252 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{3})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1999 == Reference ==")
- 10:40, 15 February 2023 Y. Dufournaud; C. Schmid; and R. Horaud 2000 (Blob Detection Feature Detection) (hist | edit) [263 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2} loglogn)$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2000 == Reference ==")