Ludmila Scharf
[bibtex]Algorithmische Geometrie
Parallel Computation of the Hausdorff Distance between Shapes
In Proceedings of the 29th European Workshop on Computational Geometry (EuroCG), Seiten 47–50, March 2013.
Helmut Alt, Ludmila Scharf
Proceedings URL
[bibtex]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]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]Computing the depth of an arrangement of axis-aligned rectangles in parallel
In Proceedings of the 26th European Workshop on Computational Geometry (EuroCG), Seiten 33–36, Dortmund, Germany, March 2010.
Helmut Alt, Ludmila Scharf
[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]An inducing simple polygon of a line arrangement
Technischer Bericht B 08-03, Freie Universität Berlin, 2008.
Ludmila Scharf
[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]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
Shape Matching by Random Sampling
Theoretical Computer Science, Band 442, Seiten 2–12, 2012.
Helmut Alt, Ludmila Scharf
[doi]
[bibtex]Computation of the Hausdorff distance between sets of line segments in parallel
CoRR, Band abs/1207.3962, 2012.
Helmut Alt, Ludmila Scharf
[arxiv]
[bibtex]Probabilistic Matching of Planar Regions
Computational Geometry, Theory and Applications (CGTA), Band 43 (2), Seiten 99–114, 2010.
Helmut Alt, Ludmila Scharf, Daria Schymura
Special Issue on the 24th European Workshop on Computational Geometry (EuroCG'08)
view at ScienceDirect
[bibtex]Shape matching by random sampling
In 3rd Annual Workshop on Algorithms and Computation (WALCOM 2009), Lecture Note in Computer Science, Band 5431, Seiten 381–393, Herausgeber S. Das and R. Uehara, Springer-Verlag Berlin Heidelberg, 2009.
Helmut Alt, Ludmila Scharf
[bibtex] [pdf]Probabilistic Matching of Planar Shapes
Doktorarbeit, Freie Universität Berlin, Institut für Informatik, June 2009.
Ludmila Scharf
diss-online
[bibtex]Probabilistic Matching of Planar Regions
CoRR, Band abs/0902.4337, 2009.
Helmut Alt, Ludmila Scharf, Daria Schymura
[Eprint:arXiv:0902.4337]
[bibtex]Shape matching by random sampling
Technischer Bericht B 08-02, Freie Universität Berlin, 2008.
Helmut Alt, Ludmila Scharf
[bibtex] [pdf]Probabilistic Matching of Polygons
In Proceedings of the 24th European Workshop on Computational Geometry (EuroCG), Seiten 255–258, Nancy, France, March 2008.
Helmut Alt, Ludmila Scharf, Daria Schymura
[bibtex] [pdf]Computing the Hausdorff Distance between Curved Objects
Int. J. Comput. Geometry Appl., Band 18 (4), Seiten 307–320, August 2008.
Helmut Alt, Ludmila Scharf
[bibtex] [pdf]Probabilistic Matching and Resemblance Evaluation of Shapes in Trademark Images
In Proceedings of the ACM International Conference on Image and Video Retrieval (CIVR), Seiten 533–540, Amsterdam, The Netherlands, July 2007.
Helmut Alt, Ludmila Scharf, Sven Scholz
[bibtex] [pdf]Probabilistic matching of sets of Polygonal curves
In Proceedings of the 22nd European Workshop on Computational Geometry (EWCG), Seiten 107–110, Delphi, Greece, March 2006.
Helmut Alt, Ludmila Scharf, Sven Scholz
[bibtex] [pdf]Computing the Hausdorff Distance between Curved Objects
In Proceedings of the 2nd International Symposium on Voronoi Diagrams in Science and Engineering, Seiten 196-204, Hanyang University, Seoul, Korea, October 2005.
Helmut Alt, Ludmila Scharf
[bibtex]Computing the Hausdorff distance between curved objects
In Proceedings of the 20th European Workshop on Computational Geometry (EWCG), Seville, Spain, Seiten 233 - 236, 2004.
Helmut Alt, Ludmila Scharf
[bibtex] [ps.gz]Computing the Hausdorff distance between sets of curves
Diplomarbeit, Institut für Informatik, Freie Universität Berlin, January 2004.
Ludmila Scharf
[bibtex] [pdf]
Graphentheorie und Algorithmen
Storage Area Network Optimization: Final Report
Technischer Bericht B 00-18, Freie Universität Berlin, 2000.
Helmut Alt, Stefan Felsner, Ludmila Scharf
[bibtex] [ps.gz]
Geschichte der Informatik
Konrad Zuses Plankalkül – Seine Genese und eine moderne Implementierung
In Geschichten der Informatik: Visionen, Paradigmen, Leitmotive, Seiten 215–236, Herausgeber Hans D. Hellige, Springer, 2003.
Gerald Friedland, Cüneyt Göktekin, Mike Krüger, Denis Kuniß, Olaf Langmack, Raúl Rojas, Ludmila Scharf
Springer
[bibtex]
Sensor- und Ad-hoc-Netzwerke
Data Gathering in Sensor Networks
In Algorithms for Sensor and Ad Hoc Networks, Lecture Notes in Computer Science, Band 4621, Seiten 237–263, Herausgeber Dorothea Wagner and Roger Wattenhofer, Springer, 2007.
Ludmila Scharf
Springer LNCS
[bibtex]