scientific article; zbMATH DE number 1436417

Publication date: 27 April 2000

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

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Analytic and descriptive geometry (51N99)

Related Items (90)

Palindromic language of thin discrete planes ⋮ On a conjecture on bidimensional words. ⋮ Insight in discrete geometry and computational content of a discrete model of the continuum ⋮ Lyndon + Christoffel = digitally convex ⋮ Run-hierarchical structure of digital lines with irrational slopes in terms of continued fractions and the Gauss map ⋮ Gift-wrapping based preimage computation algorithm ⋮ Tangential cover for thick digital curves ⋮ Two equivalence relations on digital lines with irrational slopes. A continued fraction approach to upper mechanical words ⋮ Functional stepped surfaces, flips, and generalized substitutions ⋮ On the topology of an arithmetic plane ⋮ Quasi-affine transformations: Tilings by reciprocal images ⋮ Digital planarity -- a review ⋮ Connectivity of discrete planes ⋮ Analysis of noisy digital contours with adaptive tangential cover ⋮ Covering a Euclidean line or hyperplane by dilations of its discretization ⋮ A simple algorithm for digital line recognition in the general case ⋮ A discrete geometry approach for dominant point detection ⋮ Digital lines with irrational slopes ⋮ Two efficient algorithms for computing the characteristics of a subsegment of a digital straight line ⋮ A study of Jacobi-Perron boundary words for the generation of discrete planes ⋮ An optimal parallel algorithm for digital curve segmentation ⋮ Multi-scale arithmetization of linear transformations ⋮ On Connectivity of Discretized 2D Explicit Curve ⋮ Foundational aspects of multiscale digitization ⋮ Combinatorial generation of planar sets ⋮ Geometry, dynamics, and arithmetic of $S$-adic shifts ⋮ An optimal parallel algorithm for digital curve segmentation using hough polygons and monotone function search ⋮ Tangential cover for 3D irregular noisy digital curves ⋮ A new lattice-based plane-probing algorithm ⋮ Introduction to discrete soft transforms ⋮ Digital geometry, mathematical morphology, and discrete optimization: a survey ⋮ Piercing the Chessboard ⋮ An optimized framework for plane-probing algorithms ⋮ Computing efficiently the lattice width in any dimension ⋮ Robust and Convergent Curvature and Normal Estimators with Digital Integral Invariants ⋮ S-adic Sequences: A Bridge Between Dynamics, Arithmetic, and Geometry ⋮ The Number of Khalimsky-Continuous Functions between Two Points ⋮ Translation of a Digital Line into another according to various Digitization Processes ⋮ On properties of analytical approximation for discretizing 2D curves and 3D surfaces ⋮ Digital objects in rhombic dodecahedron grid ⋮ On 2D constrained discrete rigid transformations ⋮ Optimal simplification of polygonal chains for subpixel-accurate rendering ⋮ Dominant point detection based on discrete curve structure and applications ⋮ Continuous digitization in Khalimsky spaces ⋮ Geometrical models for a class of reducible Pisot substitutions ⋮ Topology-preserving conditions for 2D digital images under rigid transformations ⋮ Digital Straightness ⋮ “Honeycomb” vs Square and Cubic Models ⋮ Remainder approach for the computation of digital straight line subsegment characteristics ⋮ Discrete segments of $\mathbb{Z}^3$ constructed by synchronization of words ⋮ Euclidean farthest-point Voronoi diagram of a digital edge ⋮ The Barycenter Theorem: Averaging Possible-Paths to Produce Optimal Discrete Straight-line Segments ⋮ Quasi-affine transformations and parings of the discret plane ⋮ Plane digitization and related combinatorial problems ⋮ Formulas for the number of $(n-2)$-gaps of binary objects in arbitrary dimension ⋮ Minimal arithmetic thickness connecting discrete planes ⋮ Discrete-Euclidean operations ⋮ Minimum decomposition of a digital surface into digital plane segments is NP-hard ⋮ Generation and Recognition of Digital Planes Using Multi-dimensional Continued Fractions ⋮ Combinatorial View of Digital Convexity ⋮ Continued Fractions and Digital Lines with Irrational Slopes ⋮ Euclidean Eccentricity Transform by Discrete Arc Paving ⋮ Gift-Wrapping Based Preimage Computation Algorithm ⋮ Tangential Cover for Thick Digital Curves ⋮ On the min DSS problem of closed discrete curves ⋮ Digitization scheme that assures faithful reconstruction of plane figures ⋮ Shear based bijective digital rotation in hexagonal grids ⋮ Digital straight segment filter for geometric description ⋮ On the min DSS problem of closed discrete curves ⋮ Two linear-time algorithms for computing the minimum length polygon of a digital contour ⋮ Characterization of Simple Closed Surfaces in ℤ3: A New Proposition with a Graph-Theoretical Approach ⋮ Arithmetization of a Circular Arc ⋮ On the Connecting Thickness of Arithmetical Discrete Planes ⋮ Analytical description of digital intersections: minimal parameters and multiscale representation ⋮ Digital straightness -- a review ⋮ Digital Two-Dimensional Bijective Reflection and Associated Rotation ⋮ Facet Connectedness of Arithmetic Discrete Hyperplanes with Non-Zero Shift ⋮ Thin discrete triangular meshes ⋮ On digital plane preimage structure ⋮ Linear segmentation of discrete curves into blurred segments ⋮ An elementary digital plane recognition algorithm ⋮ Digital plane preimage structure ⋮ Application of a discrete tomography algorithm to computerized tomography ⋮ Detection of the discrete convexity of polyominoes ⋮ Graph-theoretical properties of parallelism in the digital plane ⋮ Graceful planes and lines. ⋮ Periodic graphs and connectivity of the rational digital hyperplanes ⋮ About local configurations in arithmetic planes. ⋮ Topological properties of Hausdorff discretization, and comparison to other discretization schemes. ⋮ A $d$-dimensional extension of Christoffel words

This page was built for publication: