Searching for "The LEDA Platform of Combinatorial and Geometric Computing." – sorted by Relevance.
-
LEDA: A Platform for Combinatorial and Geometric Computing
- 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
- 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
- ++ 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
- 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
- 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
- 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
- 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
- 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
- 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

