2007
[bibtex]Kombinatorische Geometrie
Embedding 3-Polytopes on a Small Grid
In SCG '07: Proceedings of the twenty-third annual symposium on Computational geometry, Seiten 112–118, ACM, New York, NY, USA, 2007.
Ares Ribo Mor, Günter Rote, André Schulz
[bibtex]On the Number of Cycles in Planar Graphs
In Proc. 13th International Computing and Combinatorics Conference (COCOON), Seiten 97–107, 2007.
Kevin Buchin, Christian Knauer, Klaus Kriegel, André Schulz, Raimund Seidel
[bibtex] [ps] [pdf]On Rolling Cube Puzzles
In Proceedings of the 19th Canadian Conference on Computational Geometry, Seiten 141–144, 2007.
Kevin Buchin, Maike Buchin, Erik D. Demaine, Martin L. Demaine, Dania El-Khechen, Sándor Fekete, Christian Knauer, André Schulz, Perouz Taslakian
[bibtex]Wooden Geometric Puzzles: Design and Hardness Proofs
In Fun with Algorithms 4th International Conference (FUN2007), Lecture Notes in Computer Science, Seiten 16-29, Springer Berlin / Heidelberg, Castiglioncello, Italy, June 2007.
Helmut Alt, Hans L. Bodlaender, Marc J. van Kreveld, Günter Rote, Gerard Tel
[bibtex]
Algorithmische Geometrie
Detection of Perfect and Approximate Reflective Symmetry in Arbitrary Dimension
In Proceedings of International Conference on Computer Vision Theory and Applications - VISAPP 2007, Seiten 128–136, Barcelona, Spain, 2007.
Darko Dimitrov, Klaus Kriegel
[bibtex]Upper and Lower Bounds on the Quality of the PCA Bounding Boxes
In Proceedings of the International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision - WSCG 2007, Seiten 185–192, Plzen, Czech Republic, 2007.
Darko Dimitrov, Christian Knauer, Klaus Kriegel, Günter Rote
[bibtex]How Difficult is it to Walk the Dog?
In Proc. 23rd European Workshop on Computational Geometry, Seiten 170–173, Graz, Austria, March 2007.
Kevin Buchin, Maike Buchin, Christian Knauer, Günter Rote, Carola Wenk
[bibtex]Convex Approximation by Spherical Patches
In Proc. 23rd European Workshop on Computational Geometry, Seiten 26–29, Graz, Austria, March 2007.
Kevin Buchin, Simon Plantinga, Günter Rote, Astrid Sturm, Gert Vegter
[bibtex]Transforming Spanning Trees: A Lower Bound
In Proc. 23rd European Workshop on Computational Geometry, Seiten 166–169, Graz, Austria, March 2007.
Kevin Buchin, Andreas Razen, Takeaki Uno, Uli Wagner
[bibtex]New Upper Bounds on the Quality of the PCA Bounding Boxes in R^2 and R^3
In Proc. 23rd ACM Symp. on Computational Geometry, Seiten 275–283, ACM, Gyeongju, South Korea, 2007.
Darko Dimitrov, Christian Knauer, Klaus Kriegel, Günter Rote
[bibtex]New Upper Bounds on the Quality of the PCA Bounding Boxes in R^2 and R^3 (Extended Abstract)
In Proceedings of the 23rd European Workshop on Computational Geometry (EWCG), Seiten 122–125, Graz, Austria, 2007.
Darko Dimitrov, Christian Knauer, Klaus Kriegel, Günter Rote
[bibtex]Carpenter's Rule Packings - A Lower Bound
In 23rd European Workshop on Computational Geometry, Seiten 34 - 37, Graz, Austria, March 2007.
Oliver Klein, Tobias Lenz
[bibtex]Minimum-Dilation Tour is NP-hard
In 23rd European Workshop on Computational Geometry, Seiten 18 - 25, Graz, Austria, March 2007.
Panos Giannopoulos, Christian Knauer, D. Marx
[bibtex]Small Manhattan Networks and Algorithmic for the Earth Mover's Distance
In 23rd European Workshop on Computational Geometry, Seiten 174 - 177, Graz, Austria, March 2007.
J. Gudmundsson, Oliver Klein, Christian Knauer, M. Smid
[bibtex]Can we Compute the Similarity Between Surfaces?
Seiten pp. 21, 2007.
Helmut Alt, Maike Buchin
http://www.citebase.org/abstract?id=oai:arXiv.org:cs/0703011
[bibtex]Constructing Optimal Highways
In Thirteenth Computing: The Australasian Theory Symposium (CATS2007), CRPIT, Band 65, Seiten 7-14, Herausgeber Joachim Gudmundsson, Barry Jay, ACS, Ballarat, Australia, 2007.
Hee-Kap Ahn, Helmut Alt, Tetsuo Asano, Sang Won Bae, Peter Braß, Otfried Cheong, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Alexander Wolff
[bibtex]Computing the Fr\'echet distance between piecewise smooth curves
Computational Geometry, Theory and Applications, Band 37, Seiten 162–174, 2007.
Günter Rote
Doi: doi:10.1016/j.comgeo.2005.01.004
[ps]
[bibtex]Vertex Guards in Rectilinear Polygons with Holes
In The Kyoto International Conference on Computational Geometry and Graph Theory (Abstracts), Seiten Session 04A, 2 pages, Kyoto, Japan, 2007.
Frank Hoffmann, Klaus Kriegel, Csaba Toth
[bibtex]Approximation of polygonal curves with minimum number of biarcs
Technischer Bericht ACS-TR-242300-02, Freie Universität Berlin, May 2007.
Scot Drysdale, Günter Rote, Astrid Sturm
[bibtex]Library of benchmark instances for surface approximation
Technischer Bericht ACS-TR-243304-01, Freie Universität Berlin, May 2007.
Astrid Sturm
[bibtex]CGAL package for piecewise approximation of curves by pieces of higher order
Technischer Bericht ACS-TR-243401-01, Freie Universität Berlin, May 2007.
Felix Jachan, Astrid Sturm
[bibtex]Spherical approximation of convex shapes
Technischer Bericht ACS-TR-362501-01, Freie Universität Berlin, May 2007.
Kevin Buchin, Simon Plantinga, Günter Rote, Astrid Sturm, Gert Vegter
[bibtex]
Geometrische Optimierungsprobleme
Inflating the Cube by Shrinking
In Proc. 23rd European Workshop on Computational Geometry, Seiten 46–49, Graz, Austria, March 2007.
Kevin Buchin, Igor Pak, André Schulz
[bibtex] [htm]Inflating the Cube by Shrinking (Multimedia Abstract)
In SCG '07: Proceedings of the twenty-third annual symposium on Computational geometry, Seiten 125–126, ACM, Gyeongju, South Korea, 2007.
Kevin Buchin, André Schulz
[doi]
[bibtex] [htm]Minimum-weight triangulation is NP-hard
Technischer Bericht B-05-23-revised, Seiten pp. 45, Freie Universität Berlin, 2007.
Wolfgang Mulzer, Günter Rote
arXiv:cs/0601002
[ps]
[bibtex]
Geometrische Muster- und Formenerkennung
Approximation algorithms for a point-to-surface registration problem in medical navigation
In Proc. Frontiers in Algorithmics Workshop, Lecture Notes in Computer Science, Band 4613, Seiten 26–37, Springer, Lanzhou, China, 2007.
Darko Dimitrov, Christian Knauer, Klaus Kriegel, Fabian Stehn
[bibtex]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]
Geometrie
There are not too many Magic Configurations
In SCG '07: Proceedings of the twenty-third annual symposium on Computational geometry, Seiten 142–149, ACM, Gyeongju, South Korea, 2007.
Eyal Ackerman, Kevin Buchin, Christian Knauer, Rom Pinchasi, Günter Rote
Doi: doi:10.1145/1247069.1247098
[ps]
[bibtex]Planar embeddings of graphs with specified edge lengths
Journal of Graph Algorithms and Applications, Band 11 (1), Seiten 259–276, 2007.
Sergio Cabello, Erik D. Demaine, Günter Rote
[pdf]
[bibtex]
Graphentheorie und Algorithmen
Gray Codes Faulting Matchings
Technischer Bericht B 07-13, Seiten pp. 22, Institut für Informatik, Freie Universität Berlin, July 2007.
Darko Dimitrov, Tomáš Dvořák, Petr Gregor, and Riste Škrekovski
[bibtex] [pdf]Pointed Drawings of Planar Graphs
In Proceedings of the 19th Canadian Conference on Computational Geometry, Seiten 237–240, 2007.
Oswin Aichholzer, Günter Rote, André Schulz, Birgit Vogtenhuber
[bibtex]Efficient Extraction of Multiple Kuratowski Subdivisions
In 15th International Symposium on Graph Drawing, LNCS 4875, Seiten 159–170, Springer, Sydney, 2007.
Markus Chimani, Petra Mutzel, Jens Schmidt
[bibtex]Efficient Extraction of Multiple Kuratowski Subdivisions
Technischer Bericht TR07-1-002, Seiten pp 17, Chair for Algorithm Engineering, Dep. of Comp. Science, University of Dortmund, June 2007.
Markus Chimani, Petra Mutzel, Jens Schmidt
[bibtex] [pdf]Effiziente Extraktion von Kuratowski-Teilgraphen
Diplomarbeit, Department of Computer Science, University of Dortmund, ISSN 1864-4503, March 2007.
Jens Schmidt
[pdf]
[bibtex]
Bildverarbeitung
OBJECT CUT AND PASTE IN IMAGES AND VIDEOS
International Journal of Semantic Computing, Band 1 (2), Seiten 1–27, 2007.
Gerald Friedland, Kristian Jantz, Tobias Lenz, Raul Rojas, Fabian Wiesel
[bibtex]
Optimierungsprobleme
Matrix scaling by network flow
In Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), New Orleans, Seiten 848-854, New Orleans, USA, January 2007.
Günter Rote, M. Zachariasen
[ps]
[bibtex]Obnoxious centers in graphs
In Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Seiten 98-107, New Orleans, January 2007.
Sergio Cabello, Günter Rote
doi:10.1145/1283383.1283395
[ps]
[bibtex]
Sensor- und Ad-hoc-Netzwerke
Topology Control
In Algorithms for Sensor and Ad Hoc Networks, Lecture Notes in Computer Science, Band 4621, Seiten 81–98, Herausgeber Dorothea Wagner and Roger Wattenhofer, Springer, 2007.
Kevin Buchin, Maike Buchin
Springer LNCS
[bibtex]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]