Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

W. T. Liou

dblp:66/6705 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 1990
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1 · 1 first-authorTheory of computation · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
2 papers
Computational geometry · 61% Algorithmic game theory and mechanism design · 19% Graph algorithms and graph theory · 19%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computational geometry › partitioning
geometric partitioning		 0.011990
Minimum rectangular partition problem for simple rectilinear polygons · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1990
Algorithmic game theory and mechanism design
matching		 0.011990
Minimum rectangular partition problem for simple rectilinear polygons · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1990
Graph algorithms and graph theory › graph matching
maximum matching		 0.011990
Minimum rectangular partition problem for simple rectilinear polygons · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1990
Computational geometry › polygon decomposition
rectangular dissection		 0.011990
Minimum rectangular partition problem for simple rectilinear polygons · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1990
Computational geometry
polygon decomposition		 0.011989
Minimum Partitioning Simple Rectilinear Polygons in o(n log log n) Time · SCG 1989
Computational geometry › polygon algorithms
orthogonal polygon		 0.011990
Minimum rectangular partition problem for simple rectilinear polygons · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1990

Methods — techniques the papers use, named apart from their topics

visibility graph · 0.0bipartite graph matching · 0.0divide-and-conquer · 0.0
YearPublicationVenuePosition
1990 Minimum rectangular partition problem for simple rectilinear polygons
abstract
An O(n log log n) algorithm is proposed for minimally rectangular partitioning a simple rectilinear polygon. For any simple rectilinear polygon P, a vertex-edge visible pair is a vertex and an edge that can be connected by a horizontal or vertical line segment that lies entirely inside P. It is shown that, if the vertex-edge visible pairs are found, the maximum matching and the maximum independent set of the bipartite graph derived from the chords of a simple rectilinear polygon can be found in linear time without constructing the bipartite graph. Using this algorithm, the minimum partition problem for convex rectilinear polygons and vertically (horizontally) convex rectilinear polygons can be solved in O(n) time.>
W. T. Liou, Jimmy Jiann-Mean Tan, Richard C. T. Lee
 IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.1
1989 Minimum Partitioning Simple Rectilinear Polygons in o(n log log n) Time
abstract
Article Free AccessMinimum partitioning simple rectilinear polygons in O(n log log n) - time Authors: W. T. Liou Institute of Computer Science, National Tsing Hua University, Hsinchu, Taiwan, R.O.C. Institute of Computer Science, National Tsing Hua University, Hsinchu, Taiwan, R.O.C.View Profile , J. J. Tan Institute of Information Science, National Chiao Tung University, Hsinchu, Taiwan, R.O.C. Institute of Information Science, National Chiao Tung University, Hsinchu, Taiwan, R.O.C.View Profile , R. C. Lee National Tsing Hua University, Hsinchu, Taiwan, and the Academia Sinica, Taipei, Taiwan, R.O.C. National Tsing Hua University, Hsinchu, Taiwan, and the Academia Sinica, Taipei, Taiwan, R.O.C.View Profile Authors Info & Claims SCG '89: Proceedings of the fifth annual symposium on Computational geometryJune 1989 Pages 344–353https://doi.org/10.1145/73833.73871Published:05 June 1989Publication History 13citation1,034DownloadsMetricsTotal Citations13Total Downloads1,034Last 12 Months120Last 6 weeks20 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
W. T. Liou, Jimmy Jiann-Mean Tan, Richard C. T. Lee
 SCG1