Topology and Routing Problems: The Circular Frame

05/07/2021
by   Rak-Kyeong Seong, et al.
0

In this work, we solve the problem of finding non-intersecting paths between points on a plane with a new approach by borrowing ideas from geometric topology, in particular, from the study of polygonal schema in mathematics. We use a topological transformation on the 2-dimensional planar routing environment that simplifies the routing problem into a problem of connecting points on a circle with straight line segments that do not intersect in the interior of the circle. These points are either the points that need to be connected by non-intersecting paths or special `reference' points that parametrize the topology of the original environment prior to the transformation. When all the necessary points on the circle are fully connected, the transformation is reversed such that the line segments combine to become the non-intersecting paths that connect the start and end points in the original environment. We interpret the transformed environment in which the routing problem is solved as a new data structure where any routing problem can be solved efficiently. We perform experiments and show that the routing time and success rate of the new routing algorithm outperforms the ones for the A*-algorithm.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/17/2021

Topology for Substrate Routing in Semiconductor Package Design

In this work, we propose a new signal routing method for solving routing...
research
10/21/2022

Rerouting Planar Curves and Disjoint Paths

In this paper, we consider a transformation of k disjoint paths in a gra...
research
10/23/2017

Constrained Routing Between Non-Visible Vertices

In this paper we study local routing strategies on geometric graphs. Suc...
research
05/14/2017

ILP-based Alleviation of Dense Meander Segments with Prioritized Shifting and Progressive Fixing in PCB Routing

Length-matching is an important technique to bal- ance delays of bus sig...
research
05/14/2017

Post-Route Alleviation of Dense Meander Segments in High-Performance Printed Circuit Boards

Length-matching is an important technique to balance delays of bus signa...
research
08/09/2018

Testing Implementation of FAMTAR: Adaptive Multipath Routing

Flow-Aware Multi-Topology Adaptive Routing (FAMTAR) is a new approach to...
research
01/18/2022

Cutting Through the Noise to Infer Autonomous System Topology

The Border Gateway Protocol (BGP) is a distributed protocol that manages...

Please sign up or login with your details

Forgot password? Click here to reset