Computational Geometry, Volume 9

Volume 9, Number 1-2, 2 January 1998

Heinz Breu, David G. Kirkpatrick: Unit disk graph recognition is NP-hard. 3-24 BibTeX
Pierluigi Crescenzi, Paolo Penna, Adolfo Piperno: Linear area upward drawings of AVL trees. 25-42 BibTeX
Ashim Garg: New results on drawing angle graphs. 43-82 BibTeX
Achilleas Papakostas, Ioannis G. Tollis: Algorithms for area-efficient orthogonal drawings. 83-110 BibTeX
Helmut Alt, Michael Godau, Sue Whitesides: Universal 3-dimensional visibility representations for graphs. 111-125 BibTeX

John Hershberger, Jack Snoeyink: Erased arrangements of lines and convex decompositions of polyhedra. 129-143 BibTeX
Panagiotis Takis Metaxas, Grammati E. Pantziou, Antonios Symvonis: A note on parallel algorithms for optimal h-v drawings of binary trees. 145-158 BibTeX
Therese C. Biedl, Goos Kant: A better heuristic for orthogonal graph drawings. 159-180 BibTeX
Dan Halperin, Chee-Keng Yap: Combinatorial complexity of translating a box in polyhedral 3-space. 181-196 BibTeX

Marc J. van Kreveld: On fat partitioning, fat covering and the union size of polygons. 197-210 BibTeX
Yi-Jen Chiang: Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep versus plane sweep. 211-236 BibTeX
Esther M. Arkin, Martin Held, Joseph S. B. Mitchell, Steven Skiena: Recognizing polygonal parts from width measurements. 237-246 BibTeX
Tatsuya Akutsu: On determining the congruence of point sets in d dimensions. 247-256 BibTeX
Suneeta Ramaswami, Pedro A. Ramos, Godfried T. Toussaint: Converting triangulations to quadrangulations. 257-276 BibTeX
Shang-Hua Teng: Combinatorial aspects of geometric graphs. 277-287 BibTeX