Computational Geometry - Methods, Algorithms and Applications

The post office problem for fuzzy point sets.- An optimal algorithm for approximating a set of rectangles by two minimum area rectangles.- An on-line algorithm for constructing sweep planes in regular position.- Performance analysis of three curve representation schemes.- Preclassification and delayed classification of boundary entities in arbitrary dimensions.- On the morphology of polytopes in ?d.- Robustness in geometric modeling — Tolerance-based methods.- On shortest networks for classes of points in the plane.- Determination of the symmetries of polyhedra and an application to object recognition.- Moving along a street (extended abstract).- Planar geometric reasoning with the theory of hints.- Solving algebraic systems in Bernstein-Bézier representation.- XYZ: A project in experimental geometric computation.- Implementing the XYZ GeoBench: A programming environment for geometric algorithms.- Computing the rectilinear link diameter of a polygon.- Layout of flexible manufacturing systems — selected problems.- Dynamic Voronoi diagrams in motion planning.- Generating triangulations of 2-manifolds.- The TR*-tree: A new representation of polygonal objects supporting spatial queries and operations.- A Voronoi diagram based adaptive k-means-type clustering algorithm for multidimensional weighted data.- A Generalization of staircase visibility.- A new simple linear algorithm to recognize interval graphs.- Predictions about collision free paths from intersection tests.