MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "The LEDA Platform of Combinatorial and Geometric Computing." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

9 documents found, showing 1 through 9.

ATOM

LEDA: A Platform for Combinatorial and Geometric Computing
by Kurt Mehlhorn, Christian Uhrig — 1999
…The LEDA Platform for Combinatorial and Geometric Computing Kurt Mehlhorn* and Stefan N…
Cited by 545 (38 self) – Add To MetaCart

A Robust and Efficient Implementation of a Sweep Line Algorithm for the Straight Line Segment Intersection Problem
by Ulrike Bartuschka, Kurt Mehlhorn, Stefan Näher — 1997 — In Proc. Workshop on Algorithm Engineering
… of combinatorial and geometric computing [9, 8]. The program computes the planar graph G induced by a set…
Cited by 5 (0 self) – Add To MetaCart

AGD-Library: A Library of Algorithms for Graph Drawing
by David Alberts, Carsten Gutwenger, Petra Mutzel, Stefan Näher — 1997
…++ using the LEDA platform for combinatorial and geometric computing ([16, 17]). The algorithms…
Cited by 10 (3 self) – Add To MetaCart

Exact Geometric Computation in LEDA
by C. Burnikel, J. Könemann, K. Mehlhorn, S. Näher, S. Schirra, C. Uhrig — 1995 — In Proc. 11th Annu. ACM Sympos. Comput. Geom
… arithmetic. In the LEDA platform of combinatorial and geometric computation [4] the new data-type real…
Cited by 36 (5 self) – Add To MetaCart

On the Embedding Phase of the Hopcroft and Tarjan Planarity Testing Algorithm
by Kurt Mehlhorn, Petra Mutzel — Algorithmica
… on this note is described in [MMN93] and is distributed with the LEDA platform of combinatorial and geometric…
Cited by 29 (6 self) – Add To MetaCart

Design and Implementation of Efficient Data Types for Static Graphs
by Stefan Näher, Oliver Zlotowski — 2002
… Introduction The LEDA platform for combinatorial and geometric computing [1-3] contains a very powerful…
Add To MetaCart

An Implementation of the Hopcroft and Tarjan Planarity Test and Embedding Algorithm
by An Implementation Of The, Kurt Mehlhorn, Petra Mutzel, Stefan Näher — 1993
… is based on the LEDA platform of combinatorial and geometric computing [Nae93, MN89]. It is part…
Add To MetaCart

Implementation of a Sweep Line Algorithm for the Straight Line Segment Intersection Problem
by Kurt Mehlhorn, Stefan Näher — 1994 — TR MPI-I-94-105, Max-Planck-Institut fur Informatik, Saarbrucken
… for combinatorial and geometric computing [7, 7]. In LEDA a rat segment is specified by its two endpoints (of type…
Cited by 7 (2 self) – Add To MetaCart

An Implementation of the Hopcroft and Tarjan Planarity Test and Embedding Algorithm
by Kurt Mehlhorn, Petra Mutzel, Stefan Näher — 1993
… on the LEDA platform of combinatorial and geometric computing [MNU97, KN89]. It is part of the LEDA…
Cited by 3 (0 self) – Add To MetaCart

Showing 1 through 9.

ATOM

Try your query at: Scholar | Yahoo! | Ask | MS Live | CSB