Discrete Geometry for Computer Imagery 9th International Conference, DGCI 2000 Uppsala, Sweden, December 13-15, 2000 Proceedings /

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Borgefors, Gunilla (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Nyström, Ingela (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Sanniti di Baja, Gabriella (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2000.
Έκδοση:1st ed. 2000.
Σειρά:Lecture Notes in Computer Science, 1953
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 05458nam a2200601 4500
001 978-3-540-44438-1
003 DE-He213
005 20191025111221.0
007 cr nn 008mamaa
008 121227s2000 gw | s |||| 0|eng d
020 |a 9783540444381  |9 978-3-540-44438-1 
024 7 |a 10.1007/3-540-44438-6  |2 doi 
040 |d GrThAP 
050 4 |a QA76.76.A65 
072 7 |a UB  |2 bicssc 
072 7 |a COM018000  |2 bisacsh 
072 7 |a UB  |2 thema 
082 0 4 |a 004  |2 23 
245 1 0 |a Discrete Geometry for Computer Imagery  |h [electronic resource] :  |b 9th International Conference, DGCI 2000 Uppsala, Sweden, December 13-15, 2000 Proceedings /  |c edited by Gunilla Borgefors, Ingela Nyström, Gabriella Sanniti di Baja. 
250 |a 1st ed. 2000. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 2000. 
300 |a XII, 548 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 1953 
505 0 |a 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. 
650 0 |a Application software. 
650 0 |a Computer graphics. 
650 0 |a Optical data processing. 
650 0 |a Natural language processing (Computer science). 
650 0 |a Algorithms. 
650 0 |a Computer science-Mathematics. 
650 1 4 |a Computer Applications.  |0 http://scigraph.springernature.com/things/product-market-codes/I23001 
650 2 4 |a Computer Graphics.  |0 http://scigraph.springernature.com/things/product-market-codes/I22013 
650 2 4 |a Image Processing and Computer Vision.  |0 http://scigraph.springernature.com/things/product-market-codes/I22021 
650 2 4 |a Natural Language Processing (NLP).  |0 http://scigraph.springernature.com/things/product-market-codes/I21040 
650 2 4 |a Algorithm Analysis and Problem Complexity.  |0 http://scigraph.springernature.com/things/product-market-codes/I16021 
650 2 4 |a Discrete Mathematics in Computer Science.  |0 http://scigraph.springernature.com/things/product-market-codes/I17028 
700 1 |a Borgefors, Gunilla.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Nyström, Ingela.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Sanniti di Baja, Gabriella.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783662169711 
776 0 8 |i Printed edition:  |z 9783540413967 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 1953 
856 4 0 |u https://doi.org/10.1007/3-540-44438-6  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
912 |a ZDB-2-BAE 
950 |a Computer Science (Springer-11645)