default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael Hemmer
Person information
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j11]Cédric Portaneri, Mael Rouxel-Labbé, Michael Hemmer, David Cohen-Steiner, Pierre Alliez:
Alpha wrapping with an offset. ACM Trans. Graph. 41(4): 127:1-127:22 (2022)
2010 – 2019
- 2019
- [c22]Cédric Portaneri, Pierre Alliez, Michael Hemmer, Lukas Birklein
, Elmar Schömer:
Cost-driven framework for progressive compression of textured meshes. MMSys 2019: 175-188 - 2018
- [j10]Alon Baram, Efi Fogel, Dan Halperin, Michael Hemmer, Sebastian Morr:
Exact Minkowski sums of polygons with holes. Comput. Geom. 73: 46-56 (2018) - [j9]Sándor P. Fekete, Winfried Hellmann, Michael Hemmer, Arne Schmidt, Julian Troegel:
Computing maxmin edge length triangulations. J. Comput. Geom. 9(1): 1-26 (2018) - 2017
- [j8]Maximilian Ernestus, Stephan Friedrichs, Michael Hemmer, Jan Kokemüller, Alexander Kröller, Mahdi Moeini, Christiane Schmidt:
Algorithms for art gallery illumination. J. Glob. Optim. 68(1): 23-45 (2017) - [j7]Sándor P. Fekete, Andreas Haas, Michael Hemmer, Michael Hoffmann, Irina Kostitsyna, Dominik Krupke, Florian Maurer, Joseph S. B. Mitchell, Arne Schmidt, Christiane Schmidt, Julian Troegel:
Computing nonsimple polygons of minimum perimeter. J. Comput. Geom. 8(1): 340-365 (2017) - 2016
- [j6]Michael Hemmer, Michal Kleinbort, Dan Halperin:
Optimal randomized incremental construction for guaranteed logarithmic planar point location. Comput. Geom. 58: 110-123 (2016) - [j5]Stephan Friedrichs, Michael Hemmer, James King, Christiane Schmidt:
The continuous 1.5D terrain guarding problem: Discretization, optimal solutions, and PTAS. J. Comput. Geom. 7(1): 256-284 (2016) - [c21]Sándor P. Fekete, Andreas Haas, Michael Hemmer, Michael Hoffmann, Irina Kostitsyna, Dominik Krupke, Florian Maurer, Joseph S. B. Mitchell, Arne Schmidt, Christiane Schmidt, Julian Troegel:
Computing Nonsimple Polygons of Minimum Perimeter. SEA 2016: 134-149 - [p1]Pedro J. de Rezende, Cid C. de Souza, Stephan Friedrichs, Michael Hemmer, Alexander Kröller, Davi C. Tozoni:
Engineering Art Galleries. Algorithm Engineering 2016: 379-417 - [r1]Michael Hemmer, Christiane Schmidt:
Convex Hulls. Encyclopedia of Algorithms 2016: 446-449 - [i14]Sándor P. Fekete, Andreas Haas, Michael Hemmer, Michael Hoffmann, Irina Kostitsyna, Dominik Krupke, Florian Maurer, Joseph S. B. Mitchell, Arne Schmidt, Christiane Schmidt, Julian Troegel:
Computing Nonsimple Polygons of Minimum Perimeter. CoRR abs/1603.07077 (2016) - 2015
- [j4]Andreas von Dziegielewski, Michael Hemmer, Elmar Schömer:
High Precision Conservative Surface Mesh Generation for Swept Volumes. IEEE Trans Autom. Sci. Eng. 12(1): 183-191 (2015) - [j3]Oren Salzman, Michael Hemmer, Dan Halperin:
On the Power of Manifold Samples in Exploring Configuration Spaces and the Dimensionality of Narrow Passages. IEEE Trans Autom. Sci. Eng. 12(2): 529-538 (2015) - [c20]Sándor P. Fekete, Winfried Hellmann, Michael Hemmer, Arne Schmidt, Julian Troegel:
Computing MaxMin Edge Length Triangulations. ALENEX 2015: 55-69 - [c19]Alon Baram, Efi Fogel, Dan Halperin, Michael Hemmer, Sebastian Morr:
Exact Minkowski Sums of Polygons With Holes. ESA 2015: 71-82 - [c18]Dominik Krupke, Maximilian Ernestus, Michael Hemmer, Sándor P. Fekete:
Distributed cohesive control for robot swarms: Maintaining good connectivity in the presence of exterior forces. IROS 2015: 413-420 - [c17]Dominik Krupke, Michael Hemmer, James McLurkin, Yu Zhou, Sándor P. Fekete:
A parallel distributed strategy for arraying a scattered robot swarm. IROS 2015: 2795-2802 - [i13]Alon Baram, Efi Fogel, Michael Hemmer, Dan Halperin, Sebastian Morr:
Exact Minkowski Sums of Polygons With Holes. CoRR abs/1502.06195 (2015) - [i12]Dominik Krupke, Maximilian Ernestus, Michael Hemmer, Sándor P. Fekete:
Distributed Cohesive Control for Robot Swarms: Maintaining Good Connectivity in the Presence of Exterior Forces. CoRR abs/1505.03116 (2015) - [i11]Dominik Krupke, Michael Hemmer, James McLurkin, Yu Zhou, Sándor P. Fekete:
A Parallel Distributed Strategy for Arraying a Scattered Robot Swarm. CoRR abs/1505.03128 (2015) - [i10]Stephan Friedrichs, Michael Hemmer, Christiane Schmidt:
The Continuous 1.5D Terrain Guarding Problem: Discretization, Optimal Solutions, and PTAS. CoRR abs/1509.08285 (2015) - 2014
- [c16]Sándor P. Fekete, Stephan Friedrichs, Michael Hemmer, Joseph S. B. Mitchell, Christiane Schmidt:
On the Chromatic Art Gallery Problem. CCCG 2014 - [c15]Stephan Friedrichs, Michael Hemmer, Christiane Schmidt:
A PTAS for the Continuous 1.5D Terrain Guarding Problem. CCCG 2014 - [i9]Sándor P. Fekete, Stephan Friedrichs, Michael Hemmer:
Complexity of the General Chromatic Art Gallery Problem. CoRR abs/1403.2972 (2014) - [i8]Francisc Bungiu, Michael Hemmer, John Hershberger, Kan Huang, Alexander Kröller:
Efficient Computation of Visibility Polygons. CoRR abs/1403.3905 (2014) - [i7]Stephan Friedrichs, Michael Hemmer, Christiane Schmidt:
A PTAS for the continuous 1.5D Terrain Guarding Problem. CoRR abs/1405.6564 (2014) - [i6]Michael Hemmer, Michal Kleinbort, Dan Halperin:
Optimal randomized incremental construction for guaranteed logarithmic planar point location. CoRR abs/1410.5602 (2014) - [i5]Maximilian Ernestus, Stephan Friedrichs, Michael Hemmer, Jan Kokemüller, Alexander Kröller, Mahdi Moeini, Christiane Schmidt:
Algorithms for Art Gallery Illumination. CoRR abs/1410.5952 (2014) - [i4]Pedro Jussieu de Rezende, Cid C. de Souza, Stephan Friedrichs, Michael Hemmer, Alexander Kröller, Davi C. Tozoni:
Engineering Art Galleries. CoRR abs/1410.8720 (2014) - 2013
- [j2]Oren Salzman, Michael Hemmer, Barak Raveh, Dan Halperin:
Motion Planning via Manifold Samples. Algorithmica 67(4): 547-565 (2013) - 2012
- [c14]Efi Fogel, Michael Hemmer, Asaf Porat, Dan Halperin:
Lines through Segments in 3D Space. ESA 2012: 455-466 - [c13]Michael Hemmer, Michal Kleinbort, Dan Halperin:
Improved Implementation of Point Location in General Two-Dimensional Subdivisions. ESA 2012: 611-623 - [c12]Andreas von Dziegielewski, Michael Hemmer, Elmar Schömer:
High quality conservative surface mesh generation for swept volumes. ICRA 2012: 764-769 - [c11]Oren Salzman, Michael Hemmer, Dan Halperin:
On the Power of Manifold Samples in Exploring Configuration Spaces and the Dimensionality of Narrow Passages. WAFR 2012: 313-329 - [i3]Oren Salzman, Michael Hemmer, Dan Halperin:
On the Power of Manifold Samples in Exploring Configuration Spaces and the Dimensionality of Narrow Passages. CoRR abs/1202.5249 (2012) - [i2]Michael Hemmer, Michal Kleinbort, Dan Halperin:
Improved Implementation of Point Location in General Two-Dimensional Subdivisions. CoRR abs/1205.5434 (2012) - 2011
- [j1]Michael Hemmer, Laurent Dupont, Sylvain Petitjean, Elmar Schömer:
A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics. J. Symb. Comput. 46(4): 467-494 (2011) - [c10]Eric Berberich, Michael Hemmer, Michael Kerber:
A generic algebraic kernel for non-linear geometric applications. SCG 2011: 179-186 - [c9]Oren Salzman, Michael Hemmer, Barak Raveh, Dan Halperin:
Motion Planning via Manifold Samples. ESA 2011: 493-505 - [i1]Oren Salzman, Michael Hemmer, Barak Raveh, Dan Halperin:
Motion Planning via Manifold Samples. CoRR abs/1107.0803 (2011) - 2010
- [c8]Michael Hemmer, Ophir Setter, Dan Halperin:
Constructing the Exact Voronoi Diagram of Arbitrary Lines in Three-Dimensional Space - with Fast Point-Location. ESA (1) 2010: 398-409
2000 – 2009
- 2009
- [c7]Michael Hemmer, Elias P. Tsigaridas, Zafeirakis Zafeirakopoulos, Ioannis Z. Emiris, Menelaos I. Karavelas, Bernard Mourrain:
Experimental evaluation and cross-benchmarking of univariate real solvers. SNC 2009: 45-54 - 2007
- [b1]Michael Hemmer:
Exact computation of the adjacency graph of an arrangement of quadrics. University of Mainz, Germany, 2007, pp. 1-137 - [c6]Laurent Dupont, Michael Hemmer, Sylvain Petitjean, Elmar Schömer:
Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics. ESA 2007: 633-644 - 2005
- [c5]Eric Berberich, Michael Hemmer, Lutz Kettner, Elmar Schömer, Nicola Wolpert:
An exact, complete and efficient implementation for computing planar maps of quadric intersection curves. SCG 2005: 99-106 - [c4]Eric Berberich, Arno Eigenwillig, Michael Hemmer, Susan Hert, Lutz Kettner, Kurt Mehlhorn, Joachim Reichel, Susanne Schmitt, Elmar Schömer, Nicola Wolpert:
EXACUS: Efficient and Exact Algorithms for Curves and Surfaces. ESA 2005: 155-166 - 2002
- [c3]Eric Berberich, Arno Eigenwillig, Michael Hemmer, Susan Hert, Kurt Mehlhorn, Elmar Schömer:
A Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons. ESA 2002: 174-186 - 2001
- [c2]Nicola Geismann, Michael Hemmer, Elmar Schömer:
Computing a 3-dimensional cell in an arrangement of quadrics: exactly and actually! SCG 2001: 264-273 - [c1]Nicola Geismann, Michael Hemmer, Elmar Schömer:
The convex hull of ellipsoids. SCG 2001: 321-322
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 00:54 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
