1994
DOI: 10.1080/07493878.1994.10641954
|View full text |Cite
|
Sign up to set email alerts
|

Numerical Methods in the Compilation of Transformed Images

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
9
0

Year Published

2011
2011
2019
2019

Publication Types

Select...
3
2
1

Relationship

1
5

Authors

Journals

citations
Cited by 6 publications
(9 citation statements)
references
References 0 publications
0
9
0
Order By: Relevance
“…The principles of algorithm construction for the required transformation h can be found in Gusein-Zade and Tikunov (1990). We shall try to construct a one-parameter family of transformations h, (0~t~1) of the plane that begins with the identity transformation ho = id and ends with the required transformation hI = h. Moreover, the family h, must be the solution for the differential equation a -ath,(z) = l/I, (z) where *, (z) = (a(z) and~(z» is a vector field determined 170 by the function Pt(z) of the density of the variable after applying the transformation h,.…”
Section: Principal Idea Of the Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…The principles of algorithm construction for the required transformation h can be found in Gusein-Zade and Tikunov (1990). We shall try to construct a one-parameter family of transformations h, (0~t~1) of the plane that begins with the identity transformation ho = id and ends with the required transformation hI = h. Moreover, the family h, must be the solution for the differential equation a -ath,(z) = l/I, (z) where *, (z) = (a(z) and~(z» is a vector field determined 170 by the function Pt(z) of the density of the variable after applying the transformation h,.…”
Section: Principal Idea Of the Algorithmmentioning
confidence: 99%
“…The use of cartograms is restricted because they lack sufficiently developed, relatively simple, and effectually realizable algorithms for their construction. A survey of a variety of approaches to the solution of this problem can be found in Gusein-Zade and Tikunov (1990) and Tikunov (1988). This paper will describe a new algorithm used to construct cartograms and some results of its use.…”
mentioning
confidence: 99%
“…By spatially depicting an attribute within the map base, the cartograms emphasizes each regions' data instead of territorial land area. For a detailed discussion on cartogram construction algorithms see GuseynZade and Tikunov [10].…”
Section: Continuous Cartogramsmentioning
confidence: 99%
“…In fact, one of the major goals of cartogram algorithms is to preserve the shapes of the objects [10,11].…”
Section: Continuous Cartogramsmentioning
confidence: 99%
See 1 more Smart Citation