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
  
• Pierluigi Crescenzi, Paolo Penna, Adolfo Piperno:
  Linear area upward drawings of AVL trees. 25-42
  
• Ashim Garg:
  New results on drawing angle graphs. 43-82
  
• Achilleas Papakostas, Ioannis G. Tollis:
  Algorithms for area-efficient orthogonal drawings. 83-110
  
• Helmut Alt, Michael Godau, Sue Whitesides:
  Universal 3-dimensional visibility representations for graphs. 111-125
  

Volume 9, Number 3, February 1998

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

Volume 9, Number 4, March 1998

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

Last update Sat May 18 20:11:11 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page