Michael Hemmer
According to our database1,
Michael Hemmer
authored at least 35 papers
between 2001 and 2022.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on linkedin.com
-
on dl.acm.org
On csauthors.net:
Bibliography
2022
2019
Proceedings of the 10th ACM Multimedia Systems Conference, 2019
2018
2017
2016
Proceedings of the Algorithm Engineering - Selected Results and Surveys, 2016
The continuous 1.5D terrain guarding problem: Discretization, optimal solutions, and PTAS.
J. Comput. Geom., 2016
Optimal randomized incremental construction for guaranteed logarithmic planar point location.
Comput. Geom., 2016
2015
On the Power of Manifold Samples in Exploring Configuration Spaces and the Dimensionality of Narrow Passages.
IEEE Trans Autom. Sci. Eng., 2015
IEEE Trans Autom. Sci. Eng., 2015
The Continuous 1.5D Terrain Guarding Problem: Discretization, Optimal Solutions, and PTAS.
CoRR, 2015
Proceedings of the 2015 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2015
Distributed cohesive control for robot swarms: Maintaining good connectivity in the presence of exterior forces.
Proceedings of the 2015 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2015
2014
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014
2013
2012
Proceedings of the IEEE International Conference on Robotics and Automation, 2012
Proceedings of the Algorithms - ESA 2012, 2012
2011
A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics.
J. Symb. Comput., 2011
Proceedings of the 27th ACM Symposium on Computational Geometry, 2011
2010
Constructing the Exact Voronoi Diagram of Arbitrary Lines in Three-Dimensional Space - with Fast Point-Location.
Proceedings of the Algorithms, 2010
2009
Proceedings of the Symbolic Numeric Computation, 2009
2007
PhD thesis, 2007
Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics.
Proceedings of the Algorithms, 2007
2005
Proceedings of the Algorithms, 2005
An exact, complete and efficient implementation for computing planar maps of quadric intersection curves.
Proceedings of the 21st ACM Symposium on Computational Geometry, 2005
2002
Proceedings of the Algorithms, 2002
2001
Proceedings of the Seventeenth Annual Symposium on Computational Geometry, 2001
Proceedings of the Seventeenth Annual Symposium on Computational Geometry, 2001