In this paper, the sampling-based global path planning algorithms RRT and PRM, and the graph search-based global path planning algorithms A* and Dijkstra are selected for testing. Finally, the average ...

In this paper we present a parallel formulation of a multilevel k-way graph partitioning algorithm. A key feature of this parallel formulation is that it is able to achieve a high degree of ...

When compared to hMetis, a well known multilevel partitioning algorithm, our algorithm produces a superior speedup and a reduced cut-size. Published in: 2008 37th International Conference on Parallel ...

Streaming algorithms for graph partitioning has recently gained attention due to its ability to scale very large graphs with limited resources. This study first characterizes streaming algorithms for ...

This package provides a generic implementation of the quadtree spatial partitioning algorithm. The aim of this package is to provide an out of the box working solution for simple 2D spatial ...

In this study, a dynamic programming approach to deal with the unconstrained two-dimensional non-guillotine cutting problem is presented. The method extends the recently introduced recursive ...