메뉴 건너뛰기




Volumn , Issue , 1999, Pages 32-

Bounded-error compression of particle data from hierarchical approximate methods

Author keywords

[No Author keywords available]

Indexed keywords

DATA COMPRESSION RATIO;

EID: 85032667507     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SC.1999.10041     Document Type: Conference Paper
Times cited : (9)

References (11)
  • 1
    • 0004457114 scopus 로고    scopus 로고
    • Greengard's n-body algorithm is not O(n)
    • Srinivas Aluru. Greengard's n-body algorithm is not O(n). SIAM Journal on Scientific Computing, 17(3):773-776, 1996.
    • (1996) SIAM Journal On Scientific Computing , vol.17 , Issue.3 , pp. 773-776
    • Aluru, S.1
  • 3
    • 33846349887 scopus 로고
    • A hierarchical o(n log n) force calculation algorithm
    • J. Barnes and P. Hut. A hierarchical o(n log n) force calculation algorithm. Nature, 324, 1986.
    • (1986) Nature , vol.324
    • Barnes, J.1    Hut, P.2
  • 4
    • 0026982453 scopus 로고
    • A decomposition of multi-dimensional point-sets with applications to knearest-neighbors and n-body potential fields
    • May
    • P. B. Callahan and S. R. Kosaraju. A decomposition of multi-dimensional point-sets with applications to knearest-neighbors and n-body potential fields. In Proceedings of 24th Annual ACM Symp. on Theory of Computing, pages 546-556, May 1992.
    • (1992) Proceedings of 24th Annual ACM Symp. On Theory of Computing , pp. 546-556
    • Callahan, P.B.1    Kosaraju, S.R.2
  • 6
    • 13644274667 scopus 로고
    • Revisiting the fast multipole algorithm error bounds
    • Duke University
    • William D. Elliott. Revisiting the fast multipole algorithm error bounds. Technical Report TR94-008, Duke University, 1994. available from http://www.ee.duke.edu/Research/SciComp/Papers/TR94-008.html.
    • (1994) Technical Report TR94-008
    • Elliott, W.D.1
  • 7
    • 85035788114 scopus 로고    scopus 로고
    • On error and computation complexity of multipole methods
    • Department of Computer Science, Purdue University,W. Lafayette, IN 47906, Accepted for publication in SIAM J. Sci. Comput
    • Ananth Grama, Vivek Sarin, and Ahmed Sameh. On error and computation complexity of multipole methods. Technical report, Department of Computer Science, Purdue University,W. Lafayette, IN 47906, 1999. Accepted for publication in SIAM J. Sci. Comput.
    • (1999) Technical Report
    • Grama, A.1    Sarin, V.2    Sameh, A.3
  • 9
    • 0000396658 scopus 로고
    • A fast algorithm for particle simulations
    • L. Greengard and V. Rokhlin. A fast algorithm for particle simulations. J. Comp. Physics, 73:325-348, 1987.
    • (1987) J. Comp. Physics , vol.73 , pp. 325-348
    • Greengard, L.1    Rokhlin, V.2
  • 10
    • 0029204086 scopus 로고
    • Polygon-assisted jpeg and mpeg compression of synthetic images
    • M. Levoy. Polygon-assisted jpeg and mpeg compression of synthetic images. In Proceedings of SIGGRAPH'95, pages 21-25, 1995.
    • (1995) Proceedings of SIGGRAPH'95 , pp. 21-25
    • Levoy, M.1
  • 11
    • 0032036298 scopus 로고    scopus 로고
    • Geometric compression through topological surgery
    • G. Taubin and J. Rossignac. Geometric compression through topological surgery. ACM Transactions on Graphics, 17(2):84-115, 1998.
    • (1998) ACM Transactions On Graphics , vol.17 , Issue.2 , pp. 84-115
    • Taubin, G.1    Rossignac, J.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.