The Reconstruction of the Digital Hyperbola Segment from Its Code

Authors:
Natasa Sladoje
Affiliations:
-
Venue:
DGCI '00 Proceedings of the 9th International Conference on Discrete Geometry for Computer Imagery
Year:
2000

Citing 7
Cited 0

A New Parameterization of Digital Straight Lines

IEEE Transactions on Pattern Analysis and Machine Intelligence
A new characterization of digital lines by least square fits

Pattern Recognition Letters
A coding scheme for certain sets of digital curves

Pattern Recognition Letters
A representation of digital hyperbolas y=1xa+b

Pattern Recognition Letters
Efficiency of Characterizing Ellipses and Ellipsoids by Discrete Moments

IEEE Transactions on Pattern Analysis and Machine Intelligence
Digitized Circular Arcs: Characterization and Parameter Estimation

IEEE Transactions on Pattern Analysis and Machine Intelligence
Time bounds for selection

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is known that a set consisting of the digital curves whose "original curves" are graphs of continuous functions, having at most two intersection points, pairwise, on a given interval, can be uniquely coded by five parameters. This result is applied to the set of digital hyperbola segments, corresponding to the hyperbolas of the form y = α/x-β +γ inscribed into the (m×m)-integer grid. An O(mċ (log(m+|β|)2) algorithm for recovering the digital hyperbola segment from its proposed code, is presented.