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
Robust and Convergent Curvature and Normal Estimators with Digital Integral Invariants, 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, A Combinatorial Technique for Construction of Triangular Covers of Digital Objects, From prima quadraginta octant to lattice sphere through primitive integer operations, Properties of Gauss digitized shapes and digital surface integration, Non-local estimators: a new class of multigrid convergent length estimators, On the characterization of absentee-voxels in a spherical surface and volume of revolution in \({\mathbb Z}^3\), 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\), Asymptotic variance of grey-scale surface area estimators, Contextual array grammars and array P systems, On finding a shortest isothetic path and its monotonicity inside a digital object, Cellular topology and topological coordinate systems on the hexagonal and on the triangular grids, Voronoi-based estimation of Minkowski tensors from finite point samples, On the polyhedra of graceful spheres and circular geodesics, A new algorithmic framework for basic problems on binary images, A linear-time algorithm to compute the triangular hull of a digital object, 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, On different topological classes of spherical geodesic paths and circles in \(\mathbb{Z}^3\), On the composition of digitally continuous multivalued functions, Approximation and convergence of the intrinsic volume, 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, On the Farey sequence and its augmentation for applications to image analysis, Connectivity calculus of fractal polyhedrons, On a recursive construction of circular paths and the search for \(\pi \) on the integer lattice \(\mathbb {Z}^2\), Topological analysis of voxelized objects by discrete geodesic Reeb graph, Finding a largest rectangle inside a digital object and rectangularization, 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, Generation of random digital simple curves with artistic emulation, Fast circular arc segmentation based on approximate circularity and cuboid graph, On multigrid convergence of local algorithms for intrinsic volumes, Estimation of intrinsic volumes from digital grey-scale images, Characterization of the deletion of \((26, 6)\)-simple points as multivalued \((\mathcal{N}, 26)\)-retractions, Fast recognition of a digital straight line subsegment: two algorithms of logarithmic time complexity, The number of continuous curves in digital geometry, Measuring linearity of connected configurations of a finite number of 2D and 3D curves, Multigrid convergence for the MDCA curvature estimator, Convex digital polygons, maximal digital straight segments and convergence of discrete geometric estimators, About the decidability of polyhedral separability in the lattice \(\mathbb {Z}^d\). Recognizing digital polyhedra with a prescribed number of faces, On the functionality and usefulness of quadraginta octants of naive sphere, Covering a Euclidean line or hyperplane by dilations of its discretization, Boundary based shape orientation, On the completeness of hierarchical tensor-product image-splines, On Some Local Topological Properties of Naive Discrete Sphere, DIG: Discrete Iso-contour Geodesics for Topological Analysis of Voxelized Objects, Solving Distance Geometry Problem with Inexact Distances in Integer Plane, Portal Extraction Based on an Opening Labeling for Ray Tracing, A Combinatorial 4-Coordinate System for the Diamond Grid, Wiener Index on Lines of Unit Cells of the Body-Centered Cubic Grid, 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, Relations as Images, GENUS AND DIMENSION OF DIGITAL IMAGES AND THEIR TIME- AND SPACE-EFFICIENT COMPUTATION, On Connectivity of Discretized 2D Explicit Curve, Local Digital Estimators of Intrinsic Volumes for Boolean Models and in the Design-Based Setting, 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
Uses Software
