Computational Geometry, Volume 12

Volume 12, Number 1-2, February 1999

• David Eppstein:
  Linear complexity hexahedral mesh generation. 3-16
  
• Sandy Irani, Prabhakar Raghavan:
  Combinatorial and experimental results for randomized point matching algorithms. 17-31
  
• Simon Kahan, Jack Snoeyink:
  On the bit complexity of minimum link paths: Superquadratic algorithms for problem solvable in linear time. 33-44
  
• Gill Barequet, Micha Sharir:
  Partial surface matching by using directed footprints. 45-62
  
• Ernst P. Mücke, Isaac Saias, Binhai Zhu:
  Fast randomized point location without preprocessing in two- and three-dimensional Delaunay triangulations. 63-83
  
• Kurt Mehlhorn, Stefan Näher, Michael Seel, Raimund Seidel, Thomas Schilz, Stefan Schirra, Christian Uhrig:
  Checking geometric programs or verification of geometric structures. 85-103
  
• Satyan R. Coorg, Seth J. Teller:
  Temporally coherent conservative visibility. 105-124
  
• James E. Baker, Isabel F. Cruz, Giuseppe Liotta, Roberto Tamassia:
  Visualizing geometric algorithms over the Web. 125-152
  

Volume 12, Number 3-4, April 1999

• Kurt Mehlhorn, Jörg-Rüdiger Sack, Jorge Urrutia:
  Editorial. 153-154
  
• Sariel Har-Peled:
  Multicolor Combination Lemma. 155-176
  
• Mark J. Kaiser:
  The mixed volume optimization problem. 177-217
  
• Jayanth Majhi, Ravi Janardan, Michiel H. M. Smid, Prosenjit Gupta:
  On some geometric optimization problems in layered manufacturing. 219-239
  
• Jayanth Majhi, Ravi Janardan, Jörg Schwerdt, Michiel H. M. Smid, Prosenjit Gupta:
  Minimizing support structures and trapped area in two-dimensional layered manufacturing. 241-267
  

Last update Mon Feb 13 04:45:33 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page