Discrete Geometry for Computer Imagery: 9th International Conference, DGCI 2000 Uppsala, Sweden, December 13-15, 2000 Proceedings: Lecture Notes in Computer Science, cartea 1953
Editat de Gunilla Borgefors, Ingela Nyström, Gabriella Sanniti di Bajaen Limba Engleză Paperback – 29 noi 2000
Din seria Lecture Notes in Computer Science
- 20%
Preț: 323.14 lei - 20%
Preț: 461.32 lei - 20%
Preț: 460.98 lei - 20%
Preț: 390.41 lei - 20%
Preț: 526.98 lei - 15%
Preț: 388.21 lei - 20%
Preț: 461.21 lei - 20%
Preț: 390.08 lei - 20%
Preț: 496.30 lei - 20%
Preț: 461.21 lei - 20%
Preț: 389.45 lei - 15%
Preț: 461.53 lei - 20%
Preț: 389.63 lei - 20%
Preț: 496.68 lei - 20%
Preț: 461.70 lei - 20%
Preț: 251.97 lei - 20%
Preț: 390.86 lei - 20%
Preț: 532.16 lei - 20%
Preț: 461.52 lei - 20%
Preț: 255.72 lei - 20%
Preț: 498.10 lei - 20%
Preț: 497.19 lei - 20%
Preț: 499.02 lei - 20%
Preț: 389.82 lei - 20%
Preț: 390.92 lei - 20%
Preț: 390.86 lei - 20%
Preț: 390.92 lei - 20%
Preț: 390.08 lei - 20%
Preț: 461.45 lei - 20%
Preț: 392.36 lei - 20%
Preț: 460.75 lei - 20%
Preț: 461.32 lei - 20%
Preț: 389.90 lei - 20%
Preț: 639.26 lei - 20%
Preț: 390.66 lei - 20%
Preț: 391.57 lei - 20%
Preț: 389.57 lei - 20%
Preț: 497.97 lei - 20%
Preț: 462.36 lei - 20%
Preț: 460.67 lei - 20%
Preț: 423.95 lei - 5%
Preț: 515.91 lei - 15%
Preț: 535.55 lei - 20%
Preț: 531.90 lei - 20%
Preț: 403.00 lei - 20%
Preț: 535.41 lei - 20%
Preț: 461.25 lei - 20%
Preț: 498.17 lei - 20%
Preț: 461.52 lei - 20%
Preț: 249.77 lei
Preț: 705.92 lei
Preț vechi: 882.39 lei
-20%
Puncte Express: 1059
Preț estimativ în valută:
124.95€ • 145.78$ • 108.20£
124.95€ • 145.78$ • 108.20£
Carte tipărită la comandă
Livrare economică 23-28 februarie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540413967
ISBN-10: 3540413960
Pagini: 560
Ilustrații: XII, 548 p.
Dimensiuni: 155 x 233 x 29 mm
Greutate: 1.29 kg
Ediția:2000
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540413960
Pagini: 560
Ilustrații: XII, 548 p.
Dimensiuni: 155 x 233 x 29 mm
Greutate: 1.29 kg
Ediția:2000
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
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.
Caracteristici
Includes supplementary material: sn.pub/extras