GEOMETRIC INTERPRETATION OF EUCLID ALGORITHM AND RECOGNITION OF SEGMENTS

被引：11

作者：

TROESCH, A

机构：

来源：

THEORETICAL COMPUTER SCIENCE | 1993年 / 115卷 / 02期

关键词：

D O I：

10.1016/0304-3975(93)90121-9

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

In this paper we examine the relations between the code of discrete straight lines and some geometrical transformations operating on them. This will permit us to give a geometrical interpretation of Euclid's algorithm by means of these transformations. Next we shall give two applications: an algorithm determining the run length slices of these straight lines. a recognition algorithm of straight-line segments giving the characteristics of these segments when the test is positive.

引用

页码：291 / 319

页数：29

共 24 条

[1] PARALLEL GENERATION OF STRAIGHT DIGITAL LINES [J].

ARCELLI, C ;

MASSAROTTI, A .

COMPUTER GRAPHICS AND IMAGE PROCESSING, 1978, 7 (01) :67-83

[2]

BERSTEL J, 1989, C HONNEUR SCHUTZENBE, P31

[3]

BOOTHROYD J, 1970, AUSTR COMPUTER J, V2, P20

[4]

Bresenham J.E, 1985, NATO COMPUTER SYSTEM, V17, P59

[5] ALGORITHM FOR COMPUTER CONTROL OF A DIGITAL PLOTTER [J].

BRESENHAM, JE .

IBM SYSTEMS JOURNAL, 1965, 4 (01) :25-30

[6]

BRONS R, 1974, COMPUT GRAPHICS IMAG, V3, P48

[7]

BRONS R, 1985, NATO ASI SERIES F, V17

[8]

Coven Ethan M., 1973, MATH SYSTEMS THEORY, V7, P138

[9]

DIENER F, 1989, ANAL STANDARD

[10]

DORST L, 1984, IEEE T PATTERN ANAL, V6, P450, DOI 10.1109/TPAMI.1984.4767550

← 1 2 3 →