14 Second Program Visualization Workshop The Algorithm Animation Repository (2007)
Pierluigi Crescenzi, Nils Faltin, Rudolf Fleischer, Christopher Hundhausen, Stefan Näher, Guido Rößling, ...
As researchers in theoretical or practical computer science, we are used to publishing our results in form of research papers that appear in conference proceedings or journals. Journals are normally...
Engineering DFS-Based Graph Algorithms (2007)
Kurt Mehlhorn, Stefan Näher, Peter S
Depth-first search (DFS) is the basis for many efficient graph algorithms. We introduce general techniques for efficient implementations of DFS-based graph algorithms and exemplify them on three...
Two Computational Geometry Libraries: LEDA and CGAL (2004)
Kettner, Lutz, Näher, Stefan, Goodman, Jacob E., O'Rourke, Joseph
Two Computational Geometry Libraries: LEDA and {CGAL} (2004)
Kettner, Lutz, Näher, Stefan, Goodman, Jacob E., O'Rourke, Joseph
Experiments on Curve Reconstruction (2000)
Ernst Althaus, Kurt Mehlhorn, Stefan Näher, Stefan Schirra
An instance of the curve reconstruction problem is a finite sample V of an unknown curve gamma...
Experiments on curve reconstruction (2000)
Althaus, Ernst, Mehlhorn, Kurt, Näher, Stefan, Schirra, Stefan
Implementation of $O(nm \log n)$ weighted matchings: The power of data structures (2000)
Mehlhorn, Kurt, Schäfer, Guido, Näher, Stefan, Wagner, Dorothea
We describe the implementation of an $O(nm \log n)$ algorithm for weighted matchings in general graphs. The algorithm is a variant of the algorithm of Galil, Micali, and Gabow and requires the use of...
Structural filtering: A paradigm for efficient and exact geometric programs (1999)
Stefan Funke, Kurt Mehlhorn, Stefan Näher
We introduce a new filtering technique that can be used in the implementation of geometric algorithms called "structural filtering". Using this filtering techniques we gain about 20 % when...
Structural Filtering - A Paradigm for Efficient and Exact Geometric Programs (1999)
Stefan Funke, Kurt Mehlhorn, Stefan Näher
We introduce a new and simple filtering technique that can be used in the implementation of geometric algorithms called "structural filtering". Using this filtering technique we gain about...
Checking geometric programs or verification of geometric structures (1999)
Mehlhorn, Kurt, Näher, Stefan, Seel, Michael, Seidel, Raimund, Schilz, Thomas, Schirra, Stefan, ...
LEDA: a platform for combinatorial and geometric computing (1999)
Contents Preface page xi 1 Introduction 1 1.1 Some Programs 1 1.2 The LEDA System 8 1.3 The LEDA Web-Site 10 1.4 Systems that Go Well with LEDA 11 1.5 Design Goals and Approach 11 1.6 History 13 2...
A Library of Algorithms for Graph Drawing (1998)
Mutzel, Petra, Gutwenger, Carsten, Brockenauer, Ralf, Fialko, Sergej, Klau, Gunnar W., Krüger, Michael, ...
No Abstract
A Library of Algorithms for Graph Drawing (1998)
Mutzel, Petra, Gutwenger, Carsten, Brockenauer, Ralf, Fialko, Sergej, Klau, Gunnar W., Krüger, Michael, ...
No Abstract
A Library of Algorithms for Graph Drawing (1998)
Mutzel, Petra, Gutwenger, Carsten, Brockenauer, Ralf, Fialko, Sergej, Klau, Gunnar W., Krüger, Michael, ...
No Abstract
From Algorithms to Working Programs On the Use of Program Checking in LEDA (1998)
. We report on the use of program checking in the LEDA library of efficient data types and algorithms. 1 Introduction LEDA [MN95,MNU97,MN98] is a collection of implementations of data structures and...
A computational basis for higher-dimensional computational geometry and applications (1998)
Mehlhorn, Kurt, Müller, Michael, Näher, Stefan, Schirra, Stefan, Seel, Michael, Uhrig, Christian, ...
From Algorithms to Working Programs: On the Use of Program Checking in LEDA (1998)
Mehlhorn, Kurt, Näher, Stefan, Brim, Lubos, Gruska, Jozef, Zlatuska, Jirí
AGD-Library: A Library of Algorithms for Graph Drawing (1997)
David Alberts, Carsten Gutwenger, Petra Mutzel, Stefan Näher
A graph drawing algorithm produces a layout of a graph in two- or three-dimensional space that should be readable and easy to understand. Since the aesthetic criteria differ from one application area...
AGD-Library: A Library of Algorithms for Graph Drawing (1997)
David Alberts, Carsten Gutwenger, Petra Mutzel, Stefan Näher
A graph drawing algorithm produces a layout of a graph in two- or three-dimensional space that should be readable and easy to understand. Since the aesthetic criteria differ from one application area...
Ulrike Bartuschka, Kurt Mehlhorn, Stefan Näher
We describe a robust and efficient implementation of the Bentley-Ottmann sweep line algorithm [1] based on the LEDA platform of combinatorial and geometric computing [9, 8]. The program computes the...
A Computational Basis for Higher-dimensional Computational Geometry and Applications (1997)
Mehlhorn, Kurt, Müller, Michael, Näher, Stefan, Schirra, Stefan, Seel, Michael, Uhrig, Christian, ...
The LEDA platform for combinatorial and geometric computing (1997)
Mehlhorn, Kurt, Näher, Stefan, Uhrig, Christian, Degano, Pierpaolo, Gorrieri, Roberto, Marchetti-Spaccamela, Alberto
Higher-dimensional Convex Hulls and Delaunay Triangulations Specification and Implementation (1996)
Kurt Mehlhorn, Michael Müller, Stefan Näher, Joachim Ziegler
Introduction We discuss the specification and implementation of the data types convex hull and Delaunay triangulation for higher-dimensional space. We aimed for ffl rich functionality and ease of use...
ion and Object-Oriented Programming in C++ ", John Wiley & Sons, 1990 [26] L.J. Guibas, R. Sedgewick: " A Dichromatic Framework for Balanced Trees", Proceedings of the 19th IEEE...
Checking Geometric Programs or Verification of Geometric Structures (1996)
Kurt Mehlhorn Stefan, Stefan Näher, Michael Seel, Raimund Seidel, Thomas Schilz, Stefan Schirra, ...
A program checker verifies that a particular program execution is correct. We give simple and efficient program checkers for some basic geometric tasks. We report about our experiences with program...
Checking Geometric Programs or Verification of Geometric Structures (1996)
Mehlhorn, Kurt, Näher, Stefan, Schilz, Thomas, Schirra, Stefan, Seel, Michael, Seidel, Raimund, ...
The LEDA Platform for Combinatorial and Geometric Computing (1996)
Mehlhorn, Kurt, Näher, Stefan, Uhrig, Christian, Mayr, Heinrich C.
LEDA - A Platform for Combinatorial and Geometric Computing (1995)
Kurt Mehlhorn, Stefan Näher, Stefan N Aher
Contents Preface page xi 1 Introduction 1 1.1 Some Programs 1 1.2 The LEDA System 8 1.3 The LEDA Web-Site 10 1.4 Systems that Go Well with LEDA 11 1.5 Design Goals and Approach 11 1.6 History 13 2...
LEDA - A Platform for Combinatorial and Geometric Computing (1995)
LEDA is a library of efficient data types and algorithms in combinatorial and geometric computing. The main features of the library are its wide collection of data types and algorithms, the precise...
Exact Geometric Computation in LEDA (1995)
Burnikel, Christoph, Könemann, Jochen, Mehlhorn, Kurt, Näher, Stefan, Schirra, Stefan, Uhrig, Christian
LEDA : A Platform for Combinatorial and Geometric Computing (1995)
LEDA is a library of efficient data types and algorithms in combinatorial and geometric computing. The main features of the library are its wide collection of data types and algorithms, the precise...
An Implementation of the Hopcroft and Tarjan Planarity Test and Embedding Algorithm (1993)
Kurt Mehlhorn, Petra Mutzel, Stefan Näher
We describe an implementation of the Hopcroft and Tarjan planarity test and embedding algorithm. The program tests the planarity of the input graph and either constructs a combinatorial embedding (if...
An Implementation of the Hopcroft and Tarjan Planarity Test and Embedding Algorithm (1993)
Kurt Mehlhorn, Petra Mutzel, Stefan Näher
We describe an implementation of the Hopcroft and Tarjan planarity test and embedding algorithm. The program tests the planarity of the input graph and either constructs a combinatorial embedding (if...
Alt, Helmut, Fleischer, Rudolf, Kaufmann, Michael, Mehlhorn, Kurt, Näher, Stefan, Schirra, Stefan, ...
Selected Topics from Computational Geometry, Data Structures and Motion Planning (1992)
Fleischer, Rudolf, Fries, Otfried, Mehlhorn, Kurt, Meiser, Stefan, Näher, Stefan, Rohnert, Hans, ...
Alt, Helmut, Fleischer, Rudolf, Kaufmann, Michael, Mehlhorn, Kurt, Näher, Stefan, Schirra, Stefan, ...
A faster compaction algorithm with automatic jog insertion (1990)
The work of F.M. Maley (Proc. Chapel Hill Conf. on VLSI, p.261-83, 1985) on one-dimensional compaction with automatic jog insertion is refined. More precisely, an algorithm with running time...
LEDA: A library of efficient data types and algorithms (1989)
Mehlhorn, Kurt, Näher, Stefan, Kreczmar, Antoni, Mirkowska, Grazyna