Items where Subject is "68-XX Computer science > 68Uxx Computing methodologies and applications > 68U05 Computer graphics; computational geometry"

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Authors | Item Type
Jump to: A | B | F | G | H
Number of items at this level: 18.

A

Arkin, Esther M. and Fekete, Sandor P. and Mitchell, Joseph S. B. (2000) Approximation algorithms for lawn mowing and milling.
Published in: Computational geometry : theory and applications Vol. 17 (1-2). pp. 25-50.

B

Bastert, Oliver and Fekete, Sandor P. (1998) Geometric Wire Routing.
Technical Report p.

Bastert, Oliver and Fekete, Sandor P. (1996) Geometrische Verdrahtungsprobleme.
Technical Report , 81 p.

Baur, Christoph and Fekete, Sandor P. (1998) Approximation of Geometric Dispersion Problems.
Published In: Approximation algorithms for combinatorial optimization : proceedings / International Workshop APPROX '98, Aalborg, Denmark, July 18 - 19, 1998, Lecture notes in computer science. 1444 Springer 1998, pp. 63-75.

Baur, Christoph and Fekete, Sandor P. (2001) Approximation of Geometric Dispersion Problems.
Published in: Algorithmica Vol. 30 (3). pp. 451-470.

Borgwardt, Karl H. and Gaffke, Norbert and Jünger, Michael and Reinelt, Gerhard (1991) Computing the Convex Hull in the Euclidean plane in Linear Expected time. DIMACS Series in Discrete Mathematics and Theorical Computer Science , pp. 91-107. DIMACS.

Brandenburg, Franz J. and Jünger, Michael and Mutzel, Petra (1997) Algorithmen zum automatischen Zeichnen von Graphen ( Kurzversion).
Published in: Informatik ´97 : Informatik als Innovationsmotor ; Aachen, 24. - 26. September 1997., Informatik aktuell. Springer 1997, pp. 58-67.

F

Fekete, Sandor P. (1992) Finding all anchored squares in a convex polygon in subquadratic time.
Published In: Proceedings of the Fourth Canadian Conference on Computational Geometry : St. John’s, Newfoundland, August 10 - 14, 1992 Memorial Univ. of Newfoundland, Dep. of Computer Science 1992, pp. 71-76.

Fekete, Sandor P. and Mitchell, Joseph S. B. (1997) Histogram decomposition and stereolithography.
Technical Report , 13 p.

Fekete, Sandor P. and Mitchell, Joseph S. B. and Weinbrecht, Karin (2000) On the continuous Weber and k-median problems.
Published In: Proceedings of the Sixteenth Annual Symposium on Computational Geometry : SCG '00 ; June 12 - 14, 2000, Hong Kong ACM 2000, pp. 70-79.

Fekete, Sandor P. and Woeginger, Gerhard J. (1997) Angle-Restricted Tours in the Plane.
Published in: Computational Geometry Vol. 8 (4). pp. 195-218.

G

Gutwenger, Carsten and Jünger, Michael and Klau, Gunnar W. and Leipert, Sebastian and Mutzel, Petra and Weiskircher, René (2002) AGD - A library of Algorithms for Graph Drawing. Lecture Notes in Computer Science (2265), pp. 473-474. Springer, Berlin. ISBN 3-540-43309-0

Gutwenger, Carsten and Jünger, Michael and Klau, Gunnar W. and Leipert, Sebastian and Mutzel, Petra and Weiskircher, René (2002) AGD: A Library of Algorithms for Graph Drawing (Software Demonstration).
Published In: Graph Drawing : 9th international symposium, GD 2001, Vienna, Austria, September 23 - 26, 2001, Lecture Notes in Computer Science. 2265 Springer 2002, pp. 473-474.

Gutwenger, Carsten and Jünger, Michael and Klein, Karsten and Kupke, Joachim and Leipert, Sebastian and Mutzel, Petra (2002) Caesar Automatic Layout of UML Class Diagrams (Software Demonstration).
Published In: Graph Drawing : 9th international symposium, GD 2001, Vienna, Austria, September 23 - 26, 200, Lecture Notes in Computer Science. 2265 Springer 2002, pp. 461-462.

H

Hachul, Stefan and Jünger, Michael (2007) Large-Graph Layout Algorithms at Work: An Experimental Study.
Published in: Journal of Graph Algorithms and Applications Vol. 11 (21). pp. 345-369.

Hochstättler, Winfried (1993) A Note on the Weak-Zone-Theorem.
Published in: Congressus Numerantium Vol. 98. pp. 95-103.

Hochstättler, Winfried (1992) Seitenflächenverbände orientierter Matroide. ["eprint_fieldopt_thesis_type_phd" not defined] thesis.

Hochstättler, Winfried and Kromberg, Stephan and Moll, Christoph (1994) A new Linear Time Algorithm for Computing the Convex Hull of a Simple Polygon in the Plane.
Technical Report , 12 p.

This list was generated on Sun Oct 22 19:17:54 2017 CEST.