Decomposition of discrete curves into piecewise straight segments in linear time

  title={Decomposition of discrete curves into piecewise straight segments in linear time},
  author={A. Smeulders and L. Dorst},
Linear-time recognition of digital polynomial curves and surfaces that have periodic differences
  • P. Veelaert
  • Mathematics, Engineering
  • Other Conferences
  • 1993
Digital polynomial curves and surfaces arise from the digitization of algebraic surfaces such as lines, parabolas, planes, or paraboloids. It is known that the n-th difference of a digital polynomialExpand
A generic and parallel algorithm for 2D digital curve polygonal approximation
A generic topological and geometrical framework which allows to define and control several parallel algorithms for 2D digital curve approximation and three contour simplification methods which can be efficiently implemented in a multi-thread environment to simplify labeled image contours are presented. Expand
We exhibit the structure of digital straight line segments in the 8-connected plane and in the Khalimsky plane by considering vertical distances and unions of two segments.
Digital straightness - a review
This paper reviews the literature on digital straightness and discusses its relationship to other concepts of geometry, the theory of words, and number theory. Expand
An output-sensitive algorithm to compute the normal vector of a digital plane
This paper solves the problem of how to compute the exact normal vector of a digital plane given only a predicate that answers the question "is a point x in the digital plane or not" and provides a worst-case complexity bound in O. Expand
A method using long digital straight segments for fingerprint recognition
A new method using long digital straight segments (LDSSs) for fingerprint recognition based on such a discovery that LDSSs in fingerprints can accurately characterize the global structure of fingerprints is proposed. Expand
Digital Straightness, Circularity, and Their Applications to Image Analysis
This chapter contains some theoretical properties of digital straightness and digital circularity, which are helpful in designing algorithms related to image analysis. These properties are obtainedExpand
Generation of Random Digital Simple Curves with Artistic Emulation
This paper presents two novel interdependent techniques for random digital simple curve generation, producing a sequence of points defining a digital path ρ ‘on the fly’ for the creation of artistic sketches from line drawings and edge maps, using multiple instances of such random digital paths. Expand
Dynamic Minimum Length Polygon
This paper presents a formal framework for representing all reversible polygonalizations of a digital contour, and obtains the first dynamic algorithm for computing the minimum length polygon, the Minimum Length Polygon. Expand
Maximal Planes and Multiscale Tangential Cover of 3D Digital Objects
The purpose of this paper is to define similar primitives for three-dimensional digital shapes, i.e. maximal planes defined over their boundary, with an unambiguous geometrical definition avoiding a simple greedy characterization as previous approaches. Expand