000 | 04760nam a22005655i 4500 | ||
---|---|---|---|
001 | 978-3-540-44438-1 | ||
003 | DE-He213 | ||
005 | 20160624101948.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s2000 gw | s |||| 0|eng d | ||
020 |
_a9783540444381 _9978-3-540-44438-1 |
||
024 | 7 |
_a10.1007/3-540-44438-6 _2doi |
|
050 | 4 | _aT385 | |
072 | 7 |
_aUML _2bicssc |
|
072 | 7 |
_aCOM012000 _2bisacsh |
|
082 | 0 | 4 |
_a006.6 _223 |
245 | 1 | 0 |
_aDiscrete Geometry for Computer Imagery _h[electronic resource] : _b9th InternationalConference,DGCI 2000 Uppsala,Sweden,December 13–15,2000 Proceedings / _cedited by Gunilla Borgefors, Ingela Nyström, Gabriella Sanniti Baja. |
260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2000. |
|
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2000. |
|
300 |
_aXII, 548 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v1953 |
|
505 | 0 | _aTopology -- 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 | _aComputer science. | |
650 | 0 | _aComputer software. | |
650 | 0 | _aComputational complexity. | |
650 | 0 | _aText processing (Computer science. | |
650 | 0 | _aComputer graphics. | |
650 | 0 | _aComputer vision. | |
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aComputer Graphics. |
650 | 2 | 4 | _aImage Processing and Computer Vision. |
650 | 2 | 4 | _aDocument Preparation and Text Processing. |
650 | 2 | 4 | _aAlgorithm Analysis and Problem Complexity. |
650 | 2 | 4 | _aDiscrete Mathematics in Computer Science. |
700 | 1 |
_aBorgefors, Gunilla. _eeditor. |
|
700 | 1 |
_aNyström, Ingela. _eeditor. |
|
700 | 1 |
_aBaja, Gabriella Sanniti. _eeditor. |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783540413967 |
786 | _dSpringer | ||
830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v1953 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/3-540-44438-6 |
942 |
_2EBK4851 _cEBK |
||
999 |
_c34145 _d34145 |