Discrete Straight Line Segments: Parameters, Primitives and Properties
نویسنده
چکیده
Digitizing the continuous world unavoidably looses information; as a consequence, geometrical properties of real-world objects can only be estimated from the digital data. For continuous straight lines and straight object boundaries, we show the best accuracy that can be reached in the estimation of length (and other properties), in the absence of noise. In the process, we give an analytical expression for the set of continuous pre-images of a digitized straight line segment. That fundamental result has found many applications in analyses of geometrical digitization processes; several of these are indicated, as well as recent extensions of the method to arbitrary objects.
منابع مشابه
Drawing trees and triangulations with few geometric primitives
We define the visual complexity of a plane graph drawing to be the number of geometric objects needed to represent all its edges. In particular, one object may represent multiple edges (e.g. you need only one line segment to draw two collinear edges of the same vertex). We show that trees can be drawn with 3n/4 straight-line segments on a polynomial grid, and with n/2 straight-line segments on ...
متن کاملIntermediate Representation in Model Based Recognition Using Straight Line and Ellipsoidal Arc Primitives
An intermediate representation suitable for the 2-D recognition of the 3-D objects, from a single intensity image is proposed. Determination of the intermediate representation from CAD models and from intensity images is presented. This representation uses as primitives line segments and ellipsoidal arcs. A complete technique for fitting contour lines with these primitives has been developed. T...
متن کاملDrawing Planar Graphs with Few Geometric Primitives
We define the visual complexity of a plane graph drawing to be the number of basic geometric objects needed to represent all its edges. In particular, one object may represent multiple edges (e.g., one needs only one line segment to draw two collinear edges of the same vertex). Let n denote the number of vertices of a graph. We show that trees can be drawn with 3n/4 straight-line segments on a ...
متن کاملContinuous-Curvature Paths for Mobile Robots
This paper discusses how to plan continuous-curvature paths for carlike wheeled mobile robots. The task is to generate a trajectory with upper-bounded curvature and curvature derivative. To solve this problem we use three path planning primitives, namely straight line segments, circular segments, and continuous-curvature turns (CC turns) in the path planning. We give a classification of the CC ...
متن کاملAn Arithmetical Characterization of the Convex Hull of Digital Straight Segments
In this paper, we arithmetically describe the convex hull of a digital straight segment by three recurrence relations. This characterization gives new insights into the combinatorial structure of digital straight segments of arbitrary length and intercept. It also leads to two on-line algorithms that computes a part of the convex hull of a given digital straight segment. They both run in consta...
متن کامل