International Journal of Computational Geometry and Applications, Volume 12

Volume 12, Numbers 1-2, February & April 2002

• Mark de Berg, Stefan Schirra:
  Guest Editor's Foreword. 1-2
  
• David G. Kirkpatrick, Jack Snoeyink, Bettina Speckmann:
  Kinetic Collision Detection for Simple Polygons. 3-27
  
• Srinivas Doddi, Madhav V. Marathe, Bernard M. E. Moret:
  Point Set Labeling with Specified Positions. 29-66
  
• Timothy M. Chan:
  Approximating the Diameter, Width, Smallest Enclosing Cylinder, and Minimum-Width Annulus. 67-85
  
• Steven M. LaValle, Borislav H. Simov, Giora Slutzki:
  An Algorithm for Searching a Polygonal Region with a Flashlight. 87-113
  
• Peter Braß, Christian Knauer:
  Testing the Congruence of d-Dimensional Point Sets. 115-124
  
• Nina Amenta, Sunghee Choi, Tamal K. Dey, N. Leekha:
  A Simple Algorithm for Homeomorphic Surface Reconstruction. 125-141
  
• Afra Zomorodian, Herbert Edelsbrunner:
  Fast Software for Box Intersections. 143-172
  

Volume 12, Number 3, June 2002

• David Binger:
  Polyhedra with Unguarded Interiors. 173-180
  
• J. Mark Keil, Jack Snoeyink:
  On the Time Bound for Convex Decomposition of Simple Polygons. 181-192
  
• Olivier Devillers:
  On Deletion in Delaunay Triangulations. 193-206
  
• Jong-Sung Ha, Sung Yong Shin:
  Edge Advancing Rules for Intersecting Spherical Convex Polygons. 207-216
  
• Sergei Bespamyatnikh:
  An Optimal Morphing Between Polylines. 217-228
  
• Olivier Devillers, Pedro A. Ramos:
  Computing Roundness is Easy if the Set is Almost Round. 229-248
  
• Xuehou Tan:
  Finding an Optimal Bridge Between Two Polygons. 249-262
  
• Joseph O'Rourke:
  Computational Geometry Column 43. 263-266
  

Volume 12, Number 4, August 2002

• Takeshi Tokuyama:
  Guest Editor's Foreword. 267-268
  
• Alexander Wolff, Michael Thon, Yin-Feng Xu:
  A Simple Factor-2/3 Approximation Algorithm for Two-Circle Point Labeling. 269-282
  
• Prosenjit Bose, Andrej Brodnik, Svante Carlsson, Erik D. Demaine, Rudolf Fleischer, Alejandro López-Ortiz, Pat Morin, J. Ian Munro:
  Online Routing in Convex Subdivisions. 283-296
  
• Prosenjit Bose, Pat Morin:
  An Improved Algorithm for Subdivision Traversal without Extra Storage. 297-308
  
• Danny Z. Chen, Xiaobo Hu, Xiaodong Wu:
  Optimal Polygon Cover Problems and Applications. 309-338
  
• Sang-Min Park, Jae-Ha Lee, Kyung-Yong Chwa:
  Searching a Room by Two Guards. 339-352
  

Volume 12, Number 5, October 2002

• Tamal K. Dey, Rephael Wenger:
  Fast Reconstruction of Curves with Sharp Corners. 353-400
  
• Adrian Dumitrescu, János Pach:
  Partitioning Colored Point Sets into Monochromatic Parts. 401-412
  
• Danny Z. Chen, Jie Wang, Xiaodong Wu:
  Image Segmentation with Asteroidality/Tubularity and Smoothness Constraints. 413-428
  
• Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama:
  Parametric Polymatroid Optimization and Its Geometric Applications. 429-444
  

Volume 12, Number 6, December 2002

• Prosenjit Bose, Luc Devroye, William S. Evans:
  Diamonds are Not a Minimum Weight Triangulation's Best Friend. 445-454
  
• Hiroshi Imai, Tomonari Masada, Fumihiko Takeuchi, Keiko Imai:
  Enumerating Triangulations in General Dimensions. 455-480
  
• Jia Feng Weng:
  Generalized Melzak's Construction in the Steiner Tree Problem. 481-488
  
• Grégoire Malandain, Jean-Daniel Boissonnat:
  Computing the Diameter of a Point Set. 489-510
  
• Atsushi Koike, Shin-Ichi Nakano, Takao Nishizeki, Takeshi Tokuyama, Shuhei Watanabe:
  Labeling Points with Rectangles of Various Shapes. 511-528
  

Last update Tue May 21 14:38:12 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page