Marc Scherfenberg
[bibtex]Algorithmische Geometrie
On Inducing Polygons and Related Problems
Computational Geometry, Theory and Applications (CGTA), 2011.
Eyal Ackerman, Rom Pinchasi, Ludmila Scharf, Marc Scherfenberg
http://dx.doi.org/10.1016/j.comgeo.2011.06.003
[bibtex]Every Simple Arrangement of n Lines Contains an Inducing Simple n-gon
The American Mathematical Monthly (AMM), Band 118 (2), Seiten 164-167, February 2011.
Eyal Ackerman, Rom Pinchasi, Ludmila Scharf, Marc Scherfenberg
http://dx.doi.org/10.4169/amer.math.monthly.118.02.164
[bibtex] [pdf]Approximate nearest neighbor search under translation invariant Hausdorff distance
International Journal on Computational Geometry and Applications (IJCGA), Band 21 (3), Seiten 369-381, 2011.
Christian Knauer, Marc Scherfenberg
[bibtex]Inducing polygons of line arrangements
International Journal on Computational Geometry and Applications (IJCGA), Band 21 (3), Seiten 351-368, June 2011.
Ludmila Scharf, Marc Scherfenberg
[bibtex]Inducing n-gon of an arrangement of lines
In Proceedings of the 25th European Workshop on Computational Geometry (EuroCG), Seiten 129–132, Brussels, Belgium, March 2009.
Ludmila Scharf, Marc Scherfenberg
[bibtex] [pdf]On Inducing Polygons and Related Problems
In Proc. of 17th Annual European Symposium on Algorithms (ESA), Lecture Notes in Computer Science, Springer, September 2009.
Eyal Ackerman, Rom Pinchasi, Ludmila Scharf, Marc Scherfenberg
Springer LNCS
[bibtex] [pdf]Inducing polygons of line arrangements
In Proceedings of the 24th European Workshop on Computational Geometry (EuroCG), Seiten 107–110, Nancy, France, March 2008.
Elena Mumford, Ludmila Scharf, Marc Scherfenberg
[bibtex] [pdf]Inducing polygons of line arrangements
In Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC 2008), Lecture Notes in Computer Science (LNCS 5369), Seiten 508–520, Herausgeber S.-H. Hong and H. Nagamochi and T. Fukunaga, Springer-Verlag Berlin Heidelberg, December 2008.
Ludmila Scharf, Marc Scherfenberg
best student paper award
[bibtex] [pdf]Approximate nearest neighbor search under translation invariant Hausdorff distance
In Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC 2008), Lecture Notes in Computer Science (LNCS 5369), Seiten 532–543, Herausgeber S.-H. Hong and H. Nagamochi and T. Fukunaga, Springer-Verlag Berlin Heidelberg, December 2008.
Christian Knauer, Marc Scherfenberg
[bibtex]Inducing n-gon of a line arrangement
Technischer Bericht B-08-14, Institut für Informatik, Freie Universität Berlin, 2008.
Ludmila Scharf, Marc Scherfenberg
(updated Feb. 2009)
[bibtex] [pdf]
Geometrische Muster- und Formenerkennung
Computing the Discrete Fréchet Distance with Imprecise Input
Int. J. Comput. Geometry Appl., Band 22 (1), Seiten 27-44, 2012.
Hee-Kap Ahn, Christian Knauer, Marc Scherfenberg, Lena Schlipf, Antoine Vigneron
[bibtex]The directed Hausdorff distance between imprecise point sets
Theoretical Computer Science (TCS), Band 412 (32), Seiten 4173-4186, 2011.
Christian Knauer, Maarten Löffler, Marc Scherfenberg, Thomas Wolle
[bibtex] [pdf]Computing the Discrete Fréchet Distance with Imprecise Input
In Proceedings of the 26th European Workshop on Computational Geometry (EuroCG), Seiten 13–16, Dortmund, Germany, 2010.
Hee-Kap Ahn, Christian Knauer, Marc Scherfenberg, Lena Schlipf, Antoine Vigneron
[bibtex] [pdf]Computing the Discrete Fréchet Distance with Imprecise Input
In Proceedings of the 21st International Symposium on Algorithms and Computation (ISAAC 2010), Lecture Notes in Computer Science, Band 6507, Seiten 422–433, Herausgeber Cheong, Otfried and Chwa, Kyung-Yong and Park, Kunsoo, Springer-Verlag, Berlin/Heidelberg, Germany, 2010.
Hee-Kap Ahn, Christian Knauer, Marc Scherfenberg, Lena Schlipf, Antoine Vigneron
[bibtex] [pdf]The Directed Hausdorff Distance between Imprecise Point Sets
2009.
Christian Knauer, Maarten Löffler, Marc Scherfenberg, Thomas Wolle
[Eprint:arXiv:0909.4642]
[bibtex] [4642v1.pdf]Computing the Discrete Fréchet Distance with Imprecise Input
In Proc.of the 12th Korea-Japan Joint Workhop on Algorithms and Computation (WAAC 2009), Seiten 132–137, July 2009.
Hee-Kap Ahn, Marc Scherfenberg, Lena Schlipf, Antoine Vigneron
[bibtex]The Directed Hausdorff Distance between Imprecise Point Sets
In Proceedings of the 20th International Symposium on Algorithms and Computation (ISAAC 2009), Lecture Notes in Computer Science, Band 5878, Seiten 720–729, Herausgeber Dong, Yingfei and Du, Ding-Zhu and Ibarra, Oscar, Springer-Verlag, Berlin/Heidelberg, Germany, 2009.
Christian Knauer, Maarten Löffler, Marc Scherfenberg, Thomas Wolle
[doi]
[bibtex] [pdf]