Discrete Geometry for Computer Imagery

This proceedings volume includes papers for presentation at DGCI 2000 in U- sala, Sweden, 13 15 December 2000. DGCI 2000 is the 9th in a series of inter- tional conferences on Discrete Geometry for Computer Imagery. DGCI 2000 is organized by the Centre for Image Analysis (Swedish University of Agricultural Sciences and Uppsala University). It is sponsored by the International Assoc- tion for Pattern Recognition (IAPR) and by the Swedish Society for Automated Image Analysis (SSAB). This is the ?rst DGCI conference to take place outside France. The number of researchers active in the ?eld of discrete geometry and c- puter imagery is increasing. In comparison with the previous editions, DGCI 2000 has attracted a signi?cantly larger number of research contributions from a- demic and research institutions in di?erent countries. In fact, 62 papers were s- mitted. The contributions focus on topology, discrete images, surfaces and v- umes, shape representation, and shape understanding. After careful reviewing by an international board of reviewers, 40 papers from 16 countries were accepted, leading to a high-quality conference. Of the 40 accepted papers, 28 were selected for oral presentation and 12 for poster presentation. All accepted contributions have been scheduled in plenary sessions. The programme also has been enriched by three invited lectures, presented by three internationally known speakers: Pieter Jonker (Delft University of Technology, The Netherlands), Pierre Soille (ISPRA, Italy), and Jayaram K. Udupa (University of Pennsylvania, USA).

Includes supplementary material: sn.pub/extras

Inhalt
Topology.- Homotopy in Digital Spaces.- Tesselations by Connection in Orders.- A Concise Characterization of 3D Simple Points.- Digital n-Pseudomanifold and n-Weakmanifold in a Binary (n + 1)-Digital Image.- Digital Jordan Curve Theorems.- A New Means for Investigating 3-Manifolds.- Nearness in Digital Images and Proximity Spaces.- Morphological Operators with Discrete Line Segments.- Hausdorff Discretizations of Algebraic Sets and Diophantine Sets.- Discrete Images.- An Algorithm for Reconstructing Special Lattice Sets from Their Approximate X-Rays.- A Question of Digital Linear Algebra.- Reconstruction of Discrete Sets with Absorption.- Some Properties of Hyperbolic Networks.- The Reconstruction of the Digital Hyperbola Segment from Its Code.- Determining Visible Points in a Three-Dimensional Discrete Space.- Surfaces and Volumes.- Extended Reeb Graphs for Surface Understanding and Description.- Euclidean Nets: An Automatic and Reversible Geometric Smoothing of Discrete 3D Object Boundaries.- Object Discretization in Higher Dimensions.- Strong Thinning and Polyhedrization of the Surface of a Voxel Object.- Deformable Modeling for Characterizing Biomedical Shape Changes.- Naive Planes as Discrete Combinatorial Surfaces.- Surface Digitizations by Dilations Which Are Tunnel-Free.- Delaunay Surface Reconstruction from Scattered Points.- Go Digital, Go Fuzzy.- Recognition of Digital Naive Planes and Polyhedrization.- Shape Representation.- Topological Encoding of 3D Segmented Images.- Some Weighted Distance Transforms in Four Dimensions.- Representing 2D Digital Objects.- Plane Embedding of Dually Contracted Graphs.- A New Visibility Partition for Affine Pattern Matching.- Morphological Operations on 3D and 4D Images: From Shape Primitive Detection to Skeletonization.- Efficient Algorithms to Implement the Confinement Tree.- A 3D 3-Subiteration Thinning Algorithm for Medial Surfaces.- Computing 3D Medial Axis for Chamfer Distances.- Multiresolution Modelling of Polygonal Surface Meshes Using Triangle Fans.- Detecting Centres of Maximal Geodesic Discs on the Distance Transform of Surfaces in 3D Images.- The Envelope of a Digital Curve Based on Dominant Points.- Shape Representation.- Minimum-Length Polygons in Simple Cube-Curves.- Planar Object Detection under Scaled Orthographic Projection.- Detection of the Discrete Convexity of Polyominoes.- An Efficient Shape-Based Approach to Image Retrieval.- Towards Feature Fusion - The Synthesis of Contour Sections Distinguishing Contours from Different Classes.- Parallel Line Grouping Based on Interval Graphs.