Close
Metadata

Identity statement area
Reference TypeConference Proceedings
Sitesibgrapi.sid.inpe.br
Identifier8JMKD3MGPAW/3RNAQPP
Repositorysid.inpe.br/sibgrapi/2018/08.28.19.11
Last Update2018:08.28.19.11.31 administrator
Metadatasid.inpe.br/sibgrapi/2018/08.28.19.11.31
Metadata Last Update2020:02.19.03.10.44 administrator
Citation KeyFaccinVernierCombTele:2018:StGrIn
TitleA Stable Greedy Insertion Treemap Algorithm for Software Evolution Visualization
FormatOn-line
Year2018
DateOct. 29 - Nov. 1, 2018
Access Date2020, Dec. 04
Number of Files1
Size5022 KiB
Context area
Author1 Faccin Vernier, Eduardo
2 Comba, Joao
3 Telea, Alexandru C.
Affiliation1 UFRGS and RUG
2 UFRGS
3 RUG
EditorRoss, Arun
Gastal, Eduardo S. L.
Jorge, Joaquim A.
Queiroz, Ricardo L. de
Minetto, Rodrigo
Sarkar, Sudeep
Papa, João Paulo
Oliveira, Manuel M.
Arbeláez, Pablo
Mery, Domingo
Oliveira, Maria Cristina Ferreira de
Spina, Thiago Vallin
Mendes, Caroline Mazetto
Costa, Henrique Sérgio Gutierrez
Mejail, Marta Estela
Geus, Klaus de
Scheer, Sergio
e-Mail Addressefvernier@gmail.com
Conference NameConference on Graphics, Patterns and Images, 31 (SIBGRAPI)
Conference LocationFoz do Iguaçu, PR, Brazil
Book TitleProceedings
PublisherIEEE Computer Society
Publisher CityLos Alamitos
History2018-08-28 19:11:31 :: efvernier@gmail.com -> administrator ::
2020-02-19 03:10:44 :: administrator -> :: 2018
Content and structure area
Is the master or a copy?is the master
Document Stagecompleted
Document Stagenot transferred
Transferable1
Content TypeExternal Contribution
Tertiary TypeFull Paper
KeywordsTreemap, Dynamic.
AbstractComputing treemap layouts for time-dependent (dynamic) trees is an open problem in information visualization. In particular, the constraints of spatial quality (cell aspect ratio) and stability (small treemap changes mandated by given tree-data changes) are hard to satisfy simultaneously. Most existing treemap methods focus on spatial quality, but are not inherently designed to address stability. We propose here a new treemapping method that aims to jointly optimize both these constraints. Our method is simple to implement, generic (handles any types of dynamic hierarchies), and fast. We compare our method with 14 state of the art treemaping algorithms using four quality metrics, over 28 dynamic hierarchies extracted from evolving software codebases. The comparison shows that our proposal jointly optimizes spatial quality and stability better than existing methods.
source Directory Contentthere are no files
agreement Directory Content
agreement.html 28/08/2018 16:11 1.2 KiB 
Conditions of access and use area
Languageen
Target FilePaper ID 23.pdf
User Groupefvernier@gmail.com
Visibilityshown
Allied materials area
Mirror Repositorysid.inpe.br/banon/2001/03.30.15.38.24
Next Higher Units8JMKD3MGPAW/3RPADUS
Host Collectionsid.inpe.br/banon/2001/03.30.15.38
Notes area
Empty Fieldsaccessionnumber archivingpolicy archivist area callnumber copyholder copyright creatorhistory descriptionlevel dissemination doi edition electronicmailaddress group holdercode isbn issn label lineage mark nextedition notes numberofvolumes orcid organization pages parameterlist parentrepositories previousedition previouslowerunit progress project readergroup readpermission resumeid rightsholder secondarydate secondarykey secondarymark secondarytype serieseditor session shorttitle sponsor subject tertiarymark type url versiontype volume

Close