Computational Geometry

Optimally computing a shortest weakly visible line segment inside a simple polygon
pp. 1-29(29)
Authors: Bhattacharya B.K.; Das G.; Mukhopadhyay A.; Narasimhan G.

Packing two disks in a polygon
pp. 31-42(12)
Author: Bespamyatnikh S.

Beta-skeletons have unbounded dilation
pp. 43-52(10)
Author: Eppstein D.

Models and motion planning
pp. 53-68(16)
Authors: de Berg M.; Katz M.J.; Overmars M.H.; van der Stappen A.F.; Vleugels J.

Orthogonal polygon reconstruction from stabbing information
pp. 69-83(15)
Authors: Jackson L.; Wismath S.K.

Higher order Delaunay triangulations
pp. 85-98(14)
Authors: Gudmundsson J.; Hammar M.; van Kreveld M.