Computational morphology : a computational geometric approach to the analysis of form

Computational Complexity of Restricted Polygon Decompositions (A. Aggarwal, S.K. Ghosh, R.K. Shyamasundar). Computing Monotone Simple Circuits in the Plane (D. Avis, D. Rappaport). Circular Separability of Planar Point Sets (B.K. Bhattacharya). Symmetry Finding Algorithms (P. Eades). Computing the Relative Neighbour Decomposition of a Simple Polygon (H.A. ElGindy, G.T. Toussaint). Polygonal Approximations of a Curve - Formulations and Algorithms (H. Imai, M. Iri). On Polygonal Chain Approximation (A.A. Melkman, J. O'Rourke). Uniqueness of Orthogonal Connect-the-Dots (J. O'Rourke). On the Shape of a Set of Points (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-Dimensional Space with Applications to Texture Analysis (J. Toriwaki, S. Yokoi). A Graph-Theoretical Primal Sketch (G.T. Toussaint).