scientific article; zbMATH DE number 1436417
From MaRDI portal
Publication:4948843
zbMATH Open1079.51513MaRDI QIDQ4948843FDOQ4948843
Authors: Jean-Pierre Reveillès 
Publication date: 27 April 2000
Title of this publication is not available (Why is that?)
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55) Analytic and descriptive geometry (51N99)
Cited In (96)
- A study of Jacobi-Perron boundary words for the generation of discrete planes
- Detection of the discrete convexity of polyominoes
- Continued Fractions and Digital Lines with Irrational Slopes
- On the min DSS problem of closed discrete curves
- Palindromic language of thin discrete planes
- An optimal parallel algorithm for digital curve segmentation
- Gift-wrapping based preimage computation algorithm
- Insight in discrete geometry and computational content of a discrete model of the continuum
- Tangential cover for thick digital curves
- Two equivalence relations on digital lines with irrational slopes. A continued fraction approach to upper mechanical words
- Digital lines with irrational slopes
- Tangential cover for 3D irregular noisy digital curves
- Title not available (Why is that?)
- Characterization of simple closed surfaces in \(\mathbb Z^{3}\): a new proposition with a graph-theoretical approach
- Minimum decomposition of a digital surface into digital plane segments is NP-hard
- Connectivity of discrete planes
- Dominant point detection based on discrete curve structure and applications
- On the topology of an arithmetic plane
- Lyndon + Christoffel = digitally convex
- Digital planarity -- a review
- Minimal arithmetic thickness connecting discrete planes
- Plane digitization and related combinatorial problems
- Digitization scheme that assures faithful reconstruction of plane figures
- Graceful planes and lines.
- Functional stepped surfaces, flips, and generalized substitutions
- Geometry, dynamics, and arithmetic of $S$-adic shifts
- On a conjecture on bidimensional words.
- On the connecting thickness of arithmetical discrete planes
- Continuous digitization in Khalimsky spaces
- Topology-preserving conditions for 2D digital images under rigid transformations
- Discrete-Euclidean operations
- Digital straightness -- a review
- Tangential Cover for Thick Digital Curves
- A simple algorithm for digital line recognition in the general case
- A discrete geometry approach for dominant point detection
- Quasi-affine transformations and parings of the discret plane
- Linear segmentation of discrete curves into blurred segments
- Topological properties of Hausdorff discretization, and comparison to other discretization schemes.
- Formulas for the number of \((n-2)\)-gaps of binary objects in arbitrary dimension
- On connectivity of discretized 2D explicit curve
- A \(d\)-dimensional extension of Christoffel words
- Quasi-affine transformations: Tilings by reciprocal images
- Thin discrete triangular meshes
- An elementary digital plane recognition algorithm
- On digital plane preimage structure
- About local configurations in arithmetic planes.
- Periodic graphs and connectivity of the rational digital hyperplanes
- Geometrical models for a class of reducible Pisot substitutions
- Two linear-time algorithms for computing the minimum length polygon of a digital contour
- Combinatorial View of Digital Convexity
- Digital straightness
- The number of Khalimsky-continuous functions between two points
- “Honeycomb” vs Square and Cubic Models
- Computing efficiently the lattice width in any dimension
- Graph-theoretical properties of parallelism in the digital plane
- On 2D constrained discrete rigid transformations
- Run-hierarchical structure of digital lines with irrational slopes in terms of continued fractions and the Gauss map
- Arithmetization of a circular arc
- Analysis of noisy digital contours with adaptive tangential cover
- Optimal simplification of polygonal chains for subpixel-accurate rendering
- Two efficient algorithms for computing the characteristics of a subsegment of a digital straight line
- An optimal parallel algorithm for digital curve segmentation using hough polygons and monotone function search
- Generation and Recognition of Digital Planes Using Multi-dimensional Continued Fractions
- Gift-Wrapping Based Preimage Computation Algorithm
- \(S\)-adic sequences: a bridge between dynamics, arithmetic, and geometry
- Application of a discrete tomography algorithm to computerized tomography
- Discrete segments of \(\mathbb{Z}^3\) constructed by synchronization of words
- Geometrical parameters extraction from discrete paths
- Supercover 3D polygon
- Digital plane preimage structure
- Delaunay property and proximity results of the L-algorithm for digital plane probing
- Translation of a Digital Line into another according to various Digitization Processes
- Euclidean farthest-point Voronoi diagram of a digital edge
- Remainder approach for the computation of digital straight line subsegment characteristics
- Facet connectedness of arithmetic discrete hyperplanes with non-zero shift
- Piercing the Chessboard
- On the connectedness of arithmetic hyperplanes
- Euclidean Eccentricity Transform by Discrete Arc Paving
- Combinatorial generation of planar sets
- Foundational aspects of multiscale digitization
- On the min DSS problem of closed discrete curves
- Robust and convergent curvature and normal estimators with digital integral invariants
- Digital two-dimensional bijective reflection and associated rotation
- The Barycenter Theorem: Averaging Possible-Paths to Produce Optimal Discrete Straight-line Segments
- Digital straight segment filter for geometric description
- Shear based bijective digital rotation in hexagonal grids
- Covering a Euclidean line or hyperplane by dilations of its discretization
- Multi-scale arithmetization of linear transformations
- A new lattice-based plane-probing algorithm
- Introduction to discrete soft transforms
- Digital geometry, mathematical morphology, and discrete optimization: a survey
- Title not available (Why is that?)
- An optimized framework for plane-probing algorithms
- Digital objects in rhombic dodecahedron grid
- On properties of analytical approximation for discretizing 2D curves and 3D surfaces
- Analytical description of digital intersections: minimal parameters and multiscale representation
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4948843)
