Browse by Author "Garland, Michael"

  • Dong, Shen; Kircher, Scott I.; Garland, Michael (2004-08)
    In this paper, we propose a new quadrilateral remeshing method for manifolds of arbitrary genus that is at once general, flexible, and efficient. Our technique is based on the use of smooth harmonic scalar fields defined ...

    application/pdf

    application/pdfPDF (3Mb)
  • Jia, Yuntao; Garland, Michael; Hart, John C. (2009)
    The hierarchical edge bundle method clusters the edges of a radial layout to better understand and analyze graphs, but its effectiveness relies critically on the quality of the hierarchical organization of its nodes and ...

    application/pdf

    application/pdfPDF (2Mb)
  • Dong, Shen; Bremer, Peer-Timo; Garland, Michael; Pascucci, Valerio; Hart, John C. (2005-06)
    Resampling raw surface meshes is one of the most fundamental operations used by nearly all digital geometry processing systems. The vast majority of work in the past has focused on triangular remeshing; the equally important ...

    application/pdf

    application/pdfPDF (9Mb)
  • Garland, Michael; Zhou, YuanYuan (2004-06)
    We present a new method for simplifying simplicial complexes of any type embedded in Euclidean spaces of any dimension. At the heart of this system is a novel generalization of the quadric error metric used in surface ...

    application/pdf

    application/pdfPDF (12Mb)
  • Jia, Yuntao; Hoberock, Jared; Garland, Michael; Hart, John C. (2008-04)
    This paper proposes novel methods for visualizing specifically the large power-law graphs that arise in sociology and the sciences. In such cases a large portion of edges can be shown to be less important and removed while ...

    application/pdf

    application/pdfPDF (5Mb)