Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Combinatorial maps : efficient data structures for computer graphics and image processing / / Guillaume Damiand, Pascal Lienhardt
| Combinatorial maps : efficient data structures for computer graphics and image processing / / Guillaume Damiand, Pascal Lienhardt |
| Autore | Damiand Guillaume |
| Edizione | [1st edition] |
| Pubbl/distr/stampa | Boca Raton : , : A.K. Peters/CRC Press, , [2015] |
| Descrizione fisica | 1 online resource (402 p.) |
| Disciplina |
005.7/3
005.73 |
| Soggetto topico |
Data structures (Compter science)
Image processing - Mathematics Computer graphics - Mathematics Combinatorial designs and configurations |
| ISBN |
0-429-17037-8
1-4822-0653-6 |
| Classificazione | COM012000TEC015000 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Front Cover; Contents; Acknowledgements; List of Algorithms; List of Figures; 1. Introduction; 2. Preliminary Notions; 3. Intuitive Presentation; 4. n-Gmaps; 5. n-maps; 6. Operations; 7. Embedding for Geometric Modeling and Image Processing; 8. Cellular Structures as Structured Simplicial Structures; 9. Comparison with Other Cellular Data Structures; 10. Concluding Remarks; Bibliography |
| Record Nr. | UNINA-9910787962403321 |
Damiand Guillaume
|
||
| Boca Raton : , : A.K. Peters/CRC Press, , [2015] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Discrete Geometry for Computer Imagery [[electronic resource] ] : 12th International Conference, DGCI 2005, Poitiers, France, April 11-13, 2005, Proceedings / / edited by Eric Andres, Guillaume Damiand, Pascal Lienhardt
| Discrete Geometry for Computer Imagery [[electronic resource] ] : 12th International Conference, DGCI 2005, Poitiers, France, April 11-13, 2005, Proceedings / / edited by Eric Andres, Guillaume Damiand, Pascal Lienhardt |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
| Descrizione fisica | 1 online resource (X, 430 p.) |
| Disciplina | 006.601516 |
| Collana | Image Processing, Computer Vision, Pattern Recognition, and Graphics |
| Soggetto topico |
Optical data processing
Computer graphics Computer science—Mathematics Computer simulation Algorithms Image Processing and Computer Vision Computer Graphics Discrete Mathematics in Computer Science Simulation and Modeling Algorithm Analysis and Problem Complexity |
| Soggetto non controllato |
Computer imagery
DGCI Pattern recognition Graph-based representations |
| ISBN |
3-540-31965-4
3-540-25513-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Applications -- Increasing Interconnection Network Connectivity for Reducing Operator Complexity in Asynchronous Vision Systems -- Geometric Robot Mapping -- Discrete Geometry Applied in Hard Real-Time Systems Validation -- Discrete Hierarchical Geometry -- Hierarchical Watersheds Within the Combinatorial Pyramid Framework -- Optimal Design of 2D/3D Hierarchical Content-Based Meshes for Multimedia -- Receptive Fields for Generalized Map Pyramids: The Notion of Generalized Orbit -- Resolution Pyramids on the FCC and BCC Grids -- Discrete Tomography -- The Mojette Transform: The First Ten Years -- On the Stability of Reconstructing Lattice Sets from X-rays Along Two Directions -- Reconstruction of Decomposable Discrete Sets from Four Projections -- A Tomographical Characterization of L-Convex Polyominoes -- Computerized Tomography with Digital Lines and Linear Programming -- A Discrete Modulo N Projective Radon Transform for N × N Images -- Two Remarks on Reconstructing Binary Vectors from Their Absorbed Projections -- How to Obtain a Lattice Basis from a Discrete Projected Space -- Discrete Topology -- Local Characterization of a Maximum Set of Digital (26,6)-Surfaces -- Algorithms for the Topological Watershed -- The Class of Simple Cube-Curves Whose MLPs Cannot Have Vertices at Grid Points -- Computation of Homology Groups and Generators -- Inclusion Relationships and Homotopy Issues in Shape Interpolation for Binary Images -- Object Properties -- Discrete Bisector Function and Euclidean Skeleton -- Pixel Queue Algorithm for Geodesic Distance Transforms -- Analysis and Comparative Evaluation of Discrete Tangent Estimators -- Surface Volume Estimation of Digitized Hyperplanes Using Weighted Local Configurations -- Rectification of the Chordal Axis Transform and a New Criterion for Shape Decomposition -- Reconstruction and Recognition -- Generalized Functionality for Arithmetic Discrete Planes -- Complexity Analysis for Digital Hyperplane Recognition in Arbitrary Fixed Dimension -- An Elementary Algorithm for Digital Line Recognition in the General Case -- Supercover Model and Digital Straight Line Recognition on Irregular Isothetic Grids -- Discrete Epipolar Geometry -- Local Point Configurations of Discrete Combinatorial Surfaces -- Reversible Polygonalization of a 3D Planar Discrete Curve: Application on Discrete Surfaces -- Uncertain Geometry -- Uncertain Geometry in Computer Vision -- Optimal Blurred Segments Decomposition in Linear Time -- Shape Preserving Digitization of Binary Images After Blurring -- Visualization -- A Low Complexity Discrete Radiosity Method -- A Statistical Approach for Geometric Smoothing of Discrete Surfaces -- Arbitrary 3D Resolution Discrete Ray Tracing of Implicit Surfaces. |
| Record Nr. | UNISA-996465674903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Discrete geometry for computer imagery : 12th international conference, DGCI 2005, Poitiers, France, April 13-15, 2005 : proceedings / / Eric Andres, Guillaume Damiand, Pascal Lienhardt (eds.)
| Discrete geometry for computer imagery : 12th international conference, DGCI 2005, Poitiers, France, April 13-15, 2005 : proceedings / / Eric Andres, Guillaume Damiand, Pascal Lienhardt (eds.) |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin ; ; New York, : Springer, c2005 |
| Descrizione fisica | 1 online resource (X, 430 p.) |
| Disciplina | 006.601516 |
| Altri autori (Persone) |
AndresEric
DamiandGuillaume LienhardtPascal |
| Collana | Lecture notes in computer science |
| Soggetto topico |
Computer graphics
Discrete geometry - Data processing |
| ISBN |
3-540-31965-4
3-540-25513-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Applications -- Increasing Interconnection Network Connectivity for Reducing Operator Complexity in Asynchronous Vision Systems -- Geometric Robot Mapping -- Discrete Geometry Applied in Hard Real-Time Systems Validation -- Discrete Hierarchical Geometry -- Hierarchical Watersheds Within the Combinatorial Pyramid Framework -- Optimal Design of 2D/3D Hierarchical Content-Based Meshes for Multimedia -- Receptive Fields for Generalized Map Pyramids: The Notion of Generalized Orbit -- Resolution Pyramids on the FCC and BCC Grids -- Discrete Tomography -- The Mojette Transform: The First Ten Years -- On the Stability of Reconstructing Lattice Sets from X-rays Along Two Directions -- Reconstruction of Decomposable Discrete Sets from Four Projections -- A Tomographical Characterization of L-Convex Polyominoes -- Computerized Tomography with Digital Lines and Linear Programming -- A Discrete Modulo N Projective Radon Transform for N × N Images -- Two Remarks on Reconstructing Binary Vectors from Their Absorbed Projections -- How to Obtain a Lattice Basis from a Discrete Projected Space -- Discrete Topology -- Local Characterization of a Maximum Set of Digital (26,6)-Surfaces -- Algorithms for the Topological Watershed -- The Class of Simple Cube-Curves Whose MLPs Cannot Have Vertices at Grid Points -- Computation of Homology Groups and Generators -- Inclusion Relationships and Homotopy Issues in Shape Interpolation for Binary Images -- Object Properties -- Discrete Bisector Function and Euclidean Skeleton -- Pixel Queue Algorithm for Geodesic Distance Transforms -- Analysis and Comparative Evaluation of Discrete Tangent Estimators -- Surface Volume Estimation of Digitized Hyperplanes Using Weighted Local Configurations -- Rectification of the Chordal Axis Transform and a New Criterion for Shape Decomposition -- Reconstruction and Recognition -- Generalized Functionality for Arithmetic Discrete Planes -- Complexity Analysis for Digital Hyperplane Recognition in Arbitrary Fixed Dimension -- An Elementary Algorithm for Digital Line Recognition in the General Case -- Supercover Model and Digital Straight Line Recognition on Irregular Isothetic Grids -- Discrete Epipolar Geometry -- Local Point Configurations of Discrete Combinatorial Surfaces -- Reversible Polygonalization of a 3D Planar Discrete Curve: Application on Discrete Surfaces -- Uncertain Geometry -- Uncertain Geometry in Computer Vision -- Optimal Blurred Segments Decomposition in Linear Time -- Shape Preserving Digitization of Binary Images After Blurring -- Visualization -- A Low Complexity Discrete Radiosity Method -- A Statistical Approach for Geometric Smoothing of Discrete Surfaces -- Arbitrary 3D Resolution Discrete Ray Tracing of Implicit Surfaces. |
| Record Nr. | UNINA-9910483986603321 |
| Berlin ; ; New York, : Springer, c2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||