15.8.4 H.4. Intersection, packing, layout, etc.

Chapter Contents (Back)

Baker, B.S., Coffman, Jr., E.G.,
A Two-Dimensional Bin-Packing Model Of Preemptive, Fifo Storage Allocation,
J. ALGORITHMS(3), 1982, pp. 303-316. BibRef

Toussaint, G.T.,
Computing Largest Empty Circles With Location Constraints,
J. COMPUTER INFORMATION SCIENCES(12), 1983, pp. 347-358. BibRef

Lee, D.T.,
An Optimal Time And Minimal Space Algorithm For Rectangle Intersection Problems,
J. COMPUTER INFORMATION SCIENCES(13), 1984, pp. 23-32. BibRef

Lee, C.C., Lee, D.T.,
On A Circle-Cover Minimization Problem,
IPL(18), 1984, pp. 109-115. BibRef

Spirakis, P., Yap, C.K.,
Strong Np-Hardness Of Moving Many Discs,
IPL(19), 1984, pp. 55-59. BibRef

Avis, D.,
Non-Partitionable Point Sets,
IPL(19), 1984, pp. 125-129. BibRef

Bhatt, S.N., Leighton, F.T.,
A Framework For Solving Vlsi Graph Layout Problems,
J. COMPUTER SYSTEM SCIENCES(28), 1984, pp. 300-343. BibRef

Rosenstiehl, P., Tarjan, R.E.,
Gauss Codes, Planar Hamiltonian Graphs, And Stack-Sortable Permutations,
J. ALGORITHMS(5), 1984, pp. 375-390. BibRef

Lengauer, T.,
On The Solution Of Inequality Systems Relevant To Ic-Layout,
J. ALGORITHMS(5), 1984, pp. 408-421. BibRef

Liang, Y.D., Barsky, B.A.,
A New Concept And Method For Line Clipping,
TOG(3), 1984, pp. 1-22. BibRef

Lee, D.T., Leung, J.Y.T.,
On The 2-Dimensional Channel Assignment Problem,
T-COMP(33), 1984, pp. 2-6. BibRef

Gordon, D., Koren, I., Silberman, G.M.,
Embedding Tree Structures In Vlsi Hexagonal Arrays,
T-COMP(33), 1984, pp. 104-107. BibRef

Burton, F.W., Huntbach, M.M.,
Lazy Evaluation Of Geometric Objects,
CGA(4), No. 1, 1984, pp. 28-33. BibRef

Dori, D., Ben-Bassat, M.,
Efficient Nesting Of Congruent Convex Figures,
CACM(27), 1984, pp. 228-235. BibRef

Richards, D.,
Complexity Of Single Layer Routing,
T-COMP(33), 1984, pp. 286-288. BibRef

Stein, S.,
Packings Of R(N) By Certain Error Spheres,
T-IT(30), 1984, pp. 356-363. BibRef

Hamaker, W., Stein, S.,
Combinatorial Packing Of R(3) By Certain Error Spheres,
T-IT(30), 1984, pp. 364-368. BibRef

Van Wyk, C.J.,
Clipping To The Boundary Of A Circular-Arc Polygon,
CVGIP(25), 1984, pp. 383-392. BibRef

Blum, N.,
An Area-Maximum Edge Length Tradeoff For Vlsi Layout,
STOC(84), pp. 92-97. BibRef

Buss, J.F., Shor, P.W.,
On The Pagenumber Of Planar Graphs,
STOC(84), pp. 98-100. BibRef

Mirzaian, A.,
Channel Routing In Vlsi,
STOC(84), pp. 101-107. BibRef

Chazelle, B.,
Intersecting Is Easier Than Sorting,
STOC(84), pp. 125-134. BibRef

Bentley, J.L., Johnson, D.S., Leighton, F.T., McGeoch, C.C., McGeoch, L.A.,
Some Unexpected Expected Behavior Results For Bin Packing,
STOC(84), pp. 279-288. BibRef

Karp, R.M., Luby, M., Marchetti-Spaccamela, A.,
A Probabilistic Analysis Of Multidimensional Bin Packing Problems,
STOC(84), pp. 289-298. BibRef

Miller, G.L.,
Finding Small Simple Cycle Separators For 2-Connected Planar Graphs,
STOC(84), pp. 376-382. BibRef

Dolev, D., Halpern, J., Simons, B., Strong, R.,
A New Look At Fault Tolerant Network Routing,
STOC(84), pp. 526-535. BibRef

Broder, A., Dolev, D., Fischer, M., Simons, B.,
Efficient Fault Tolerant Routings In Networks,
STOC(84), pp. 536-541. BibRef

Preparata, F.P., Lipski, Jr., W.,
Optimal Three-Layer Channel Routing,
T-COMP(33), 1984, pp. 427-437. BibRef

Yang, M.C.K., Yang, C.C.,
Assessment Of The Intersection Probabilities Of Random Line Segments And Squares,
CVGIP(26), 1984, pp. 319-330. BibRef

Ahuja, N.,
Efficient Planar Embedding Of Trees For Vlsi Layouts,
7ICPR(84), pp. 460-464. BibRef

Albrecht, A.,
On The Circuit Complexity Of Planar Objects,
7ICPR(84), pp. 468-470. BibRef

Guting, R.H., Wood, D.,
Finding Rectangle Intersections By Divide-And-Conquer,
T-COMP(33), 1984, pp. 671-675. BibRef

Hopcroft, J., Joseph, D., Whitesides, S.,
Movement Problems For 2-Dimensional Linkages,
SIAM J. COMPUTING(13), 1984, pp. 610-629. BibRef

Fink, A., Shamir, A.,
Polymorphic Arrays: A Novel Vlsi Layout For Systolic Computers,
SFCS(84), pp. 37-45. BibRef

Cole, R., Siegel, A.,
River Routing Every Which Way, But Loose,
SFCS(84), pp. 65-73. BibRef

Heath, L.,
Embedding Planar Graphs In Seven Pages,
SFCS(84), pp. 74-83. BibRef

Shor, P.W.,
The Average-Case Analysis Of Some On-Line Algorithms For Bin-Packing,
SFCS(84), pp. 193-200. BibRef

Dobkin, D.P., Edelsbrunner, H.,
Space Searching For Intersecting Objects,
SFCS(84), pp. 387-392. BibRef

Imai, H., Asano, T.,
Dynamic Segment Intersection Search With Applications,
SFCS(84), pp. 393-402. BibRef

Chang, J.S., Yap, C.K.,
A Polynomial Solution For Potato-Peeling And Other Polygon Inclusion And Enclosure Problems,
SFCS(84), pp. 408-416. BibRef

Edelsbrunner, H., Overmars, M.H., Seidel, R.,
Some Methods Of Computational Geometry Applied To Computer Graphics,
CVGIP(28), 1984, pp. 92-108. BibRef

Chapter on Rosenfeld Bibliography for 1984 continues in
H.5. Distance, skeletons, paths, etc. .

Last update:Jun 7, 2018 at 10:14:50