Digital Planar Segment Based Polyhedrization for Surface Area Estimation
IWVF-4 Proceedings of the 4th International Workshop on Visual Form
Minimum-Length Polygons in Approximation Sausages
IWVF-4 Proceedings of the 4th International Workshop on Visual Form
Digital Lines and Digital Convexity
Digital and Image Geometry, Advanced Lectures [based on a winter school held at Dagstuhl Castle, Germany in December 2000]
Multigrid Convergence of Geometric Features
Digital and Image Geometry, Advanced Lectures [based on a winter school held at Dagstuhl Castle, Germany in December 2000]
Morphological Operators with Discrete Line Segments
DGCI '00 Proceedings of the 9th International Conference on Discrete Geometry for Computer Imagery
Shape signatures of fuzzy star-shaped sets based on distance from the centroid
Pattern Recognition Letters
A new adaptive vertex-based binary shape coding technique
Image and Vision Computing
Digital lines with irrational slopes
Theoretical Computer Science
Continuous digitization in Khalimsky spaces
Journal of Approximation Theory
On Straight Line Segment Detection
Journal of Mathematical Imaging and Vision
Augmented Privacy with Virtual Humans
Digital Human Modeling
On Overlappings of Digitized Straight Lines and Shared Steganographic File Systems
Transactions on Data Privacy
Consensus sets for affine transformation uncertainty polytopes
Computers and Graphics
On the min DSS problem of closed discrete curves
Discrete Applied Mathematics - Special issue: IWCIA 2003 - Ninth international workshop on combinatorial image analysis
Plane digitization and related combinatorial problems
Discrete Applied Mathematics - Special issue: Advances in discrete geometry and topology (DGCI 2003)
Estimation of discrete curvature based on chain-code pairing and digital straightness
ICIP'09 Proceedings of the 16th IEEE international conference on Image processing
Digital Steiner sets and Matheron semi-groups
Image and Vision Computing
Shape decomposition using Farey sequence and saddle points
Proceedings of the Seventh Indian Conference on Computer Vision, Graphics and Image Processing
A fast technique for vectorization of engineering drawings using morphology and digital straightness
Proceedings of the Seventh Indian Conference on Computer Vision, Graphics and Image Processing
The number of khalimsky-continuous functions between two points
IWCIA'11 Proceedings of the 14th international conference on Combinatorial image analysis
ISVC'06 Proceedings of the Second international conference on Advances in Visual Computing - Volume Part II
Toward polygonalisation of thick discrete arcs
CAIP'05 Proceedings of the 11th international conference on Computer Analysis of Images and Patterns
How to find a khalimsky-continuous approximation of a real-valued function
IWCIA'04 Proceedings of the 10th international conference on Combinatorial Image Analysis
Convex functions on discrete sets
IWCIA'04 Proceedings of the 10th international conference on Combinatorial Image Analysis
Arithmetic discrete hyperspheres and separatingness
DGCI'06 Proceedings of the 13th international conference on Discrete Geometry for Computer Imagery
Supercover model and digital straight line recognition on irregular isothetic grids
DGCI'05 Proceedings of the 12th international conference on Discrete Geometry for Computer Imagery
Uncertain geometry in computer vision
DGCI'05 Proceedings of the 12th international conference on Discrete Geometry for Computer Imagery
Curvature estimation for discrete curves based on auto-adaptive masks of convolution
CompIMAGE'10 Proceedings of the Second international conference on Computational Modeling of Objects Represented in Images
Computational aspects of digital plane and hyperplane recognition
IWCIA'06 Proceedings of the 11th international conference on Combinatorial Image Analysis
An automatic image segmentation technique based on pseudo-convex hull
ICVGIP'06 Proceedings of the 5th Indian conference on Computer Vision, Graphics and Image Processing
PACE: polygonal approximation of thick digital curves using cellular envelope
ICVGIP'06 Proceedings of the 5th Indian conference on Computer Vision, Graphics and Image Processing
A simple proof of Rosenfeld's characterization of digital straight line segments
Pattern Recognition Letters
On bit reduction of chain coded line drawings
Pattern Recognition Letters
From Binary to Grey Scale Convex Hulls
Fundamenta Informaticae
| Hi-index | 14.98 |
It is shown that a digital arc S is the digitization of a straight line segment if and only if it has the "chord property:" the line segment joining any two points of S lies everywhere within distance 1 of S. This result is used to derive several regularity properties of digitizations of straight line segments.