scientific article

Publication date: 19 January 2005

Full work available at URL: http://www.sciencedirect.com/science/book/9781558608610

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

grid digital geometry digital pictures geometric operations

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (only showing first 100 items - show all)

Relations as Images ⋮ Does Rotation Influence the Estimated Contour Length of a Digital Object? ⋮ Unnamed Item ⋮ Discrete Driver Assistance ⋮ GENUS AND DIMENSION OF DIGITAL IMAGES AND THEIR TIME- AND SPACE-EFFICIENT COMPUTATION ⋮ Extrapolation of stationary random fields via level sets ⋮ 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 ⋮ On Connectivity of Discretized 2D Explicit Curve ⋮ Monotonic sampling of a continuous closed curve with respect to its Gauss digitization: application to length estimation ⋮ A simple discrete calculus for digital surfaces ⋮ Digital continuity of rotations in the 2D regular grids ⋮ A combinatorial technique for generation of digital plane using GCD ⋮ Non-traditional 2D grids in combinatorial imaging -- advances and challenges ⋮ Rectangularization of digital objects and its relation with straight skeletons ⋮ On the number of 0-tandems in simple $n$D digital 0-connected curves ⋮ On the construction of planar embedding for a class of orthogonal polyhedra ⋮ Largest area parallelogram inside a digital object in a triangular grid ⋮ Piercing the Chessboard ⋮ Surface-based computation of the Euler characteristic in the BCC grid ⋮ INTEGRAL TOPOGRAPHIC CHARACTERISTICS IN SOLVING PROBLEMS OF REMOTE SENSING DATA PROCESSING ⋮ Robust and Convergent Curvature and Normal Estimators with Digital Integral Invariants ⋮ Unnamed Item ⋮ Unnamed Item ⋮ 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 ⋮ 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 ⋮ Local Digital Estimators of Intrinsic Volumes for Boolean Models and in the Design-Based Setting ⋮ K3M: A universal algorithm for image skeletonization and a review of thinning techniques ⋮ Multigrid-convergence of digital curvature estimators ⋮ Curvature and Flow in Digital Space ⋮ Digital shapes, digital boundaries and rigid transformations: A topological discussion ⋮ Rotations on the triangular grid: angles of changes of the neighborhood motion map ⋮ 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 ⋮ A note on 0-gaps in 3D digital curves ⋮ Computing the minimal perimeter polygon for digital objects in the triangular tiling ⋮ 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 ⋮ Rough Geometry and Its Applications in Character Recognition ⋮ 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 ⋮ Convex and Concave Vertices on a Simple Closed Curve in the Triangular Grid ⋮ Efficient Algorithms to Test Digital Convexity ⋮ Recognition of Antimatroidal Point Sets ⋮ A Combinatorial Technique for Construction of Triangular Covers of Digital Objects ⋮ A note on dimension and gaps in digital geometry ⋮ From prima quadraginta octant to lattice sphere through primitive integer operations ⋮ Multigrid convergence for the MDCA curvature estimator ⋮ Properties of Gauss digitized shapes and digital surface integration ⋮ A polygonal approximation for general 4-contours corresponding to weakly simple curves ⋮ Mapping multiple regions to the grid with bounded Hausdorff distance ⋮ Curvature estimation along noisy digital contours by approximate global optimization ⋮ Tangential cover for thick digital curves ⋮ Non-local estimators: a new class of multigrid convergent length estimators ⋮ Convex digital polygons, maximal digital straight segments and convergence of discrete geometric estimators ⋮ Strongly normal sets of contractible tiles in $n$ dimensions ⋮ On the characterization of absentee-voxels in a spherical surface and volume of revolution in ${\mathbb Z}^3$ ⋮ Optimal conditions for connectedness of discretized sets ⋮ Corrected curvature measures ⋮ Digital planarity -- a review ⋮ 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 ⋮ On the Farey sequence and its augmentation for applications to image analysis ⋮ Connectivity calculus of fractal polyhedrons ⋮ Homological spanning forest framework for 2D image analysis ⋮ Two efficient algorithms for computing the characteristics of a subsegment of a digital straight line ⋮ Computation of the Euler number using the contact perimeter ⋮ The number of Khalimsky-continuous functions on intervals ⋮ On covering a digital disc with concentric circles in $\mathbb Z^2$ ⋮ On different topological classes of spherical geodesic paths and circles in $\mathbb{Z}^3$ ⋮ On the composition of digitally continuous multivalued functions ⋮ 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 ⋮ Homotopic affine transformations in the 2D Cartesian grid ⋮ Approximation and convergence of the intrinsic volume ⋮ 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 ⋮ Efficiently testing digital convexity and recognizing digital convex polygons

Uses Software

Unnamed Item

This page was built for publication: