04704nam 2200589 a 450 991048398660332120200520144314.03-540-31965-43-540-25513-310.1007/b135490(CKB)1000000000212908(SSID)ssj0000317240(PQKBManifestationID)11246652(PQKBTitleCode)TC0000317240(PQKBWorkID)10287843(PQKB)10267407(DE-He213)978-3-540-31965-8(MiAaPQ)EBC3067993(PPN)123093732(EXLCZ)99100000000021290820050317d2005 uy engurnn|008mamaatxtccrDiscrete geometry for computer imagery 12th international conference, DGCI 2005, Poitiers, France, April 13-15, 2005 : proceedings /Eric Andres, Guillaume Damiand, Pascal Lienhardt (eds.)1st ed. 2005.Berlin ;New York Springerc20051 online resource (X, 430 p.) Lecture notes in computer science,0302-9743 ;3429Bibliographic Level Mode of Issuance: MonographPrinted edition: 9783540255130 Includes bibliographical references and index.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.Lecture notes in computer science ;3429.Computer graphicsCongressesDiscrete geometryData processingCongressesComputer graphicsDiscrete geometryData processing006.601516Andres Eric1752971Damiand Guillaume1618577Lienhardt Pascal1752972DGCI 2005MiAaPQMiAaPQMiAaPQBOOK9910483986603321Discrete geometry for computer imagery4188482UNINA