Sökning: "Graph Drawing"

Visar resultat 16 - 18 av 18 uppsatser innehållade orden Graph Drawing.

  1. 16. A Space-Filling Technique for the Visualization of Planar st-graph

    Kandidat-uppsats, Institutionen för datavetenskap, fysik och matematik, DFM

    Författare :Yuanmao Wang; [2012]
    Nyckelord :Information Visualization; Planar st-graph; Space-filling;

    Sammanfattning : Graphs currently attract an increasing number of computer scientists due to their widely adoptions in different areas. However, when people perform graph drawing, one of the most critical issues they need to concern is atheistics, i.e., to make the graph more suitable for human perceptions. LÄS MER

  3. 17. Automated plane detection and extraction from airborne laser scanning data of dense urban areas

    Master-uppsats, Lunds universitet/Institutionen för naturgeografi och ekosystemvetenskap

    Författare :Ning Zhang; [2012]
    Nyckelord :3D city modeling; classification; pattern recognition; LIDAR; physical geography; geomatics; geography; graph cuts; EM algorithm; kD tree; RANSAC; Earth and Environmental Sciences;

    Sammanfattning : Popular science Digital 3D city models are nowadays used in many GIS applications. Airborne laser scanning is rapidly developing technology that can efficiently plot the 3D shapes of everything on the earth surface. Today, organizations that are responsible for, e.g. LÄS MER

  4. 18. ViNCent – Visualization of NetworkCentralities

    Magister-uppsats, Institutionen för datavetenskap, fysik och matematik, DFM

    Författare :Harald Köstinger; [2011]
    Nyckelord :centralities; network analysis; visualization; social networks; biological networks; graph drawing;

    Sammanfattning : In the area of information visualization social or biological networks are visualized ina way so that they can be explored easily and one can get more information about thestructure of the network out of it. The use of network centralities in the field of network analysis plays an importantrole when it comes to the rating of the relative importance of vertices within the networkstructure based on the neighborhood of them. LÄS MER