Recognition of Blurred Pieces of Discrete Planes

  title={Recognition of Blurred Pieces of Discrete Planes},
  author={Laurent Provot and Lilian Buzer and Isabelle Debled-Rennesson},
We introduce a new discrete primitive, the blurred piece of a discrete plane, which relies on the arithmetic definition of discrete planes It generalizes such planes, admitting that some points are missing and then permits to adapt to noisy discrete data Two recognition algorithms of such primitives are proposed: the first one is a geometrical algorithm and minimizes the Euclidean distance and the second one relies on linear programming and minimizes the vertical distance. 
Segmentation of Noisy Discrete Surfaces
A flexible approach considering arithmetic discrete planes with a variable width is used to avoid the oversegmentation that might happen when classical segmentation algorithms based on regular discrete planes are used to decompose the surface of the object.
Geometric Feature Estimators for Noisy Discrete Surfaces
We present in this paper robust geometric feature estimators on the border of a possibly noisy discrete object. We introduce the notion of patch centered at a point of this border. Thanks to a width
3D noisy discrete objects: Segmentation and application to smoothing
Digital line and plane recognition using combinatorial optimization by multiresolutional representation
This paper proposes a digital line/plane recognition method using multiresolutional representation as mixed integer linear programming problems which require much less computation time than the conventional methods.
Gift-wrapping based preimage computation algorithm
Optimal consensus set for digital plane fitting
A new method that uses a digital plane model rather than the conventional continuous model is presented that allows us to efficiently examine all possible consensus sets and to guarantee the solution optimality and exactness.
Discrete plane segmentation and estimation from a point cloud using local geometric patterns
This paper presents a method for segmenting a 3D point cloud into planar surfaces using recently obtained discrete-geometry results, and first rejects non-linear points from a point cloud, and then classify non-rejected points whose LGPs have common normal vectors into a planar-surface-point set.
Combinatorial optimization for fitting of digital line and plane
We present a method for fitting a digital line/plane from a given set of 2D/3D grid points. In the framework of discrete geometry, a digital line or plane is defined as a set of grid points located
Optimal consensus set for digital line and plane fitting
By using a digital model instead of a continuous one, it is shown that it can generate all possible consensus sets for model fitting and efficiently searches the optimal solution with time complexity O(Nd log N) for dimension d.
A $$d$$d-dimensional Extension of Christoffel Words
It is shown that a fully periodic subgraph of the hypercubic lattice is a translation of its flip if and only if it is a Christoffel graph.


Linear segmentation of discrete curves into blurred segments
Segmentation of Discrete Curves into Fuzzy Segments
An Elementary Algorithm for Digital Line Recognition in the General Case
This paper presents the first elementary method that works with any set of points (not necessarily 8-connected) and proposes a linear time algorithm under some restrictions (which were implicitly assumed in [DR95]).
Computing the width of a point set in 3-space
A new algorithm to solve the 3-dimensional width problem, i.e. to determine two parallel planes of smallest distance such that the region between the two planes contains a given point set, which has quadratic worstcase complexity but is much faster in practice.
Multiorder polygonal approximation of digital curves
A quick threshold-free algorithm, which computes the angular shape of a 2D object from the points of its contour from a multiorder analysis based on the arithmetical definition of discrete lines with variable thickness.
Optimal blurred segments decomposition of noisy shapes in linear time
Digital geometry
Computing the Width of a Set
It is shown that W(P) can be computed in O(n log n+I) time and O( n) space, where I is the number of antipodal pairs of edges of the convex hull of P, and n is thenumber of vertices.
Solving geometric problems with the rotating calipers
This paper shows that the diameter of a convex n-sided polygon could be computed in O(n) time using a very elegant and simple procedure which resembles rotating a set of calipers around the polygon once, and that this simple idea can be generalized in two ways.
Computational geometry: algorithms and applications
This introduction to computational geometry focuses on algorithms as all techniques are related to particular applications in robotics, graphics, CAD/CAM, and geographic information systems.