Publication:3155868
From MaRDI portal
zbMath1064.68090MaRDI QIDQ3155868
Reinhard Klette, Azriel Rosenfeld
Publication date: 19 January 2005
Full work available at URL: http://www.sciencedirect.com/science/book/9781558608610
68-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Related Items
Digital Geometry in Image-Based Metrology, Separable Distance Transformation and Its Applications, Digital Straightness, Circularity, and Their Applications to Image Analysis, Shape Analysis with Geometric Primitives, GENUS AND DIMENSION OF DIGITAL IMAGES AND THEIR TIME- AND SPACE-EFFICIENT COMPUTATION, What Can We Learn from Discrete Images about the Continuous World?, Decomposition and Construction of Neighbourhood Operations Using Linear Algebra, Digitally Continuous Multivalued Functions, Weighted Neighbourhood Sequences in Non-Standard Three-Dimensional Grids – Metricity and Algorithms, Euclidean Eccentricity Transform by Discrete Arc Paving, Digital Planar Surface Segmentation Using Local Geometric Patterns, Tangential Cover for Thick Digital Curves, Two efficient algorithms for computing the characteristics of a subsegment of a digital straight line, On covering a digital disc with concentric circles in \(\mathbb Z^2\), Computation of the Euler number using the contact perimeter, The number of Khalimsky-continuous functions on intervals, Shape elongation from optimal encasing rectangles, Two discrete versions of the inscribed square conjecture and some related problems, Approximating Euclidean circles by neighbourhood sequences in a hexagonal grid, In-place algorithm for erasing a connected component in a binary image, The boundary and the shape of binary images, Two linear-time algorithms for computing the minimum length polygon of a digital contour, Curvature estimation along noisy digital contours by approximate global optimization, Tangential cover for thick digital curves, Strongly normal sets of contractible tiles in \(n\) dimensions, Digital planarity -- a review, Number-theoretic interpretation and construction of a digital circle, Some theoretical challenges in digital geometry: a perspective, Path-based distance functions in \(n\)-dimensional generalizations of the face- and body-centered cubic grids, Thinning on cell complexes from polygonal tilings, Existence problem of a generalized universal covering space, The almost pasting property of digital continuity, Digital topological method for computing genus and the Betti numbers, Surface area estimation of digitized 3D objects using quasi-Monte Carlo methods, Fast distance transformation on irregular two-dimensional grids, Uniqueness of the perfect fusion grid on \(\mathbb{Z}^d\), Topological properties of thinning in 2-D pseudomanifolds, Formulas for the number of \((n-2)\)-gaps of binary objects in arbitrary dimension, Minimum decomposition of a digital surface into digital plane segments is NP-hard, Digitization scheme that assures faithful reconstruction of plane figures, Provably correct reconstruction of surfaces from sparse noisy samples, Comparison and improvement of tangent estimators on digital curves, Plane digitization and related combinatorial problems, Homological spanning forest framework for 2D image analysis, Determining digital circularity using integer intervals, A geometric dissimilarity criterion between Jordan spatial mosaics. Theoretical aspects and application to segmentation evaluation, Digitally continuous multivalued functions, morphological operations and thinning algorithms, Curvature weighted gradient based shape orientation, The number of continuous curves in digital geometry, Convex digital polygons, maximal digital straight segments and convergence of discrete geometric estimators, Boundary based shape orientation, Accurate Curvature Estimation along Digital Contours with Maximal Digital Circular Arcs, Construction of 3D Orthogonal Cover of a Digital Object, The Number of Khalimsky-Continuous Functions between Two Points, Maximal Planes and Multiscale Tangential Cover of 3D Digital Objects, Isoperimetrically Optimal Polygons in the Triangular Grid, Dynamic Minimum Length Polygon, Discrete Driver Assistance, Rough Geometry and Its Applications in Character Recognition, Unnamed Item, K3M: A universal algorithm for image skeletonization and a review of thinning techniques, Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a Digital Contour, Multiscale Discrete Geometry, Digital Deformable Model Simulating Active Contours, Thinning Algorithms as Multivalued ${\mathcal{N}}$ -Retractions, Minimal Offsets That Guarantee Maximal or Minimal Connectivity of Digital Curves in nD, A Novel Algorithm for Distance Transformation on Irregular Isothetic Grids, Recognition of Antimatroidal Point Sets
Uses Software
