Ignoring the bovine references and attempting to answer the question: Topological routing means using the connectivity graph of the system to generate geometrical constraints, and also to generate specific geometry for say traces or polygons. It's called that because it uses concepts from the discipline of topology such as Delauney triangulations, neighbourhood graphs, Voronoi diagrams, straight skeletons, etc. It means you can, for instance, make a set of traces that follow a path maximally distant from each obstacle, giving you maximum routing space around each trace. A number of autorouting algorithms are based on topological concepts, in this case however it specifically refers to generating trace shapes such that they have the maximum distance from each obstacle at each point along their path, as opposed to being constrained to straight line segments.
Hope this is helpful. On 02.12.19 17:59, Tomasz Wlostowski wrote: > On 02/12/2019 17:40, Vesa Solonen wrote: >> topological routing will > > Could you please explain what 'topological routing' does mean (other > than being marketing buzzword used by some companies) and what exactly > it has to do with topology [1]? > > Tom > > [1] https://en.wikipedia.org/wiki/Topology > > > > _______________________________________________ > Mailing list: https://launchpad.net/~kicad-developers > Post to : kicad-developers@lists.launchpad.net > Unsubscribe : https://launchpad.net/~kicad-developers > More help : https://help.launchpad.net/ListHelp > _______________________________________________ Mailing list: https://launchpad.net/~kicad-developers Post to : kicad-developers@lists.launchpad.net Unsubscribe : https://launchpad.net/~kicad-developers More help : https://help.launchpad.net/ListHelp
