目次

Computational Complexity of Restricted Polygon Decompositions (A.Aggarwal, S.K. Ghosh, R.K. Shyamasundar). Computing Monotone SimpleCircuits in the Plane (D. Avis, D. Rappaport). Circular Separability ofPlanar Point Sets (B.K. Bhattacharya). Symmetry Finding Algorithms (P.Eades). Computing the Relative Neighbour Decomposition of a SimplePolygon (H.A. ElGindy, G.T. Toussaint). Polygonal Approximations of aCurve - Formulations and Algorithms (H. Imai, M. Iri). On PolygonalChain Approximation (A.A. Melkman, J. O'Rourke). Uniqueness ofOrthogonal Connect-the-Dots (J. O'Rourke). On the Shape of a Set ofPoints (J.D. Radke). Ortho-Convexity and Its Generalizations (G.J.E.Rawlins, D. Wood). Guard Placement in Rectilinear Polygons (J.R. Sack,G.T. Toussaint). Realizability of Polyhedrons from Line Drawings (K.Sugihara). Voronoi and Related Neighbours on Digitized Two-DimensionalSpace with Applications to Texture Analysis (J. Toriwaki, S. Yokoi). AGraph-Theoretical Primal Sketch (G.T. Toussaint).