A polynomial-time algorithm is presented for extracting the boundary rectangles from a given interval template having no “inner windings.” The algorithm involves only comparisons and list operations. The performance of the algorithm is tested and compared with those of four boundary extraction algorithms existing in the QFT literature. The testing is done on a benchmark suite of eleven transfer function examples, using computational time and effort (flops) as the performance metrics. The test results show the proposed algorithm to be superior in every example. The typical improvement in terms of these metrics is by several orders of magnitude.
A Polynomial-Time Algorithm for Efficient Extraction of Boundary Rectangles From Interval Templates
Contributed by the Dynamic Systems, Measurement, and Control Division of THE AMERICAN SOCIETY OF MECHANICAL ENGINEERS for publication in the ASME JOURNAL OF DYNAMIC SYSTEMS, MEASUREMENT, AND CONTROL. Manuscript received by the ASME Dynamic Systems and Control Division April 24, 2003. Associate Editor: Chait.
- Views Icon Views
- Share Icon Share
- Cite Icon Cite
- Search Site
Nataraj, P. S. V., Satyanarayan , R., and Sheela, S. (January 29, 2004). "A Polynomial-Time Algorithm for Efficient Extraction of Boundary Rectangles From Interval Templates ." ASME. J. Dyn. Sys., Meas., Control. December 2003; 125(4): 654–657. https://doi.org/10.1115/1.1595669
Download citation file:
- Ris (Zotero)
- Reference Manager