On rectangular cartograms (Q883236): Difference between revisions

From MaRDI portal
← Older edit
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Bots
1,016,746 edits
‎Changed an Item
 
Property / cites work
 
Property / cites work: Q3134873 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time algorithm to check for the existence of a rectangular dual of a planar triangulated graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Drawing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial approach to cartograms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diffusion-based method for producing density-equalizing maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rectangular duals of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact floor-planning via orderly spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank

Latest revision as of 20:32, 25 June 2024

scientific article
Language Label Description Also known as
English
On rectangular cartograms
scientific article

    Statements

    title
    On rectangular cartograms (English)
    0 references
    author
    Bettina Speckmann
    0 references
    Marc J. van Kreveld
    0 references
    publication date
    4 June 2007
    0 references
    zbMATH DE Number
    5161070
    0 references
    zbMATH Keywords
    cartogram
    0 references
    rectangular layout
    0 references
    Wikidata QID
    Q59782381
    0 references
    OpenAlex ID
    W2148987114
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q883236&oldid=34947721"
    Powered by MediaWiki