A linear-time algorithm for a special case of disjoint set union
HN Gabow, RE Tarjan - Proceedings of the fifteenth annual ACM …, 1983 - dl.acm.org
This paper presents a linear-time algorithm for the special case of the disjoint set union
problem in which the structure of the unions (defined by a “union tree”) is known in advance …
problem in which the structure of the unions (defined by a “union tree”) is known in advance …
[图书][B] Drawing graphs: methods and models
M Kaufmann, D Wagner - 2003 - books.google.com
Graph drawing comprises all aspects of visualizing structural relations between objects. The
range of topics dealt with extends from graph theory, graph algorithms, geometry, and …
range of topics dealt with extends from graph theory, graph algorithms, geometry, and …
Recent results in art galleries (geometry)
TC Shermer - Proceedings of the IEEE, 1992 - ieeexplore.ieee.org
Two points in a polygon are called if the straight line between them lies entirely inside the
polygon. The art gallery problem for a polygon P is to find a minimum set of points G in P …
polygon. The art gallery problem for a polygon P is to find a minimum set of points G in P …
[图书][B] Computer science handbook
AB Tucker - 2004 - taylorfrancis.com
When you think about how far and fast computer science has progressed in recent years, it's
not hard to conclude that a seven-year old handbook may fall a little short of the kind of …
not hard to conclude that a seven-year old handbook may fall a little short of the kind of …
[PDF][PDF] A packing problem with applications to lettering of maps
M Formann, F Wagner - Proceedings of the seventh annual symposium …, 1991 - dl.acm.org
The following packing problem arises in connection with lettering of maps: Given n distinct
points pl, p2,.... pn in the plane, determine the supremum uoPi of all reals U, such that there …
points pl, p2,.... pn in the plane, determine the supremum uoPi of all reals U, such that there …
Computational geometry—a survey
Lee, Preparata - IEEE Transactions on Computers, 1984 - ieeexplore.ieee.org
We survey the state of the art of computational geometry, a discipline that deals with the
complexity of geometric problems within the framework of the analysis of algorithms. This …
complexity of geometric problems within the framework of the analysis of algorithms. This …
Finding k points with minimum diameter and related problems
Finding k Points with Minimum Diameter and Related Problems Page 1 JOURNAL “P
ALGORITHMS 12, 38-56 (1991) Finding k Points with Minimum Diameter and Related Problems …
ALGORITHMS 12, 38-56 (1991) Finding k Points with Minimum Diameter and Related Problems …
[图书][B] An introduction to VLSI physical design
M Sarrafzadeh, CK Wong - 1996 - dl.acm.org
From the Publisher: This text treats the physical design of very large scale integrated circuits
gradually and systematically. It examines the design problem and the design process with …
gradually and systematically. It examines the design problem and the design process with …
Dynamic algorithms in computational geometry
YJ Chiang, R Tamassia - Proceedings of the IEEE, 1992 - ieeexplore.ieee.org
Dynamic algorithms and data structures in the area of computational geometry are surveyed.
The work has a twofold purpose: it introduces the area to the nonspecialist and reviews the …
The work has a twofold purpose: it introduces the area to the nonspecialist and reviews the …