• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1
  • Tagged with
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

A customization framework for the SVG Graph Visualization Engine

Zou, Feng 30 December 2008 (has links)
The Rigi research group has built an SVG (Scalable Vector Graphics) Graph Visualization Engine to visualize, interactively explore and annotate software structures. The biggest difficulty we experienced during the customization of this engine for different domains is that we need to create idiosyncratic generators every time. Each generator is created by different developers using different approaches. If the subject information model does not contain layout information, developers of the generator are also responsible for writing algorithms to calculate layout. In this thesis, we present a customization framework for our SVG Graph Visualization Engine to provide flexible customization using third party libraries to construct specific SVG Graph Generators. The customization framework consists of documentation for the existing graph engine and a componentized abstract generator that can be extended for a variety of information domains. We also created two reference implementations for the abstract generator and included them in the template solution project to exemplify the usage of the customization framework. We also validated the template solution with an end user to build a generator for a new domain. Our customization framework greatly eases the process of building SVG Editor Generators for domain-specific visualization engine.

Page generated in 0.1111 seconds