DOE CODE   /    Search Results   /    TESS

TESS

RESOURCE

Publicly Accessible Repository
https://github.com/diatomic/tess2
https://doi.org/10.11578/dc.20171025.5001

SAVE / SHARE



ANL Badge

Abstract

Computing a Voronoi or Delaunay tessellation from a set of points is a core part of the analysis of many simulated and measured datasets. As the scale of simulations and observations surpasses billions of particles, a distributed-memory scalable parallel algorithm is the only feasible approach. The primary contribution of this software is a distributed-memory parallel Delaunay and Voronoi tessellation algorithm based on existing serial computational geometry libraries that automatically determines which neighbor points need to be exchanged among the subdomains of a spatial decomposition. Other contributions include the addition of periodic and wall boundary conditions.
Developers:
Release Date:
2014-07-28
Project Type:
Open Source, Publicly Available Repository
Software Type:
Scientific
Licenses:
BSD 3-clause "New" or "Revised" License
Sponsoring Org.:
Code ID:
6408
Site Accession Number:
5532
Research Org.:
Argonne National Laboratory
Country of Origin:
United States

RESOURCE

Publicly Accessible Repository
https://github.com/diatomic/tess2
https://doi.org/10.11578/dc.20171025.5001

SAVE / SHARE



ANL Badge

Citation Formats

Dmitriy Morozov, Tom P. TESS. Computer Software. https://github.com/diatomic/tess2. USDOE. 28 Jul. 2014. Web. doi:10.11578/dc.20171025.5001.
Dmitriy Morozov, Tom P. (2014, July 28). TESS. [Computer software]. https://github.com/diatomic/tess2. https://doi.org/10.11578/dc.20171025.5001.
Dmitriy Morozov, Tom P. "TESS." Computer software. July 28, 2014. https://github.com/diatomic/tess2. https://doi.org/10.11578/dc.20171025.5001.
@misc{ doecode_6408,
title = {TESS},
author = {Dmitriy Morozov, Tom P.},
abstractNote = {Computing a Voronoi or Delaunay tessellation from a set of points is a core part of the analysis of many simulated and measured datasets. As the scale of simulations and observations surpasses billions of particles, a distributed-memory scalable parallel algorithm is the only feasible approach. The primary contribution of this software is a distributed-memory parallel Delaunay and Voronoi tessellation algorithm based on existing serial computational geometry libraries that automatically determines which neighbor points need to be exchanged among the subdomains of a spatial decomposition. Other contributions include the addition of periodic and wall boundary conditions.},
doi = {10.11578/dc.20171025.5001},
url = {https://doi.org/10.11578/dc.20171025.5001},
howpublished = {[Computer Software] \url{https://doi.org/10.11578/dc.20171025.5001}},
year = {2014},
month = {jul}
}