bibliographie - Freie Universität Berlin

424 FB Mathematik und Informatik
4458
Dimitrov, Darko; Horev, Elad; Krakovski, Roi
Polychromatic 4–coloring of rectangular partitions
in: European Workshop on Computational
Geometry : Collection of
abstracts of the 24th European Workshop on
Computational Geometry : LORIA, Laboratoire
Lorrain de Recherche en Informatique et ses
Applications ; Nancy, France March 18 – 20,
2008 ; EuroCG’08 / [ed.] Sylvain Petitjean. –
Vandoeuvre, 2008. – S. 79–81
URL:
http://eurocg08.loria.fr/EuroCG08Abstracts.pdf
4459
Dimitrov, Darko; Knauer, Christian; Kriegel,
Klaus; Stehn, Fabian
Approximate point–to–surface registration with a
single characteristic point
in: International Conference on Computer Vision
Theory and Applications :
Proceedings of the Third International
Conference on Computer Vision Theory and
Applications : Funchal, Madeira, Portugal, 22 –
25 January 2008 ; VISAPP 2008 / co–org. by
INSTICC, Institute for Systems and Technologies
of Information, Control and Communication ...
[Ed. by Alpesh–Kumar N. Ranchordas ...]. –
[Setúbal]: INSTICC Press, 2008. – Bd. 1. – S.
188–195
4460
Dimitrov, Darko; Rote, Günter; Sturm, Astrid
PL–approximation of convex surfaces in 3D by
the sandwich algorithm. – [S.l.], 2008. – 12 S.
(ACS technical report ; ACS–TR–242403–01)
URL:
http://acs.cs.rug.nl/acstr/ACS-TR-242403-01.pdf
4461
Drysdale, R. L. Scot; Rote, Günter; Sturm,
Astrid
Approximation of an open polygonal curve with a
minimum number of circular arcs and biarcs
in: Computational geometry. – 41 (2008), 1/2, S.
31–47
Auch frei zugänglich über die URL: http://www.in
f.fu-berlin.de/~rote/Papers/pdf/Approximation+of
+an+open+polygonal+curve+with+a+minimum+
number+of+circular+arcs+and+biarcs.pdf
4462
Knauer, Christian; Rote, Günter; Schlipf, Lena
Shortest inspection–path queries in simple
polygons
in: European Workshop on Computational
Geometry : Collection of
abstracts of the 24th European Workshop on
Computational Geometry : LORIA, Laboratoire
Lorrain de Recherche en Informatique et ses
Applications ; Nancy, France March 18 – 20,
2008 ; EuroCG’08 / [ed.] Sylvain Petitjean. –
Vandoeuvre, 2008. – S. 153–156
URL:
http://eurocg08.loria.fr/EuroCG08Abstracts.pdf
4463
Knauer, Christian; Scherfenberg, Marc
Approximate nearest neighbor search under
translation invariant Hausdorff distance
in: Algorithms and computation : 19th
international symposium, ISAAC 2008, Gold
Coast, Australia, December 15 – 17, 2008 ;
proceedings / Seok–Hee Hong ... (eds.). – Berlin
[u.a.]: Springer, 2008. – S. 532–543 (Lecture
notes in computer science ; 5369)
4464
Mulzer, Wolfgang; Rote, Günter
Minimum–weight triangulation is NP–hard
in: Association for Computing Machinery: Journal
of the ACM. – 55 (2008), 2, Artikel Nr. 11
Auch frei zugänglich über die URL: http://www.in
f.fu-berlin.de/~rote/Papers/postscript/Geometric
+clustering:+fixed-parameter+tractability+and+lo
wer+bounds+with+respect+to+the+dimension.ps
4465
Mumford, Elena; Scharf, Ludmila;
Scherfenberg, Marc
Inducing polygons of line arrangements
in: European Workshop on Computational
Geometry : Collection of
abstracts of the 24th European Workshop on
Computational Geometry : LORIA, Laboratoire
Lorrain de Recherche en Informatique et ses
Applications ; Nancy, France March 18 – 20,
2008 ; EuroCG’08 / [ed.] Sylvain Petitjean. –
Vandoeuvre, 2008. – S. 107–110
Auch frei zugänglich über die URL:
http://www.inf.fu-berlin.de/groups/ag-ti/uploads/tx
_tipublications/inducingEWCG08.pdf