線段布線演算法 的英文怎麼說

中文拼音 [xiànduànbùxiànyǎnsuànfǎ]
線段布線演算法 英文
line routing algorithm
  • 線 : 名詞1 （用絲、棉、金屬等製成的細長的東西） thread; string; wire 2 [數學] （一個點任意移動所構成的...
  • 段 : Ⅰ量詞（部分） section; segment; part; paragraph; passage Ⅱ名詞（姓氏） a surname
  • 演 : 動詞1 （演變; 演化） develop; evolve 2 （發揮） deduce; elaborate 3 （依照程式練習或計算） drill;...
  • 算 : Ⅰ動詞1 （計算數目） calculate; reckon; compute; figure 2 （計算進去） include; count 3 （謀劃;計...
  • 法 : Ⅰ名詞1 （由國家制定或認可的行為規則的總稱） law 2 （方法; 方式） way; method; mode; means 3 （標...
  1. Abstract : a new clock - driven eco placement algorithm is presented for standard - cell layout design based on the table - lookup delay model. it considers useful clock skew information in the placement stage. it also modifies the positions of cells locally to make better preparation for the clock routing. experimental results show that with little influence to other circuit performance, the algorithm can improve permissible skew range distribution evidently

    文摘:提出了一種新的時鐘性能驅動的增量式布局演算法，它針對目前工業界較為流行的標準單元布局，應用查找表模型來計算延遲.由於在布局階段較早地考慮到時鐘信息，可以通過調整單元位置，更有利於后續的有用偏差時鐘布線和偏差優化問題.來自於工業界的測試用例結果表明，該演算法可以有效地改善合理偏差范圍的分佈，而對電路的其它性能影響很小
  2. The algorithm has many advantages such as the input format and output format being uniformed, high efficient, wide application, etc. it has abroad market values in many domains, such as the weather character demonstration, computing and the demonstration of anomalous graphics, etc. we know that curves can be approached by mini line - segments, so the boolean operations between almost all regions can be implemented by this algorithm

    本演算法具有輸入、輸出數據格式統一、效率高、應用面廣等優點。在實現天氣氣象圖的演示、各種不規則圖形的顯示和計算等領域具有很廣闊的市場前景。由於曲線邊界可以由小線段組成的多邊形來逼近，所以通過本演算法，我們還可以實現任何邊界區域間的布爾操作。
  3. This paper was based on robocup legged - robot group which uses sony aibo robot as experimental object. with the platform of gt2004 published by germanteam in 2004, combining the image information taken by the robot ’ s own camera with recent self - localization approach, the paper implemented real - time localization process under the real dynamic environment and met the need of robocup new rules. on the condition of wireless network communication and accurate pose estimation, the dynamic role assignment and coordination among multi - agents became possible

    本文基於robocup四腿機器人足球比賽，以比賽組委會指定的aibo機器狗為實驗對象，以國際robocup2004四腿機器人足球比賽冠軍德國隊公布的gt2004為研發平臺，為適應新的比賽場地和比賽規則，主要運用自主體本身所採集的圖像信息，結合最新的圖像處理手段和自主定位演算法，從而估算出自主體在動態特徵比賽環境下的實時位姿，並藉助無線網路通訊手段和自主定位的結果，實現多自主體的動態角色分配和協調控制過程。
  4. In deep sub - micron technology, the scale of integration and the degree of complexity of circuit increase rapidly, it is necessary and feasible to adopt non - manhattan model for detailed routing in vlsi physical design. aiming at the current pop point a novel non - manhattan otc router is proposed in section 4. according to the routing algorithm of channel area the new otc router selects nets on cell by using net segment valid controlling column technology, deep searching to column density technology and utilization of vacant terminals technology

    結合通道區域所用非曼哈頓布線演算法的特點，通過採用線網段有效控制列技術、列密度深度探測技術及空端利用技術對單元區可布線網進行有效選擇，成功地實現了該非曼哈頓單元上布線演算法，並將其應用於一些經典的benchmark中，和目前文獻中現有演算法相比取得了更優的布線結果。
  5. The rectilinear steiner minimal tree rsmt problem is one of the fundamental problems in physical design, especially in routing, which is known to be np - complete. this paper presents an algorithm, called aco - steiner, for rsmt construction based on ant colony optimization

    製造工藝由超深亞微米vdsm進入到納米nanometer階段，作為物理設計physical design重要階段之一的布線routing ，其演算法研究與工具設計面臨新的挑戰。
  6. An algorithm to resolve the coupling effect problem is proposed during the cross point assignment ( cpa ) stage. in the algorithm, the priority queue concept and the rip - up and reroute strategy are combined to control crosstalk noise caused by interconnect coupling capacitance. first, the nets are arranged into different priority queues according to their weighted sum of their length and criticality. then, the cpa problem for one queue of nets is translated into a linear assignment problem. after the assignment of one queue of nets, a post - cpa checking routine is performed to check and rip up the net pairs which violate the crosstalk noise constraint and then push them into the next queue to be reassigned. the algorithm is tested by a set of bench mark examples, and the experimental results are promising

    提出了一種在過點分配階段解決噪聲耦合效應問題的演算法.該演算法採用優先隊列同拆線重布策略相結合的方法，控制由互連線耦合電容引起的串擾噪聲.演算法中，首先按照線長和約束限制，將線網劃分到若干個優先隊列中.然後，將每個優先隊列的過點分配問題轉換為線性分配問題.在完成一個線網隊列的分配后，通過過點分配后處理過程檢查串擾約束滿足情況，對違反約束的線網對進行拆除，放入后續線網隊列進行重新分配.實驗數據表明，該演算法能夠取得好的效果
  7. Abstract : an algorithm to resolve the coupling effect problem is proposed during the cross point assignment ( cpa ) stage. in the algorithm, the priority queue concept and the rip - up and reroute strategy are combined to control crosstalk noise caused by interconnect coupling capacitance. first, the nets are arranged into different priority queues according to their weighted sum of their length and criticality. then, the cpa problem for one queue of nets is translated into a linear assignment problem. after the assignment of one queue of nets, a post - cpa checking routine is performed to check and rip up the net pairs which violate the crosstalk noise constraint and then push them into the next queue to be reassigned. the algorithm is tested by a set of bench mark examples, and the experimental results are promising

    文摘:提出了一種在過點分配階段解決噪聲耦合效應問題的演算法.該演算法採用優先隊列同拆線重布策略相結合的方法，控制由互連線耦合電容引起的串擾噪聲.演算法中，首先按照線長和約束限制，將線網劃分到若干個優先隊列中.然後，將每個優先隊列的過點分配問題轉換為線性分配問題.在完成一個線網隊列的分配后，通過過點分配后處理過程檢查串擾約束滿足情況，對違反約束的線網對進行拆除，放入后續線網隊列進行重新分配.實驗數據表明，該演算法能夠取得好的效果
  8. In this paper, i will present some algorithms of polyhedral visual hull reconstruction : ( 1 ) polyhedral v isual h ull generation a igorithm b ased one dge - pool - searching, which constrains the 3 - d intersections into the 2 - d planes intersection via the epipolar theory to reduce the complexity a nd c an r educe t he t imes f or c ones t o b e p rejected o nto t he i mage p lanes, i n which we induced the index list to every points on the surface of object, and connected the related points to get sub polygons on surface and in turn get the mesh model, we replace triangulation process of disordered points cloud by edge - pool searching. ; ( 2 ) reconstruction based on degenerated - polygon - intersection, which have the following improvements on traditional bull intersection : using degenerated polygon to orga nize intersected area on cone face, which may be discontinuous ; a fast intersection algorithm of polygons on the cone face based on degenerated polygons, which is consistent between the continuous polygons and the discontinuous ones. the intersection of degenerated polygons is similar to the convergence of two ordered lists, which is comparably simple to the bull operation ; ( 3 ) reconstruction algorithm based on ray - tracing, in which all the rays that run through the vertex on silhouette of object will intersect with all the cones correspondent to other silhouette, and we have to calculate the intersection of all such line segments, the endpoints of which are considered to lie on the surface of object and we will get the point cloud on the surface of object

    同時利用共極線原理把三維計算投影到二維平面以降低求交計算的復雜度，該演算法可以減少光錐向圖像平面投影計算的次數，以邊池搜索取代散亂點集上進行的三角剖分； （ 2 ）基於退化多邊形求交的多面體可見殼模型重構，系統引入退化多邊形的概念，把錐體平面的交集中不連通的部分用一個退化多邊形來表示，並引入了新的基於退化多邊形的求交演算法，與傳統多面體可見殼重構相比，該演算法有以下幾點創新：在圖像平面以退化多邊形組織投影錐體和物體輪廓的交集，把任意錐面與物體輪廓的交集歸一到一個退化多邊形；基於退化多邊形的二維平面上多邊形快速相交演算法，該演算法在一定程度上就是兩個有序鏈表的合併，大大簡化了先前的布爾求交計算； （ 3 ）基於光線跟蹤的演算法，該演算法中所有通過輪廓頂點的光線和對應其它圖像輪廓的光錐進行求交計算，最後得到每次求交計算得到線段的交集，該線段的頂點就認為是物體表面點，從而得到物體表面的點雲。
分享友人
分享到 Line

分享到臉書