11.20.3 H.3. Separability, covering, decomposition,

Chapter Contents (Back)
packing, layout, etc.

Yap, C.K.,
Parallel Triangulation Of A Polygon In Two Calls To The Trapezoidal Map,
ALGORITHMICA(3), 1988, pp. 279-288. BibRef

Czerwinski, P., Ramachandran, V.,
Optimal Vlsi Graph Embeddings In Variable Aspect Ratio Rectangles,
ALGORITHMICA(3), 1988, pp. 487-510. BibRef

Lingas, A., Levcopoulos, C., Sack, J.,
Algorithms For Minimum Length Partitions Of Polygons,
BIT(27), 1987, pp. 474-479. BibRef

Kundu, S.,
The Equivalence Of The Subregion Representation And The Wall Representation For A Certain Class Of Rectangular Dissections,
COMM. ACM(31), 1988, pp. 752-763. BibRef

Frenk, J.B.G., Galambos, G.,
Hybrid Next-Fit Algorithm For The Two-Dimensional Rectangle Bin-Packing Problem,
COMPUTING(39), 1987, pp. 201-217. BibRef

Pollack, R., Sharir, M., Sifrony, S.,
Separating Two Simple Polygons By A Sequence Of Translations,
DCG(3), 1988, pp. 123-136. BibRef

Baker, B.S., Grosse, E., Rafferty, C.S.,
Nonobtuse Triangulation Of Polygons,
DCG(3), 1988, pp. 147-168. BibRef

Wiseman, J.A., Wilson, P.R.,
A Sylvester Theorem For Conic Sections,
DCG(3), 1988, pp. 295-305. BibRef

Megiddo, N.,
On The Complexity Of Polyhedral Separability,
DCG(3), 1988, pp. 325-337. BibRef

Scheithauer, G., Terno, J.,
The Partition Of A Square In Rectangles With Equal Areas,
EIK(24), 1988, pp. 189-200. BibRef

Edelsbrunner, H., Preparata, F.P.,
Minimal Polygonal Separation,
INFORMATION COMPUTATION(77), 1988, pp. 218-232. BibRef

Wang, C.A.,
An O(Log N) Time Parallel Algorithm For Triangulating A Set Of Points In The Plane,
IPL(25), 1987, pp. 55-60. BibRef

Pinter, S.S., Wolfstahl, Y.,
Embedding Ternary Trees In Vlsi Arrays,
IPL(26), 1987, pp. 187-191. BibRef

Liu, R., Ntafos, S.,
On Decomposing Polygons Into Uniformly Monotone Parts,
IPL(27), 1988, pp. 85-89. BibRef

Bertossi, A.A.,
Parallel Circle-Cover Algorithms,
IPL(27), 1988, pp. 133-139. BibRef

Hoffmann, F., Kriegel, K.,
Embedding Rectilinear Graphs In Linear Time,
IPL(29), 1988, pp. 75-79. BibRef

Coffman Jr., E.G., Garey, M.R., Johnson, D.S.,
Bin Packing With Divisible Item Sizes,
J. COMPLEXITY(3), 1987, pp. 406-428. BibRef

Pujari, A.K.,
Separability Of Unimodal Polygons,
PRL(7), 1988, pp. 163-165. BibRef

Friesen, D.K., Kuhl, F.S.,
Analysis Of A Hybrid Algorithm For Packing Unequal Bins,
SIAM JC(17), 1988, pp. 23-40. BibRef

Tarjan, R.E., Van Wyk, C.J.,
An O(Nloglogn)-Time Algorithm For Triangulating A Simple Polygon,
SIAM JC(17), 1988, pp. 143-178. BibRef

Dehne, F., Sack, J.R.,
Translation Separability Of Sets Of Polygons,
VC(3), 1987, pp. 227-235. BibRef

Clarkson, K.L., Tarjan, R.E., VanWyk, C.J.,
A Fast Las Vegas Algorithm For Triangulating A Simple Polygon,
CG(88), pp. 18-22. BibRef

Motwani, R., Raghunathan, A., Saran, H.,
Covering Orthogonal Polygons With Star Polygons: The Perfect Graph Approach,
CG(88), pp. 211-223. BibRef

Gao, S., Jerrum, M., Kaufmann, M., Mehlhorn, K., Rulling, W., Storb, C.,
On Continuous Homotopic One Layer Routing,
CG(88), pp. 392-402. BibRef

Aggarwal, A., Ghosh, S.K., Shyamasundar, R.K.,
Computational Complexity Of Restricted Polygon Decompositions,
CM(88), pp. 1-11. BibRef

Bhattacharya, B.K.,
Circular Separability Of Planar Point Sets,
CM(88), pp. 25-39. BibRef

Chapter on Rosenfeld Bibliography for 1988 continues in
H.4. Distance, etc. .

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