Article

Free access

Bounded-error compression of particle data from hierarchical approximate methods

Authors:

Dow-Yung Yang,

Ananth Grama,

Vivek SarinAuthors Info & Claims

SC '99: Proceedings of the 1999 ACM/IEEE conference on Supercomputing

Pages 32 - es

https://doi.org/10.1145/331532.331564

Published: 01 January 1999 Publication History

PDF eReader

References

[1]

Srinivas Aluru. Greengard's n-body algorithm is not O(n). SIAM Journal on Scientific Computing, 17(3):773- 776, 1996.

Digital Library

Google Scholar

[2]

C. Bajaj, V. Pascucci, and G. Zhuang. Single resolution compression of arbitrary triangular meshes with properties. In Proceedings of Data Compression Conference, 1999.

Digital Library

Google Scholar

[3]

J. Barnes and P. Hut. A hierarchical o(n log n) force calculation algorithm. Nature, 324, 1986.

Google Scholar

[4]

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.

Digital Library

Google Scholar

[5]

M. Deering. Geometry compression. In Proceedings of SIGGRAPH'95, pages 13-20, 1995.

Digital Library

Google Scholar

[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.

Google Scholar

[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.

Google Scholar

[8]

L. Greengard. The Rapid Evaluation of Potential Fields in Particle Systems. MIT Press, 1987.

Google Scholar

[9]

L. Greengard and V. Rokhlin. A fast algorithm for particle simulations. J. Comp. Physics, 73:325-348, 1987.

Digital Library

Google Scholar

[10]

M. Levoy. Polygon-assisted jpeg and mpeg compression of synthetic images. In Proceedings of SIGGRAPH'95, pages 21-25, 1995.

Digital Library

Google Scholar

[11]

G. Taubin and J. Rossignac. Geometric compression through topological surgery. ACM Transactions on Graphics, 17(2):84-115, 1998.

Digital Library

Google Scholar

Cited By

View all

Zhao KDi SPerez DLiang XChen ZCappello F(2022)MDZ: An Efficient Error-bounded Lossy Compressor for Molecular Dynamics2022 IEEE 38th International Conference on Data Engineering (ICDE)10.1109/ICDE53745.2022.00007(27-40)Online publication date: May-2022
https://doi.org/10.1109/ICDE53745.2022.00007
Li SDi SLiang XChen ZCappello F(2018)Optimizing Lossy Compression with Adjacent Snapshots for N-body Simulation Data2018 IEEE International Conference on Big Data (Big Data)10.1109/BigData.2018.8622101(428-437)Online publication date: Dec-2018
https://doi.org/10.1109/BigData.2018.8622101
Nakano AKalia RVashishta PCampbell TOgata SShimojo FSaini SSlocomb C(2001)Scalable atomistic simulation algorithms for materials researchProceedings of the 2001 ACM/IEEE conference on Supercomputing10.1145/582034.582035(1-1)Online publication date: 10-Nov-2001
https://dl.acm.org/doi/10.1145/582034.582035

Index Terms

Bounded-error compression of particle data from hierarchical approximate methods

Recommendations

Compression of particle data from hierarchical approximate methods

This article presents an analytical and computational framework for the compression of particle data resulting from hierarchical approximate treecodes such as the Barnes--Hut and Fast Multipole Methods. Due to approximations introduced by hierarchical ...
Hierarchical data compression
Hierarchical heterogeneous particle swarm optimization: algorithms and evaluations

Particle swarm optimization PSO has recently been extended in several directions. Heterogeneous PSO HPSO is one of such recent extensions, which implements behavioural heterogeneity of particles. In this paper, we propose a further extended version, ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

SC '99: Proceedings of the 1999 ACM/IEEE conference on Supercomputing

January 1999

1015 pages

ISBN:1581130910

DOI:10.1145/331532

General Chair:
Cherri Pancake

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 January 1999

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SC '99

Sponsor:

SIGARCH
IEEE-CS

SC '99: International Conference for High Performance Computing, Networking, Storage and Analysis

November 14 - 19, 1999

Oregon, Portland, USA

Acceptance Rates

Overall Acceptance Rate 1,516 of 6,373 submissions, 24%

Upcoming Conference

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
86
Total Downloads

Downloads (Last 12 months)17
Downloads (Last 6 weeks)5

Reflects downloads up to 13 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Zhao KDi SPerez DLiang XChen ZCappello F(2022)MDZ: An Efficient Error-bounded Lossy Compressor for Molecular Dynamics2022 IEEE 38th International Conference on Data Engineering (ICDE)10.1109/ICDE53745.2022.00007(27-40)Online publication date: May-2022
https://doi.org/10.1109/ICDE53745.2022.00007
Li SDi SLiang XChen ZCappello F(2018)Optimizing Lossy Compression with Adjacent Snapshots for N-body Simulation Data2018 IEEE International Conference on Big Data (Big Data)10.1109/BigData.2018.8622101(428-437)Online publication date: Dec-2018
https://doi.org/10.1109/BigData.2018.8622101
Nakano AKalia RVashishta PCampbell TOgata SShimojo FSaini SSlocomb C(2001)Scalable atomistic simulation algorithms for materials researchProceedings of the 2001 ACM/IEEE conference on Supercomputing10.1145/582034.582035(1-1)Online publication date: 10-Nov-2001
https://dl.acm.org/doi/10.1145/582034.582035

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Compression of particle data from hierarchical approximate methods

Hierarchical data compression

Hierarchical heterogeneous particle swarm optimization: algorithms and evaluations