Bounded-error compression of particle data from hierarchical approximate methods

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Bounded-error compression of particle data from hierarchical approximate methods

Full text

Pdf (691 KB)

Source

Conference on High Performance Networking and Computing archive
Proceedings of the 1999 ACM/IEEE conference on Supercomputing (CDROM) table of contents

Portland, Oregon, United States

Article No. 32

Year of Publication: 1999

ISBN:1-58113-091-0

Authors

Dow-Yung Yang	Computer Science Department, Purdue University, West Lafayette, IN
Ananth Grama	Computer Science Department, Purdue University, West Lafayette, IN
Vivek Sarin	Department of Computer Science, Texas A & M University, College Station, TX

Sponsors

IEEE-CS\TCCA : TC on Computer Arhitecture
SIGARCH: ACM Special Interest Group on Computer Architecture

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 0, Downloads (12 Months): 8, Citation Count: 2

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/331532.331564 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Srinivas Aluru, Greengard's N-Body Algorithm is Not Order N, SIAM Journal on Scientific Computing, v.17 n.3, p.773-776, May 1996 [doi>10.1137/S1064827593272031]
	2	Chandrajit L Bajaj , Valerio Pascucci , Guozhong Zhuang, Single Resolution Compression of Arbitrary Triangular Meshes with Properties, Proceedings of the Conference on Data Compression, p.247, March 29-31, 1999
	3	J. Barnes and P. Hut. A hierarchical o(n log n) force calculation algorithm. Nature, 324, 1986.
	4	Paul B. Callahan , S. Rao Kosaraju, A decomposition of multi-dimensional point-sets with applications to k-nearest-neighbors and n-body potential fields (preliminary version), Proceedings of the twenty-fourth annual ACM symposium on Theory of computing, p.546-556, May 04-06, 1992, Victoria, British Columbia, Canada [doi>10.1145/129712.129766]
	5	Michael Deering, Geometry compression, Proceedings of the 22nd annual conference on Computer graphics and interactive techniques, p.13-20, September 1995 [doi>10.1145/218380.218391]
	6	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.
	7	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.
	8	L. Greengard. The Rapid Evaluation of Potential Fields in Particle Systems. MIT Press, 1987.
	9	L. Greengard , V. Rokhlin, A fast algorithm for particle simulations, Journal of Computational Physics, v.73 n.2, p.325-348, December 1, 1987 [doi>10.1016/0021-9991(87)90140-9]
	10	Marc Levoy, Polygon-assisted JPEG and MPEG compression of synthetic images, Proceedings of the 22nd annual conference on Computer graphics and interactive techniques, p.21-28, September 1995 [doi>10.1145/218380.218392]
	11	Gabriel Taubin , Jarek Rossignac, Geometric compression through topological surgery, ACM Transactions on Graphics (TOG), v.17 n.2, p.84-115, April 1998 [doi>10.1145/274363.274365]

CITED BY 2

	Aiichiro Nakano , Rajiv K. Kalia , Priya Vashishta , Timothy J. Campbell , Shuji Ogata , Fuyuki Shimojo , Subhash Saini, Scalable atomistic simulation algorithms for materials research, Proceedings of the 2001 ACM/IEEE conference on Supercomputing (CDROM), p.1-1, November 10-16, 2001, Denver, Colorado
	Aiichiro Nakano , Rajiv K. Kalia , Priya Vashishta , Timothy J. Campbell , Shuji Ogata , Fuyuki Shimojo , Subhash Saini, Scalable atomistic simulation algorithms for materials research, Scientific Programming, v.10 n.4, p.263-270, December 2002