David L. Millman

Orcid: 0000-0003-4112-3026

According to our database1, David L. Millman authored at least 27 papers between 2008 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Ordering Topological Descriptors.
CoRR, 2024

2023
From Curves to Words and Back Again: Geometric Computation of Minimum-Area Homotopy.
Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

Development of an ontology for biofilms.
Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2023

2022
Dynamic Checkpoint Initiation in Serverless MEC.
Proceedings of the IEEE International Conference on Omni-layer Intelligent Systems, 2022

Efficient Graph Reconstruction and Representation Using Augmented Persistence Diagrams.
Proceedings of the 34th Canadian Conference on Computational Geometry, 2022

2021
Two Ways Gas Price Oracles Miss The Mark.
Proceedings of the 2021 IEEE International Conference on Omni-Layer Intelligent Systems, 2021

2020
Reconstructing embedded graphs from persistence diagrams.
Comput. Geom., 2020

The Sung Diagram: Revitalizing the Eisenhower Matrix.
Proceedings of the Diagrammatic Representation and Inference, 2020

If You Must Choose Among Your Children, Pick the Right One.
Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020

2019
Persistence Diagrams for Efficient Simplicial Complex Reconstruction.
CoRR, 2019

2018
Approximate Nearest Neighbors in the Space of Persistence Diagrams.
CoRR, 2018

Challenges in Reconstructing Shapes from Euler Characteristic Curves.
CoRR, 2018

Learning Simplicial Complexes from Persistence Diagrams.
Proceedings of the 30th Canadian Conference on Computational Geometry, 2018

2015
Review of: Polyhedral and Algebraic Methods in Computational Geometry by Michael Joswig and Thorsten Theobald.
SIGACT News, 2015

2014
Review of discrete and computational geometry by Satyan L. Devadoss and Joseph O'Rourke.
SIGACT News, 2014

2013
Review of how to fold it by J. O'Rourke.
SIGACT News, 2013

2012
Degree-Driven Design of Geometric Algorithms for Point Location, Proximity, and Volume Calculation.
PhD thesis, 2012

Computing the Nearest Neighbor Transform Exactly with Only Double Precision.
Proceedings of the Ninth International Symposium on Voronoi Diagrams in Science and Engineering, 2012

2011
Review of Geometric algebra: an algebraic system for computer games and animation by J. Vince.
SIGACT News, 2011

Review of Geometric folding algorithms by authors: E.D. Demaine and J. O'Rourke.
SIGACT News, 2011

A Slow Algorithm for Computing the Gabriel Graph with Double Precision.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010
Parallel geometric algorithms for multi-core computers.
Comput. Geom., 2010

Computing planar Voronoi diagrams in double precision: a further example of degree-driven algorithm design.
Proceedings of the 26th ACM Symposium on Computational Geometry, 2010

Maximum geodesic routing in the plane with obstacles.
Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

2009
Review of higher arithmetic: an algorithmic introduction to number theory by H. M. Edwards (American Mathematical Society Student Mathematical Library Vol. 45 (2008)
SIGACT News, 2009

Computing the Implicit Voronoi Diagram in Triple Precision.
Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

2008
Review of Geometric algebra for computer science by Leo Dorst, Daniel Fontijne, and Stephen Mann(Morgan Kaufmann Publishers, 2007).
SIGACT News, 2008


  Loading...