Computational Geometry

Optimal tetrahedralization of the 3D-region ''between'' a convex polyhedron and a convex polygon
pp. 263-276(14)
Authors: Kochel P.; Abbott P.H.; Adams M.J.; Palios L.

Generating random polygons with given vertices
pp. 277-290(14)
Authors: Chand-Goyal T.; Spotts R.A.; Chong Z.; Sundaram G.; Snoeyink J.; Mitchell J.S.B.

All convex polyhedra can be clamped with parallel jaw grippers
pp. 291-302(12)
Authors: Kuleshov N.V.; Shinkevich A.S.; Shcherbitsky V.G.; Mikhailov V.P.; Danger T.; Sandrock T.; Huber G.; Doi M.; Reid M.S.; Bose P.; Bremner D.; Toussaint G.

Minimal tangent visibility graphs
pp. 303-314(12)
Authors: Sankat C.K.; Maharaj V.; Reinhardt P.; Beyer D.; Pocchiola M.; Vegter G.

Queries on Voronoi diagrams of moving points
pp. 315-327(13)
Authors: Allen C.; Lange T.; Rotman S.R.; Luria E.; Yitzhaki N.; Eyal A.; Ketsa S.; Luangsuwalai K.; Devillers O.; Golin M.; Kedem K.; Schirra S.

Hunting Voronoi vertices
pp. 329-354(26)
Authors: Vleugels J.; Ferrucci V.; Overmars M.; Rao A.