Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
W. T. Liou
1990 – 1999
- 1991
[j2]W. T. Liou, Chuan Yi Tang, Richard C. T. Lee: Covering convex rectilinear polygons in linear time. Int. J. Comput. Geometry Appl. 1(2): 137-185 (1991)- 1990
[j1]W. T. Liou, Jimmy J. M. Tan, Richard C. T. Lee: Minimum rectangular partition problem for simple rectilinear polygons. IEEE Trans. on CAD of Integrated Circuits and Systems 9(7): 720-733 (1990)
1980 – 1989
- 1989
[c1]W. T. Liou, Jimmy J. M. Tan, Richard C. T. Lee: Minimum Partitioning Simple Rectilinear Polygons in o(n log log n) Time. Symposium on Computational Geometry 1989: 344-353
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-02 20:59 CET by the dblp team



