2009
[bibtex]Computational Geometry
A Note on Polychromatic Coloring of Rectangular Partitions
Discrete Mathematics, Volume 309 (9), Pages 2957-2960, May 2009.
Darko Dimitrov, Elad Horev, Roi Krakovski
[bibtex]Bounds on the quality of the PCA bounding boxes
Computational Geometry, Volume 42 (8), Pages 772-789, October 2009.
Darko Dimitrov, Christian Knauer, Klaus Kriegel, Günter Rote
Special Issue on the 23rd European Workshop on Computational Geometry
[bibtex]Inducing n-gon of an arrangement of lines
In Proceedings of the 25th European Workshop on Computational Geometry (EuroCG), Pages 129–132, Brussels, Belgium, March 2009.
Ludmila Scharf, Marc Scherfenberg
[bibtex] [pdf]Fixed-parameter tractability and lower bounds for stabbing problems
In Proceedings of the 25th European Workshop on Computational Geometry (EuroCG), Brussels, Belgium, March 2009.
Panos Giannopoulos, Christian Knauer, Günter Rote, Daniel Werner
[bibtex]Constructing Optimal Highways
Internat. J. Found. Comput. Sci., Volume 20 (1), Pages 3–23, 2009.
Hee-Kap Ahn, Helmut Alt, Tetsuo Asano, Sang Won Bae, Peter Braß, Otfried Cheong, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Alexander Wolff
[doi]
[bibtex]Wooden Geometric Puzzles: Design and Hardness Proofs
Theory Comput. Syst., Volume 44, Pages 160–174, 2009.
Helmut Alt, Hans Bodlaender, Marc van Kreveld, Günter Rote, Gerard Tel
[bibtex]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]The Computational Geometry of Comparing Shapes
In Efficient Algorithms, Volume LNCS 5760, Pages 235–248, Editor(s) Susanne Albers, Helmut Alt, Stefan Näher, Springer Berlin / Heidelberg, 2009.
Helmut Alt
Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday
SpringerLink
[bibtex]Closed-Form Solutions for Continuous PCA and Bounding Box Algorithms
A. Ranchordas et al. (Eds.): VISIGRAPP 2008, CCIS , Springer, Volume 2, Pages 26–40, 2009.
Darko Dimitrov, Mathias Holst, Christian Knauer, Klaus Kriegel
[bibtex]Computing Principal Components Dynamically
CoRR, Volume abs/0912.5380, 2009.
Darko Dimitrov, Mathias Holst, Christian Knauer, Klaus Kriegel
[bibtex]Recovering Structure from r-Sampled Objects
Computer Graphics forum (special issue on Symposium on Geomerty Processing 2009), Volume 28 (5), Pages 1349-1360, July 2009.
Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Bernhard Kornberger, Simon Plantinga, Günter Rote, Astrid Sturm, Gert Vegter
[bibtex]
Edited Publications
Efficient Algorithms
Volume LNCS 5760, Springer Berlin / Heidelberg, 2009.
Editor(s): Susanne Albers, Helmut Alt, Stefan Näher
Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday
SpringerLink
[bibtex]
Geometric Optimization Problems
Integer Point Sets Minimizing Average Pairwise L1 Distance: What is the Optimal Shape of a Town?
In Proc. of the 21st Canadian Conference on Computational Geometry (CCCG), Pages 145-148, Vancouver, Canada, August 2009.
Erik D. Demaine, Sándor P. Fekete, Günter Rote, Nils Schweer, Daria Schymura, Mariano Zelke
[bibtex]
Geometric Shape and Pattern Matching
Shape matching by random sampling
In 3rd Annual Workshop on Algorithms and Computation (WALCOM 2009), Lecture Note in Computer Science, Volume 5431, Pages 381–393, Editor(s) S. Das and R. Uehara, Springer-Verlag Berlin Heidelberg, 2009.
Helmut Alt, Ludmila Scharf
[bibtex] [pdf]Measuring the Similarity of Geometric Graphs
In Proceedings of the 25th European Workshop on Computational Geometry (EuroCG), Brussels, Belgium, March 2009.
Otfried Cheong, Joachim Gudmundsson, Hyo-Sil Kim, Daria Schymura, Fabian Stehn
[bibtex] [pdf]Minimizing the weighted directed Hausdorff distance between colored point sets under translations and rigid motions
In Proceedings of the 25th European Workshop on Computational Geometry (EuroCG), Brussels, Belgium, March 2009.
Christian Knauer, Klaus Kriegel, Fabian Stehn
[bibtex] [pdf]Two Applications of Point Matching
In Proceedings of the 25th European Workshop on Computational Geometry (EuroCG), Brussels, Belgium, March 2009.
Günter Rote
[bibtex]Minimizing the weighted directed Hausdorff distance between colored point sets under translations and rigid motions
In Proc. Frontiers in Algorithmics Workshop, Lecture Notes in Computer Science, Volume 5598, Pages 108–119, Springer, Hefei, China, 2009.
Christian Knauer, Klaus Kriegel, Fabian Stehn
[bibtex] [pdf]Measuring the Similarity of Geometric Graphs
In Proc. 8th International Symposium on Experimental Algorithms, Lecture Notes in Computer Science, Volume 5526, Pages 101–112, Springer, Dortmund, Germany, 2009.
Otfried Cheong, Joachim Gudmundsson, Hyo-Sil Kim, Daria Schymura, Fabian Stehn
[bibtex] [pdf]Probabilistic Matching of Planar Shapes
Phd Thesis, Freie Universität Berlin, Institut für Informatik, June 2009.
Ludmila Scharf
diss-online
[bibtex]Polygonal Chains with pairwise identical Hausdorff Distance
Technical Report B 09-10, Freie Universität Berlin, Germany, 2009.
Lutz Meißner
[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]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, Volume 5878, Pages 720–729, Editor(s) 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]Computing the Discrete Fréchet Distance with Imprecise Input
In Proc.of the 12th Korea-Japan Joint Workhop on Algorithms and Computation (WAAC 2009), Pages 132–137, July 2009.
Hee-Kap Ahn, Marc Scherfenberg, Lena Schlipf, Antoine Vigneron
[bibtex]Probabilistic Matching of Planar Regions
CoRR, Volume abs/0902.4337, 2009.
Helmut Alt, Ludmila Scharf, Daria Schymura
[Eprint:arXiv:0902.4337]
[bibtex]
Graph Theory and Algorithms
Construction Sequences and Certifying 3-Connectedness
Technical Report B 09-01, Freie Universität Berlin, Germany, March 2009.
Jens Schmidt
[pdf]
[bibtex]Gray Code Compression
Technical Report B 09-02, Institut für Informatik, Freie Universität Berlin, March 2009.
Darko Dimitrov, Tomáš Dvořák, Petr Gregor, and Riste Škrekovski
[bibtex] [pdf]Interval Stabbing Problems in Small Integer Ranges
In 20th International Symposium on Algorithms and Computation (ISAAC 09), Hawaii, USA, 2009.
Jens Schmidt
accepted for publication
[pdf and source code]
[bibtex]Gray Code Compression
IWOCA’09, Lecture Notes in Computer Science, Volume 5874, Pages 83–-193, 2009.
Darko Dimitrov, Tomáš Dvořák, Petr Gregor, and Riste Škrekovski
[bibtex]Point sets with planar embeddings of cubic, connected graphs
In KAM-DIMATIA Series, Charles University, Prague, 2009.
Jens Schmidt
(to appear)
[bibtex]Gray Codes Avoiding Matchings
Discrete Mathematics & Theoretical Computer Science, Volume 11 (2), Pages 123–148, 2009.
Darko Dimitrov, Tomáš Dvořák, Petr Gregor, Riste Škrekovski
[bibtex]On Wiener Index of Graphs and Their Line Graphs
Technical Report B 09-03, Institut für Informatik, Freie Universität Berlin, December 2009.
Nathann Cohen, Darko Dimitrov, Roi Krakovski, Vida Vukašinović, Riste Škrekovsi
[bibtex]