Bestand wählen
Merken

Interactive PCB Routing

Zitierlink des Filmsegments
Embed Code

Automatisierte Medienanalyse

Beta
Erkannte Entitäten
Sprachtranskript
on several my somewhat of the I would hazard a guess was often presented to the the error simulator together with other and the I'm going to talk about the some technicalities is going to be more often boring geometry and not uh some of the ideas and algorithms that bedeviled for the interacting with the uh the contributed to keep
so the outline is 1st of all a little bit of introduction to the routine algorithms might storage model used in in know the then the core of the which is the essential and algorithm summer for some of your optimization strategies and skeleton status and the future improvements I apologize in advance had been roasting very quickly to the slides because the only 1 in this talk and maturity when basal Allegheny hundreds of representation so what is it maybe instead of just reading this was showing a little them all so basically there
ruled rotting here the capability of being able yeah the late lighting phrases as you wrote this saves a lot of time you can modify your PC if you need to interact and in here for instance we have a lot of places we want to make space the new 1 that's it can imagine moving noticed about takes a little time scientists dragging object so basically this is what interacting rotten about and it's a de-facto standard all
proprietary software from midrange too high a I so why is that well and the reason is the time and so if the if you HCH how because it this include control of all of the above overlay of the guests in the end this and what places get used to the faces and faces are laid them in the other room we don't have such all and even if you plan to the 1st to spend time on the union and then spend a lot of time cleaning the results of know all the work so let's get in the
technical stuff so geometries shape his operates simple geometric primitives I am to 3 I can to use users of so-called solid segments and bias so so Lisa fixed items such as fonts people there people areas of the BOLD of about outlines bias are well just by segments our simple straight line segments of non-zero thickness of connected points in both space and the port which ensure logarithmic we have yet another right in the set jails segments on the same layer of same with ending at 2 different points of for little and possibly with a buyer and and and I will call it a lot so this shape-based based approach let's as the and new PCB replica features just by adding new shapes the can the storage model to this is the the other part of that is quite important for the 1st 4 months the just being able to read the staff in the real-time interactive so it needs to provide the population so and it is to provide a fast and robust way of this solving the connectivity between item so for instance the following which traces go from from each point to a number of connected with the with child the owner of the works of all all the storage model of the the level of the the people who was the storage is completely flat personal hierarchies or segments bias etc. and all the Committee's was sold on the fly and those also likely popularized the funding mechanism that uh if you want details about it I can I can explain its actions station so just like we know from the Commission surgeries operas for their support etc. rectangle 3 4 4 special indexing of the items that were people layer and also supported his response to minimize the overlap the clearance for religion searches provided by an external functional so this way we can define any sort of complexity of the rules and the kind of thing for them to do that without having to modify the itself yeah I will skip this part about the common connected resolution and the cooking right and get straight to the children had out not so the very basic ATI years to define an optimal bounding polygon around all the colliding items and the distance between this bounding polygon and the and the medical and this is the colliding items simply defined by the clearance will that this polygonal holes are used to compute uh the show enhanced races sold the hiking and walking around on various works by 1st giving an initial alignment are just 2 of use angle trace segments that computing finding 1 by 1 the colliding items computing the pattern false and then choosing the direction we're going to either clockwise or counterclockwise and the constraint is to try to keep the same direction or to minimize the distance so so the result of all the role I have found in local on Tumblr belief is the thick red line that current that's optimized except from and it's also outsourced the need to form a shown so showing it's a recursive on following using as that In the 1st step is to take the initial line drawn by the user just do straight segments were the angle and put it in the stock then we take the top item from this that we find all the colliding glance environments so that's why we sort them according to the distance from the originating colliding lines and process only 1 and booster results in the stack of recursively so as to all the lines of the process so this up examples are also used to move to the the colliding away so this image shows
the idea here is our initial line that you want to cause the monkeys the the that's not all I with this this connection and you will get them give them a weight so during the iteration number 1 and find a collision with this line would be of the set of federal falls and this simply iterate over the falls American the applied line to obtain the 1st thing that red line then it gets pushed this that we discover is that it collides with another line and we repeat this so i'm after 2 steps we get the crucial an alliance that's later on the optimizer make them look smoother
what in case of a collision with that are fixed object uh unmovable 1 so we need to decide whether to back propagated the collision and the reflected back towards the coarser or whether to jam there is some some some simple eristics so that model set of rules that that the uh that's what of thing things in that but without the need and scientific ground so in order to have this this this brought back propagation mechanism we assign a run for each item and the rule is that I write slow items so he
was a drawing explaining the subsequent iterations this line the blue 1 nation 1 was was was is being run by the 1st then it shells out the of aligned to the length of length the it's a solid and there are using the run was modified in such a way that the condition is that now what to do with the
bias so if bias trying to push colliding landers solution using just the final around the fishing wire and the same as in the light light it went by like this another my all aligned collides by an it's a bit more complicated we solve by a competing a minimum resolving like in a simple physical simulation of worry about physical objects collide me to calculate your effect in which it away and then we drop phrases that are connected to the divide the was with them this fact and so on and so forth they're latest nothing to this this thing so as to retrieve the 1st order process attempt to get back the former position so we a small set of rules and on board state of the current iteration is just a slightly modified I blow a snapshot of the more from the previous iteration and the each state of the of the of the boards places like the learning mechanism the construct described of the nation and is basically a a separate entry in a in a separate grounds that now with every iteration of the shot with with every run on the shelf algorithms and check how many entries of the plants that are not colliding with the with the current cursor proficient in the solution is not found in between so I have to put together the user must occur so we compute an initial 45 degree line we and have the solid because we can't anything else about the time we checked the spring back semantically and you want something that's not possible then Lundy deleted shots over the course of the bias in the propagation of solids the last step this to the last 2 steps are to run an optimizer only effect that items and to store the results of this thing now just a quick quarterly of nitrogen on so the goal of the vehicle and used specifically communal and bright and told reporters are supposed to act against secondly if they can't talk to detectability the through online processing viruses making nice line between the parts or in other problems like and mediator and to optimize the next round of parts of for instance you know that heat and back out it's uh 1 important remark is that all of this stuff the so a very expensive check so on which the model is not mentioned in the last so an
example of of white people but efficient nization algorithm this the merged segments we simply take the role very cornering initial the other 1 and we iterate through all the vertex there's applied to connect each pair with a simple to segment the connection to like it doesn't allow them the cost function is basically of the land number of long years of service and support some weights so now the technicalities
status uh single price interacting router is available in key gets in September 2013 it's already used for routine pretty complex projects we are currently working on different from personal and matching I can show that to you later and uh the release all of the Affairs is coming very soon so in love for with the future I'm story I have 15 seconds left we want to support people zones involve outline have among people the optimizer we want to change and in the way that can be used to solve and we want out of a single fragment of press finish and it'll finish the race and simple in simple cases what has been without direction life on so the question of how to decide which direction the headline goes made by the headline I understand the initial path
there for solving so the direction is something that in mind when the person is innocent you or by In fact or show I mean yeah that's that would be a dual
tree but not like me go through the and while so 1 of the star diagram right a user arrangement it's a user input you can switch the posture of the fact that the this gives you more control yeah yeah at the start of it yet but that look at it yeah so there you need some sort of like a tightening of it's the the the question was there is a possibility to uh to hold the tracks towards themselves right so for the moment there is no such for all all we are working on a new optimization algorithm that tightens the rules together well in the simplest form the pushing algorithm can be also used to bring the traces the closer to the so for instance the prices
here this segments are not of their meaning when possible so by running the segments of the edge you can make them you can place the type of thing in this case the you are we as a the on whether question now was if this tightening can be ultimatum for the moment no it's that interactive thing it requires user input that we are open to secure do you think about it and I suppose that that is you know I find yeah and the so the question was if we have any long-term plans to implement the componential order moments know if only depends on how well the current food in the car and the features of a window of like the differential person the 11th much Princess and on the are also question was if you if I move complement what that the show had kind words for the moment now so it's it's a made for rooting for placement I'm not going be what these and only all the the Untied history the use of is so the question was if the if the prices are on strike and if it's possible to them without the and tightening each trace back on so it depends on the optimizer apples and currently the optimizer is kind of very greedy so it does the and tightening by itself because it tries to manage as long segments as possible so for instance if I click on this and they try and I'd I'd run it it will on Python the traces straighten them as much as possible the the it and it was
Diskrete-Elemente-Methode
Algorithmus
Interaktives Fernsehen
Diskrete Simulation
Hasard <Digitaltechnik>
Routing
Räumliche Anordnung
Fehlermeldung
Bit
Minimierung
Weg <Topologie>
Selbstrepräsentation
Raum-Zeit
Skeleton <Programmierung>
Informationsmodellierung
Verbindungsloser Server
Algorithmus
Font
Standardabweichung
CMM <Software Engineering>
Speicher <Informatik>
Meta-Tag
Algorithmus
Datenmodell
Cursor
Globale Optimierung
Speicher <Informatik>
Rechenschieber
Objekt <Kategorie>
Software
Strategisches Spiel
Speicherabzug
Instantiierung
Standardabweichung
Resultante
Router
Chipkarte
Stereometrie
Krümmung
Punkt
Prozess <Physik>
Computer
Komplex <Algebra>
Rechenbuch
Raum-Zeit
Richtung
Übergang
Font
Font
Standardabweichung
Klon <Mathematik>
Punkt
Gerade
Cliquenweite
Kette <Mathematik>
Bildauflösung
Kraftfahrzeugmechatroniker
Shape <Informatik>
Prozess <Informatik>
Rechteck
Krümmung
Winkel
Globale Optimierung
Speicher <Informatik>
Quelle <Physik>
Software
Hierarchische Struktur
Menge
Verschlingung
Rechter Winkel
Automatische Indexierung
Generizität
Ablaufverfolgung
Programmierumgebung
Instantiierung
Nebenbedingung
Kontrollstruktur
Kreisfläche
Stab
Gruppenoperation
Ablöseblase
Rechteck
Hierarchische Struktur
Zahlenbereich
Graphische Primitive
Overlay-Netz
Polygon
Räumliche Anordnung
RFID
Service provider
Informationsmodellierung
Arbeitsplatzcomputer
Endogene Variable
Abstand
Speicher <Informatik>
Bildgebendes Verfahren
Einfach zusammenhängender Raum
Algorithmus
Zusammenhängender Graph
Datenmodell
Cursor
Bildauflösung
Schlussregel
Gerade
Quick-Sort
Abstand
Chirurgie <Mathematik>
Whiteboard
Polygon
Flächeninhalt
Mereologie
Gamecontroller
Stereometrie
Rekursive Funktion
Shape <Informatik>
Einfach zusammenhängender Raum
Algorithmus
Kraftfahrzeugmechatroniker
Heuristik
Gewicht <Mathematik>
Minimierung
Stoß
Ausbreitungsfunktion
Zahlenbereich
Iteration
Schlussregel
Ranking
Gerade
Objekt <Kategorie>
Informationsmodellierung
Wechselsprung
Menge
Stereometrie
Ordnung <Mathematik>
Gerade
Quelle <Physik>
Resultante
Stereometrie
Computervirus
Bit
Prozess <Physik>
Nabel <Mathematik>
Ortsoperator
Stoß
Minimierung
Ausbreitungsfunktion
Physikalismus
Iteration
Computer
Kraft
Unrundheit
Extrempunkt
Whiteboard
Informationsmodellierung
Algorithmus
Zählen
Ordnungsreduktion
Gerade
Soundverarbeitung
Algorithmus
Kraftfahrzeugmechatroniker
Dicke
Cursor
Speicher <Informatik>
Globale Optimierung
Schlussregel
Gerade
Teilbarkeit
Objekt <Kategorie>
Quelle <Physik>
Minimalgrad
Menge
Konditionszahl
Ein-Ausgabe
Mereologie
Stereometrie
Simulation
Ordnung <Mathematik>
Simulation
Verkehrsinformation
Aggregatzustand
Instantiierung
Differential
Hash-Algorithmus
Gewicht <Mathematik>
Minimierung
Zahlenbereich
Richtung
Knotenmenge
Algorithmus
Font
Kostenfunktion
Proxy Server
Router
Flächeninhalt
Tabelle <Informatik>
Einfach zusammenhängender Raum
Videospiel
Zwei
Einfache Genauigkeit
Globale Optimierung
Zeitzone
Knotenmenge
Gerade
Einfache Genauigkeit
Dienst <Informatik>
Whiteboard
ATM
Projektive Ebene
Netzwerktopologie
Bildschirmmaske
Diagramm
Weg <Topologie>
Algorithmus
Momentenproblem
Globale Optimierung
Schlussregel
Ein-Ausgabe
Ablaufverfolgung
Instantiierung
Richtung
Arithmetisches Mittel
Momentenproblem
Minimierung
Datentyp
Automatische Handlungsplanung
Wort <Informatik>
Ein-Ausgabe
Ablaufverfolgung
Ordnung <Mathematik>
Ultimatumspiel
Instantiierung

Metadaten

Formale Metadaten

Titel Interactive PCB Routing
Untertitel Ideas & algorithms we implemented in Kicad
Alternativer Titel Electronic Design Automation - Interactive routing algorithms in modern PCB design tools
Serientitel FOSDEM 2015
Autor Wlostowski, Tomasz
Lizenz CC-Namensnennung 2.0 Belgien:
Sie dürfen das Werk bzw. den Inhalt zu jedem legalen Zweck nutzen, verändern und in unveränderter oder veränderter Form vervielfältigen, verbreiten und öffentlich zugänglich machen, sofern Sie den Namen des Autors/Rechteinhabers in der von ihm festgelegten Weise nennen.
DOI 10.5446/34356
Herausgeber FOSDEM VZW
Erscheinungsjahr 2016
Sprache Englisch
Produktionsjahr 2015

Inhaltliche Metadaten

Fachgebiet Informatik

Ähnliche Filme

Loading...
Feedback