David L. Millman, Ph.D. - Publications

Affiliations: 
2012 Computer Science University of North Carolina, Chapel Hill, Chapel Hill, NC 
Area:
Computer Science

11 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2020 Belton RL, Fasy BT, Mertz R, Micka S, Millman DL, Salinas D, Schenfisch A, Schupbach J, Williams L. Reconstructing embedded graphs from persistence diagrams Computational Geometry: Theory and Applications. 90: 101658. DOI: 10.1016/J.Comgeo.2020.101658  0.322
2015 Fasy BT, Millman DL. Review of: Polyhedral and Algebraic Methods in Computational Geometry by Michael Joswig and Thorsten Theobald Sigact News. 46: 17-20. DOI: 10.1145/2818936.2818942  0.389
2014 Fasy BT, Millman DL. Review of discrete and computational geometry by Satyan L. Devadoss and Joseph O'Rourke Sigact News. 45: 27-30. DOI: 10.1145/2596583.2596591  0.335
2012 Millman DL, Love S, Chan TM, Snoeyink J. Computing the nearest neighbor transform exactly with only double precision Proceedings of the 2012 9th International Symposium On Voronoi Diagrams in Science and Engineering, Isvd 2012. 66-74. DOI: 10.1109/ISVD.2012.13  0.542
2012 Millman DL, Griesheimer DP, Nease BR, Snoeyink J. Robust volume calculations for Constructive Solid Geometry (CSG) components in Monte Carlo transport calculations International Conference On the Physics of Reactors 2012, Physor 2012: Advances in Reactor Physics. 1: 826-841.  0.503
2011 Fasy BT, Millman DL. Review of Geometric folding algorithms by authors: E.D. Demaine and J. O'Rourke Sigact News. 42: 43-46. DOI: 10.1145/1959045.1959056  0.339
2011 Millman DL, Verma V. A slow algorithm for computing the gabriel graph with double precision Proceedings of the 23rd Annual Canadian Conference On Computational Geometry, Cccg 2011 0.386
2010 Millman DL, Snoeyink J. Computing planar Voronoi diagrams in double precision: A further example of degree-driven algorithm design Proceedings of the Annual Symposium On Computational Geometry. 386-392. DOI: 10.1145/1810959.1811024  0.55
2010 O'meara M, Millman DL, Snoeyink J, Verma V. Maximum geodesic routing in the plane with obstacles Proceedings of the 22nd Annual Canadian Conference On Computational Geometry, Cccg 2010. 107-108.  0.419
2009 Batista VHF, Millman DL, Pion S, Singler J. Parallel geometric algorithms for multi-core computers Proceedings of the Annual Symposium On Computational Geometry. 217-226. DOI: 10.1016/J.Comgeo.2010.04.008  0.48
2009 Millman DL, Snoeyink J. Computing the implicit voronoi diagram in triple precision Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5664: 495-506. DOI: 10.1007/978-3-642-03367-4_43  0.503
Show low-probability matches.