Efficient delaunay tessellation through K-D tree decomposition

Article Details
Title:	Efficient delaunay tessellation through K-D tree decomposition
Article URLs:	https://doi.org/10.1109/SC.2016.61 http://doi.ieeecomputersociety.org/10.1109/SC.2016.61 http://dl.acm.org/citation.cfm?id=3014987
Alternative Article URLs:
Authors:	Dmitriy Morozov	Lawrence Berkeley National Laboratory
Authors:	Tom Peterka	Argonne National Laboratory
Sharing:	Research produced artifacts
Verification:	Authors have verified information
Artifact Evaluation Badge:	none
Artifact URLs:	https://github.com/diatomic/tess2
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key:	conf/sc/MorozovP16
Author Comments:

ACM/IEEE Intl. Conf. for High Perf. Computing, Networking, Storage and Analysis, SC 2016