Discrete Geometry for Computer Imagery: 9th International Conference, DGCI 2000 Uppsala, Sweden, December 13-15, 2000 Proceedings by Gunilla BorgeforsDiscrete Geometry for Computer Imagery: 9th International Conference, DGCI 2000 Uppsala, Sweden, December 13-15, 2000 Proceedings by Gunilla Borgefors

Discrete Geometry for Computer Imagery: 9th International Conference, DGCI 2000 Uppsala, Sweden…

byGunilla BorgeforsEditorIngela Nystr, Gabriella Sanniti di Baja

Paperback | November 29, 2000

Pricing and Purchase Info

$205.95

Earn 1,030 plum® points

Prices and offers may vary in store

Quantity:

In stock online

Ships free on orders over $25

Not available in stores

about

This book constitutes the refereed proceedings of the 9th International Conference on Discrete Geometry for Computer Imagery, DGCI 2000, held in Uppsala, Sweden in December 2000. The 40 revised papers presented together with two invited papers were carefully reviewed and selected from 62 submissions. The papers are organized in topical sections on topology, discrete images, surfaces and volumes, shape representation, and shape understanding.
Title:Discrete Geometry for Computer Imagery: 9th International Conference, DGCI 2000 Uppsala, Sweden…Format:PaperbackDimensions:548 pages, 23.3 × 15.5 × 0.07 inPublished:November 29, 2000Publisher:Springer-Verlag/Sci-Tech/TradeLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:3540413960

ISBN - 13:9783540413967

Look for similar items by category:

Reviews

Table of Contents

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.