2008
[bibtex]Algorithmische Geometrie
Experimental Study of Bounding Box Algorithms
In Proceedings of International Conference on Computer Graphics Theory and Applications - GRAPP, Seiten 15–22, Funchal, Portugal, 2008.
Darko Dimitrov, Mathias Holst, Christian Knauer, Klaus Kriegel
[bibtex]Pseudo-triangulations –- a survey
In Surveys on Discrete and Computational Geometry–-Twenty Years Later, Contemporary Mathematics, Herausgeber Eli Goodman, János Pach, Richard Pollack, American Mathematical Society, December 2008.
Günter Rote, Francisco Santos, Ileana Streinu
to appear http://www.inf.fu-berlin.de/~rote/Papers/postscript/Pseudo-triangulations+-+a+survey.ps
Eprint: arXiv:math/0612672
[bibtex]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]Polyhromatic 4-Colorings of Rectangular Partitions
In Proc. 24th European Workshop on Computational Geometry, Seiten 79–81, Nancy, France, 2008.
Darko Dimitrov, Elad Horev, Roi Krakovski
[bibtex]Wooden Geometric Puzzles: Design and Hardness Proofs
Theory of Computing Systems, 2008.
Helmut Alt, Hans Bodlaender, Marc van Kreveld, Günter Rote, Gerard Tel
[bibtex]PL-approximation of convex surfaces in 3D by the sandwich algorithm
Technischer Bericht ACS-TR-242403-01, Freie Universität Berlin, May 2008.
Darko Dimitrov, Günter Rote, Astrid Sturm
[bibtex]Seed polytopes for incremental approximations of general surfaces in 3D
Technischer Bericht ACS-TR-362500-01, Freie Universität Berlin, May 2008.
O. Aichholzer, F. Aurenhammer, T. Hackel, B. Kornberger, S. Plantinga, Günter Rote, Astrid Sturm, G. Vegter
[bibtex]Shortest Inspection-Path Queries in Simple Polygons
In Proceedings of the 24th European Workshop on Computational Geometry (EuroCG), Seiten 153–156, Nancy, France, March 2008.
Christian Knauer, Günter Rote, Lena Schlipf
[bibtex]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]Covering a Simple Polygon by Monotone Directions
In Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC 2008), Lecture Notes in Computer Science (LNCS 5369), Seiten 668–679, Herausgeber S.-H. Hong and H. Nagamochi and T. Fukunaga, Springer-Verlag Berlin Heidelberg, December 2008.
Hee-Kap Ahn, Peter Brass, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin
[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]
Dynamische Geometrie
An Algorithm for the Tracing Problem Using Interval Analysis
In SAC 2008; session Geometric constraints and reasoning, Seiten 1832–1837, 2008.
Britta Denner-Broser
[bibtex]Tracing-Problems in Dynamic Geometry
Doktorarbeit, FU-Berlin, Fachbereich Mathematik und Informatik, 2008.
Britta Denner-Broser
DissOnline
[bibtex]
Geometrische Optimierungsprobleme
Matching point sets with respect to the Earth Mover's Distance
Computational Geometry, Theory and Applications, Band 39, Seiten 118–133, 2008.
Sergio Cabello, Panos Giannopoulos, Christian Knauer, Günter Rote
http://www.inf.fu-berlin.de/~rote/Papers/pdf/Matching+point+sets+with+respect+to+the+earth+movers+distance.pdf
[bibtex]Minimum-weight triangulation is NP-hard
Journal of the Association for Computing Machinery, Seiten 31 pp., 2008.
Wolfgang Mulzer, Günter Rote
to appear http://www.inf.fu-berlin.de/~rote/Papers/postscript/Minimum-weight+triangulation+is+NP-hard.ps
[bibtex]Approximation of an open polygonal curve with a minimum number of circular arcs and biarcs
Computational Geometry, Theory and Applications (Special Issue on the 22nd EuroCG), Band 41, Seiten 31–47, October 2008.
Scot Drysdale, Günter Rote, Astrid Sturm
[pdf]
[bibtex]Geometric clustering: fixed-parameter tractability and lower bounds with respect to the dimension
In Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), San Francisco, 2008.
Sergio Cabello, Panos Giannopoulos, Christian Knauer, Günter Rote
[ps]
[bibtex]
Geometrische Muster- und Formenerkennung
Shape matching by random sampling
Technischer Bericht B 08-02, Freie Universität Berlin, 2008.
Helmut Alt, Ludmila Scharf
[bibtex] [pdf]Approximate point-to-surface registration with a single characteristic point
In Proceedings of International Conference on Computer Vision Theory and Applications - VISAPP, Seiten 188-195, Funchal, Portugal, 2008.
Darko Dimitrov, Christian Knauer, Klaus Kriegel, Fabian Stehn
[bibtex]Similarity Evaluation based on Image Primitives
In The Fifth IASTED International Conference on Signal Processing, Pattern Recognition, and Applications (SPPRA), Innsbruck, Austria, February 2008.
Sven Scholz
[bibtex]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]
Geometrie
On the maximum size of an anti-chain of $k$-sets and convex pseudo-discs
Israel Journal of Mathematics, June 2008.
Rom Pinchasi, Günter Rote
Eprint:arXiv:0707.0311
[ps]
[bibtex]There are not too many Magic Configurations
Discrete and Computational Geometry, Band 39 (1), Seiten 3–16, Springer-Verlag New York, Inc., Secaucus, NJ, USA, 2008.
Eyal Ackerman, Kevin Buchin, Christian Knauer, Rom Pinchasi, Günter Rote
doi:10.1007/s00454-007-9023-0
[ps]
[bibtex]
