My Account Log in

1 option

Discrete Geometry for Computer Imagery : 9th International Conference, DGCI 2000 Uppsala, Sweden, December 13-15, 2000 Proceedings / edited by Gunilla Borgefors, Ingela Nyström, Gabriella Sanniti di Baja.

LIBRA Q341 .P7 2004
Loading location information...

Available from offsite location This item is stored in our repository but can be checked out.

Log in to request item
Format:
Book
Contributor:
Borgefors, Gunilla, editor.
Nyström, Ingela, 1967- editor.
Sanniti di Baja, Gabriella, editor.
SpringerLink (Online service)
Series:
Computer Science (Springer-11645)
Lecture notes in computer science 0302-9743 ; 1953.
Lecture Notes in Computer Science, 0302-9743 ; 1953
Language:
English
Subjects (All):
Application software.
Computer graphics.
Optical data processing.
Natural language processing (Computer science).
Algorithms.
Computer science--Mathematics.
Computer science.
Computer Applications.
Computer Graphics.
Image Processing and Computer Vision.
Natural Language Processing (NLP).
Algorithm Analysis and Problem Complexity.
Discrete Mathematics in Computer Science.
Local Subjects:
Computer Applications.
Computer Graphics.
Image Processing and Computer Vision.
Natural Language Processing (NLP).
Algorithm Analysis and Problem Complexity.
Discrete Mathematics in Computer Science.
Physical Description:
1 online resource (XII, 548 pages).
Edition:
First edition 2000.
Contained In:
Springer eBooks
Place of Publication:
Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2000.
System Details:
text file PDF
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
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.
Other Format:
Printed edition:
ISBN:
978-3-540-44438-1
9783540444381
Access Restriction:
Restricted for use by site license.

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

Find

Home Release notes

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Find catalog Using Articles+ Using your account