Skip to content

Instantly share code, notes, and snippets.

@john-guerra

john-guerra/citationsNetwork2018.min.json

Created October 8, 2019 22:20
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save john-guerra/6b11c24ca722dba7a8d87e827a457084 to your computer and use it in GitHub Desktop.
Save john-guerra/6b11c24ca722dba7a8d87e827a457084 to your computer and use it in GitHub Desktop.
Download ZIP
ieeevis citationsNetwork
Raw
citationsNetwork2018.min.json
This file has been truncated, but you can view the full file.
{"links":[{"source":0,"target":1,"type":"cites","value":5},{"source":1,"target":0,"type":"cites","value":7},{"source":2,"target":3,"type":"cites","value":4},{"source":4,"target":5,"type":"cites","value":8},{"source":5,"target":4,"type":"cites","value":6},{"source":6,"target":7,"type":"cites","value":3},{"source":8,"target":7,"type":"cites","value":3},{"source":9,"target":10,"type":"cites","value":3},{"source":9,"target":11,"type":"cites","value":6},{"source":12,"target":13,"type":"cites","value":6},{"source":14,"target":13,"type":"cites","value":6},{"source":13,"target":15,"type":"cites","value":4},{"source":16,"target":17,"type":"cites","value":3},{"source":18,"target":16,"type":"cites","value":3},{"source":18,"target":17,"type":"cites","value":3},{"source":17,"target":16,"type":"cites","value":11},{"source":19,"target":12,"type":"cites","value":4},{"source":19,"target":14,"type":"cites","value":4},{"source":19,"target":13,"type":"cites","value":6},{"source":13,"target":12,"type":"cites","value":12},{"source":13,"target":14,"type":"cites","value":12},{"source":20,"target":21,"type":"cites","value":3},{"source":20,"target":22,"type":"cites","value":4},{"source":20,"target":23,"type":"cites","value":11},{"source":20,"target":24,"type":"cites","value":4},{"source":20,"target":25,"type":"cites","value":7},{"source":20,"target":26,"type":"cites","value":7},{"source":27,"target":4,"type":"cites","value":5},{"source":27,"target":5,"type":"cites","value":3},{"source":28,"target":29,"type":"cites","value":5},{"source":28,"target":30,"type":"cites","value":3},{"source":28,"target":31,"type":"cites","value":5},{"source":28,"target":32,"type":"cites","value":3},{"source":28,"target":33,"type":"cites","value":3},{"source":28,"target":34,"type":"cites","value":3},{"source":35,"target":36,"type":"cites","value":4},{"source":37,"target":38,"type":"cites","value":3},{"source":23,"target":22,"type":"cites","value":5},{"source":23,"target":24,"type":"cites","value":5},{"source":23,"target":25,"type":"cites","value":7},{"source":23,"target":26,"type":"cites","value":6},{"source":39,"target":36,"type":"cites","value":4},{"source":39,"target":40,"type":"cites","value":3},{"source":41,"target":12,"type":"cites","value":3},{"source":41,"target":14,"type":"cites","value":3},{"source":41,"target":13,"type":"cites","value":6},{"source":41,"target":42,"type":"cites","value":4},{"source":13,"target":19,"type":"cites","value":6},{"source":13,"target":43,"type":"cites","value":7},{"source":13,"target":42,"type":"cites","value":8},{"source":13,"target":41,"type":"cites","value":8},{"source":13,"target":44,"type":"cites","value":7},{"source":45,"target":17,"type":"cites","value":8},{"source":45,"target":16,"type":"cites","value":5},{"source":46,"target":17,"type":"cites","value":4},{"source":46,"target":16,"type":"cites","value":4},{"source":45,"target":9,"type":"cites","value":11},{"source":4,"target":47,"type":"cites","value":3},{"source":4,"target":27,"type":"cites","value":5},{"source":47,"target":4,"type":"cites","value":3},{"source":19,"target":44,"type":"cites","value":3},{"source":44,"target":13,"type":"cites","value":3},{"source":12,"target":14,"type":"cites","value":3},{"source":43,"target":13,"type":"cites","value":4},{"source":42,"target":12,"type":"cites","value":4},{"source":42,"target":14,"type":"cites","value":4},{"source":42,"target":13,"type":"cites","value":9},{"source":14,"target":12,"type":"cites","value":3},{"source":48,"target":28,"type":"cites","value":3},{"source":28,"target":49,"type":"cites","value":4},{"source":45,"target":50,"type":"cites","value":3},{"source":13,"target":17,"type":"cites","value":3},{"source":13,"target":16,"type":"cites","value":3},{"source":51,"target":36,"type":"cites","value":3},{"source":52,"target":53,"type":"cites","value":3},{"source":54,"target":14,"type":"cites","value":4},{"source":54,"target":12,"type":"cites","value":4},{"source":54,"target":17,"type":"cites","value":10},{"source":54,"target":16,"type":"cites","value":6},{"source":54,"target":15,"type":"cites","value":8},{"source":55,"target":56,"type":"cites","value":5},{"source":55,"target":36,"type":"cites","value":6},{"source":55,"target":9,"type":"cites","value":3},{"source":57,"target":58,"type":"cites","value":5},{"source":57,"target":59,"type":"cites","value":3},{"source":57,"target":60,"type":"cites","value":3},{"source":57,"target":61,"type":"cites","value":3},{"source":57,"target":62,"type":"cites","value":7},{"source":62,"target":57,"type":"cites","value":4},{"source":62,"target":58,"type":"cites","value":4},{"source":62,"target":59,"type":"cites","value":3},{"source":62,"target":60,"type":"cites","value":3},{"source":62,"target":61,"type":"cites","value":3},{"source":63,"target":23,"type":"cites","value":4},{"source":64,"target":23,"type":"cites","value":4},{"source":63,"target":64,"type":"cites","value":7},{"source":64,"target":63,"type":"cites","value":4},{"source":65,"target":39,"type":"cites","value":3},{"source":66,"target":11,"type":"cites","value":3},{"source":67,"target":68,"type":"cites","value":3},{"source":35,"target":65,"type":"cites","value":3},{"source":35,"target":69,"type":"cites","value":3},{"source":35,"target":39,"type":"cites","value":3},{"source":70,"target":48,"type":"cites","value":3},{"source":70,"target":28,"type":"cites","value":3},{"source":17,"target":15,"type":"cites","value":8},{"source":45,"target":46,"type":"cites","value":5},{"source":71,"target":45,"type":"cites","value":4},{"source":71,"target":46,"type":"cites","value":3},{"source":72,"target":45,"type":"cites","value":3},{"source":72,"target":46,"type":"cites","value":3},{"source":71,"target":73,"type":"cites","value":3},{"source":71,"target":74,"type":"cites","value":3},{"source":72,"target":73,"type":"cites","value":4},{"source":72,"target":74,"type":"cites","value":4},{"source":75,"target":76,"type":"cites","value":4},{"source":77,"target":78,"type":"cites","value":6},{"source":77,"target":79,"type":"cites","value":6},{"source":54,"target":78,"type":"cites","value":3},{"source":54,"target":79,"type":"cites","value":3},{"source":80,"target":81,"type":"cites","value":3},{"source":80,"target":82,"type":"cites","value":3},{"source":83,"target":13,"type":"cites","value":3},{"source":84,"target":23,"type":"cites","value":5},{"source":84,"target":56,"type":"cites","value":4},{"source":84,"target":36,"type":"cites","value":6},{"source":85,"target":4,"type":"cites","value":3},{"source":77,"target":54,"type":"cites","value":9},{"source":77,"target":15,"type":"cites","value":7},{"source":17,"target":54,"type":"cites","value":11},{"source":77,"target":17,"type":"cites","value":4},{"source":86,"target":45,"type":"cites","value":7},{"source":86,"target":46,"type":"cites","value":4},{"source":41,"target":45,"type":"cites","value":4},{"source":86,"target":71,"type":"cites","value":3},{"source":86,"target":72,"type":"cites","value":3},{"source":41,"target":71,"type":"cites","value":4},{"source":41,"target":72,"type":"cites","value":3},{"source":84,"target":17,"type":"cites","value":4},{"source":84,"target":16,"type":"cites","value":4},{"source":45,"target":36,"type":"cites","value":7},{"source":80,"target":15,"type":"cites","value":6},{"source":80,"target":45,"type":"cites","value":11},{"source":80,"target":71,"type":"cites","value":9},{"source":80,"target":72,"type":"cites","value":5},{"source":80,"target":46,"type":"cites","value":7},{"source":20,"target":87,"type":"cites","value":8},{"source":20,"target":88,"type":"cites","value":6},{"source":66,"target":89,"type":"cites","value":4},{"source":66,"target":68,"type":"cites","value":4},{"source":90,"target":89,"type":"cites","value":5},{"source":89,"target":91,"type":"cites","value":3},{"source":89,"target":92,"type":"cites","value":3},{"source":89,"target":93,"type":"cites","value":3},{"source":89,"target":94,"type":"cites","value":3},{"source":89,"target":95,"type":"cites","value":3},{"source":89,"target":96,"type":"cites","value":3},{"source":97,"target":98,"type":"cites","value":4},{"source":99,"target":1,"type":"cites","value":25},{"source":99,"target":100,"type":"cites","value":4},{"source":99,"target":101,"type":"cites","value":4},{"source":102,"target":103,"type":"cites","value":7},{"source":102,"target":68,"type":"cites","value":3},{"source":102,"target":104,"type":"cites","value":3},{"source":102,"target":105,"type":"cites","value":3},{"source":102,"target":11,"type":"cites","value":3},{"source":102,"target":106,"type":"cites","value":3},{"source":45,"target":86,"type":"cites","value":3},{"source":45,"target":41,"type":"cites","value":5},{"source":45,"target":71,"type":"cites","value":12},{"source":45,"target":72,"type":"cites","value":6},{"source":86,"target":41,"type":"cites","value":4},{"source":41,"target":86,"type":"cites","value":3},{"source":72,"target":71,"type":"cites","value":4},{"source":71,"target":72,"type":"cites","value":10},{"source":71,"target":107,"type":"cites","value":3},{"source":63,"target":91,"type":"cites","value":3},{"source":63,"target":89,"type":"cites","value":8},{"source":63,"target":92,"type":"cites","value":3},{"source":63,"target":93,"type":"cites","value":3},{"source":63,"target":94,"type":"cites","value":3},{"source":63,"target":95,"type":"cites","value":3},{"source":63,"target":96,"type":"cites","value":3},{"source":108,"target":89,"type":"cites","value":6},{"source":108,"target":63,"type":"cites","value":6},{"source":54,"target":77,"type":"cites","value":11},{"source":17,"target":77,"type":"cites","value":4},{"source":109,"target":110,"type":"cites","value":4},{"source":98,"target":111,"type":"cites","value":3},{"source":98,"target":1,"type":"cites","value":6},{"source":1,"target":112,"type":"cites","value":6},{"source":112,"target":1,"type":"cites","value":10},{"source":35,"target":56,"type":"cites","value":3},{"source":35,"target":113,"type":"cites","value":6},{"source":35,"target":114,"type":"cites","value":10},{"source":84,"target":115,"type":"cites","value":17},{"source":84,"target":116,"type":"cites","value":3},{"source":84,"target":68,"type":"cites","value":3},{"source":117,"target":56,"type":"cites","value":3},{"source":118,"target":11,"type":"cites","value":4},{"source":119,"target":11,"type":"cites","value":4},{"source":120,"target":25,"type":"cites","value":5},{"source":120,"target":26,"type":"cites","value":4},{"source":121,"target":23,"type":"cites","value":6},{"source":23,"target":122,"type":"cites","value":3},{"source":120,"target":122,"type":"cites","value":3},{"source":120,"target":23,"type":"cites","value":26},{"source":23,"target":121,"type":"cites","value":4},{"source":23,"target":120,"type":"cites","value":13},{"source":120,"target":121,"type":"cites","value":4},{"source":23,"target":63,"type":"cites","value":3},{"source":120,"target":63,"type":"cites","value":3},{"source":36,"target":123,"type":"cites","value":3},{"source":36,"target":124,"type":"cites","value":8},{"source":63,"target":18,"type":"cites","value":3},{"source":89,"target":18,"type":"cites","value":3},{"source":63,"target":108,"type":"cites","value":3},{"source":89,"target":63,"type":"cites","value":5},{"source":89,"target":108,"type":"cites","value":3},{"source":125,"target":20,"type":"cites","value":3},{"source":126,"target":20,"type":"cites","value":3},{"source":112,"target":0,"type":"cites","value":7},{"source":127,"target":128,"type":"cites","value":3},{"source":129,"target":36,"type":"cites","value":13},{"source":23,"target":20,"type":"cites","value":7},{"source":23,"target":87,"type":"cites","value":7},{"source":23,"target":88,"type":"cites","value":3},{"source":120,"target":20,"type":"cites","value":6},{"source":120,"target":87,"type":"cites","value":6},{"source":120,"target":22,"type":"cites","value":3},{"source":120,"target":24,"type":"cites","value":3},{"source":9,"target":13,"type":"cites","value":4},{"source":9,"target":42,"type":"cites","value":6},{"source":110,"target":111,"type":"cites","value":3},{"source":110,"target":130,"type":"cites","value":3},{"source":110,"target":131,"type":"cites","value":3},{"source":110,"target":132,"type":"cites","value":3},{"source":133,"target":45,"type":"cites","value":5},{"source":133,"target":71,"type":"cites","value":9},{"source":133,"target":46,"type":"cites","value":3},{"source":133,"target":1,"type":"cites","value":5},{"source":71,"target":41,"type":"cites","value":6},{"source":134,"target":113,"type":"cites","value":4},{"source":134,"target":114,"type":"cites","value":5},{"source":134,"target":55,"type":"cites","value":3},{"source":134,"target":135,"type":"cites","value":8},{"source":134,"target":136,"type":"cites","value":3},{"source":134,"target":137,"type":"cites","value":3},{"source":134,"target":138,"type":"cites","value":3},{"source":134,"target":139,"type":"cites","value":3},{"source":134,"target":140,"type":"cites","value":3},{"source":13,"target":133,"type":"cites","value":4},{"source":141,"target":17,"type":"cites","value":3},{"source":80,"target":17,"type":"cites","value":7},{"source":80,"target":16,"type":"cites","value":5},{"source":80,"target":66,"type":"cites","value":4},{"source":80,"target":84,"type":"cites","value":4},{"source":80,"target":142,"type":"cites","value":3},{"source":134,"target":36,"type":"cites","value":3},{"source":143,"target":144,"type":"cites","value":5},{"source":39,"target":144,"type":"cites","value":3},{"source":39,"target":56,"type":"cites","value":3},{"source":143,"target":53,"type":"cites","value":4},{"source":143,"target":145,"type":"cites","value":4},{"source":146,"target":144,"type":"cites","value":5},{"source":146,"target":53,"type":"cites","value":5},{"source":146,"target":145,"type":"cites","value":5},{"source":143,"target":100,"type":"cites","value":3},{"source":143,"target":99,"type":"cites","value":4},{"source":143,"target":101,"type":"cites","value":3},{"source":146,"target":99,"type":"cites","value":3},{"source":39,"target":99,"type":"cites","value":7},{"source":143,"target":103,"type":"cites","value":5},{"source":143,"target":102,"type":"cites","value":6},{"source":146,"target":103,"type":"cites","value":4},{"source":146,"target":102,"type":"cites","value":7},{"source":39,"target":102,"type":"cites","value":4},{"source":147,"target":148,"type":"cites","value":3},{"source":149,"target":36,"type":"cites","value":7},{"source":150,"target":36,"type":"cites","value":7},{"source":151,"target":135,"type":"cites","value":3},{"source":152,"target":35,"type":"cites","value":3},{"source":54,"target":71,"type":"cites","value":3},{"source":77,"target":71,"type":"cites","value":5},{"source":17,"target":71,"type":"cites","value":3},{"source":77,"target":153,"type":"cites","value":4},{"source":54,"target":13,"type":"cites","value":7},{"source":77,"target":42,"type":"cites","value":4},{"source":77,"target":41,"type":"cites","value":3},{"source":9,"target":71,"type":"cites","value":10},{"source":9,"target":45,"type":"cites","value":9},{"source":45,"target":133,"type":"cites","value":5},{"source":9,"target":133,"type":"cites","value":5},{"source":154,"target":13,"type":"cites","value":9},{"source":154,"target":155,"type":"cites","value":3},{"source":154,"target":156,"type":"cites","value":3},{"source":13,"target":154,"type":"cites","value":9},{"source":13,"target":155,"type":"cites","value":4},{"source":13,"target":156,"type":"cites","value":4},{"source":13,"target":157,"type":"cites","value":3},{"source":13,"target":107,"type":"cites","value":3},{"source":13,"target":72,"type":"cites","value":6},{"source":13,"target":71,"type":"cites","value":8},{"source":13,"target":158,"type":"cites","value":3},{"source":159,"target":20,"type":"cites","value":6},{"source":160,"target":124,"type":"cites","value":3},{"source":161,"target":124,"type":"cites","value":8},{"source":162,"target":89,"type":"cites","value":3},{"source":163,"target":89,"type":"cites","value":3},{"source":164,"target":9,"type":"cites","value":3},{"source":67,"target":66,"type":"cites","value":5},{"source":80,"target":13,"type":"cites","value":6},{"source":165,"target":133,"type":"cites","value":3},{"source":165,"target":80,"type":"cites","value":8},{"source":80,"target":133,"type":"cites","value":6},{"source":133,"target":36,"type":"cites","value":8},{"source":46,"target":36,"type":"cites","value":4},{"source":80,"target":36,"type":"cites","value":7},{"source":133,"target":80,"type":"cites","value":10},{"source":133,"target":112,"type":"cites","value":11},{"source":66,"target":67,"type":"cites","value":6},{"source":66,"target":135,"type":"cites","value":3},{"source":66,"target":166,"type":"cites","value":5},{"source":167,"target":13,"type":"cites","value":4},{"source":84,"target":13,"type":"cites","value":7},{"source":84,"target":42,"type":"cites","value":3},{"source":168,"target":17,"type":"cites","value":3},{"source":169,"target":0,"type":"cites","value":4},{"source":146,"target":112,"type":"cites","value":6},{"source":143,"target":112,"type":"cites","value":4},{"source":39,"target":1,"type":"cites","value":6},{"source":39,"target":112,"type":"cites","value":5},{"source":143,"target":0,"type":"cites","value":3},{"source":39,"target":0,"type":"cites","value":3},{"source":146,"target":143,"type":"cites","value":10},{"source":146,"target":39,"type":"cites","value":6},{"source":146,"target":170,"type":"cites","value":3},{"source":143,"target":39,"type":"cites","value":5},{"source":143,"target":170,"type":"cites","value":3},{"source":39,"target":143,"type":"cites","value":9},{"source":83,"target":0,"type":"cites","value":3},{"source":83,"target":1,"type":"cites","value":3},{"source":112,"target":37,"type":"cites","value":3},{"source":112,"target":83,"type":"cites","value":3},{"source":99,"target":9,"type":"cites","value":3},{"source":99,"target":71,"type":"cites","value":7},{"source":99,"target":132,"type":"cites","value":3},{"source":99,"target":130,"type":"cites","value":3},{"source":115,"target":154,"type":"cites","value":3},{"source":115,"target":13,"type":"cites","value":3},{"source":11,"target":118,"type":"cites","value":3},{"source":11,"target":119,"type":"cites","value":3},{"source":36,"target":171,"type":"cites","value":4},{"source":41,"target":147,"type":"cites","value":4},{"source":172,"target":54,"type":"cites","value":9},{"source":172,"target":77,"type":"cites","value":3},{"source":172,"target":17,"type":"cites","value":7},{"source":172,"target":15,"type":"cites","value":3},{"source":42,"target":54,"type":"cites","value":10},{"source":42,"target":77,"type":"cites","value":6},{"source":42,"target":17,"type":"cites","value":7},{"source":42,"target":15,"type":"cites","value":3},{"source":173,"target":54,"type":"cites","value":3},{"source":130,"target":54,"type":"cites","value":3},{"source":130,"target":17,"type":"cites","value":4},{"source":174,"target":142,"type":"cites","value":5},{"source":174,"target":175,"type":"cites","value":4},{"source":129,"target":171,"type":"cites","value":3},{"source":176,"target":0,"type":"cites","value":4},{"source":176,"target":1,"type":"cites","value":3},{"source":98,"target":9,"type":"cites","value":4},{"source":98,"target":41,"type":"cites","value":7},{"source":98,"target":86,"type":"cites","value":3},{"source":177,"target":98,"type":"cites","value":3},{"source":178,"target":98,"type":"cites","value":3},{"source":112,"target":36,"type":"cites","value":5},{"source":112,"target":40,"type":"cites","value":4},{"source":143,"target":52,"type":"cites","value":3},{"source":143,"target":146,"type":"cites","value":9},{"source":39,"target":146,"type":"cites","value":5},{"source":179,"target":180,"type":"cites","value":3},{"source":179,"target":181,"type":"cites","value":4},{"source":179,"target":182,"type":"cites","value":4},{"source":179,"target":183,"type":"cites","value":3},{"source":165,"target":184,"type":"cites","value":3},{"source":134,"target":42,"type":"cites","value":4},{"source":71,"target":42,"type":"cites","value":3},{"source":133,"target":128,"type":"cites","value":3},{"source":167,"target":84,"type":"cites","value":3},{"source":185,"target":115,"type":"cites","value":7},{"source":185,"target":84,"type":"cites","value":20},{"source":185,"target":67,"type":"cites","value":3},{"source":185,"target":80,"type":"cites","value":8},{"source":185,"target":133,"type":"cites","value":4},{"source":186,"target":39,"type":"cites","value":3},{"source":1,"target":143,"type":"cites","value":5},{"source":1,"target":39,"type":"cites","value":3},{"source":112,"target":146,"type":"cites","value":8},{"source":112,"target":143,"type":"cites","value":5},{"source":112,"target":39,"type":"cites","value":7},{"source":98,"target":83,"type":"cites","value":3},{"source":99,"target":83,"type":"cites","value":7},{"source":99,"target":187,"type":"cites","value":3},{"source":99,"target":41,"type":"cites","value":3},{"source":98,"target":97,"type":"cites","value":3},{"source":99,"target":97,"type":"cites","value":6},{"source":41,"target":187,"type":"cites","value":3},{"source":41,"target":99,"type":"cites","value":5},{"source":188,"target":54,"type":"cites","value":4},{"source":189,"target":54,"type":"cites","value":4},{"source":190,"target":54,"type":"cites","value":3},{"source":13,"target":75,"type":"cites","value":3},{"source":13,"target":76,"type":"cites","value":3},{"source":191,"target":13,"type":"cites","value":3},{"source":77,"target":134,"type":"cites","value":5},{"source":192,"target":193,"type":"cites","value":5},{"source":194,"target":20,"type":"cites","value":3},{"source":20,"target":195,"type":"cites","value":3},{"source":196,"target":185,"type":"cites","value":14},{"source":185,"target":197,"type":"cites","value":3},{"source":84,"target":185,"type":"cites","value":21},{"source":198,"target":36,"type":"cites","value":3},{"source":198,"target":23,"type":"cites","value":13},{"source":198,"target":120,"type":"cites","value":7},{"source":198,"target":124,"type":"cites","value":3},{"source":198,"target":199,"type":"cites","value":3},{"source":198,"target":161,"type":"cites","value":4},{"source":198,"target":200,"type":"cites","value":3},{"source":200,"target":124,"type":"cites","value":4},{"source":200,"target":199,"type":"cites","value":4},{"source":36,"target":201,"type":"cites","value":3},{"source":36,"target":202,"type":"cites","value":3},{"source":200,"target":36,"type":"cites","value":4},{"source":199,"target":161,"type":"cites","value":3},{"source":203,"target":161,"type":"cites","value":5},{"source":204,"target":161,"type":"cites","value":3},{"source":185,"target":23,"type":"cites","value":12},{"source":185,"target":25,"type":"cites","value":4},{"source":185,"target":26,"type":"cites","value":3},{"source":205,"target":115,"type":"cites","value":3},{"source":205,"target":206,"type":"cites","value":3},{"source":205,"target":207,"type":"cites","value":3},{"source":205,"target":84,"type":"cites","value":5},{"source":207,"target":205,"type":"cites","value":6},{"source":207,"target":115,"type":"cites","value":6},{"source":207,"target":206,"type":"cites","value":6},{"source":207,"target":208,"type":"cites","value":4},{"source":207,"target":84,"type":"cites","value":6},{"source":115,"target":205,"type":"cites","value":3},{"source":115,"target":206,"type":"cites","value":3},{"source":115,"target":207,"type":"cites","value":3},{"source":115,"target":84,"type":"cites","value":4},{"source":84,"target":205,"type":"cites","value":18},{"source":84,"target":206,"type":"cites","value":13},{"source":84,"target":207,"type":"cites","value":18},{"source":84,"target":208,"type":"cites","value":5},{"source":84,"target":209,"type":"cites","value":4},{"source":84,"target":210,"type":"cites","value":4},{"source":71,"target":133,"type":"cites","value":4},{"source":71,"target":80,"type":"cites","value":3},{"source":109,"target":41,"type":"cites","value":3},{"source":211,"target":54,"type":"cites","value":3},{"source":211,"target":17,"type":"cites","value":5},{"source":212,"target":80,"type":"cites","value":15},{"source":212,"target":213,"type":"cites","value":4},{"source":212,"target":134,"type":"cites","value":4},{"source":212,"target":71,"type":"cites","value":9},{"source":77,"target":213,"type":"cites","value":3},{"source":214,"target":99,"type":"cites","value":5},{"source":1,"target":99,"type":"cites","value":9},{"source":214,"target":1,"type":"cites","value":3},{"source":1,"target":215,"type":"cites","value":4},{"source":1,"target":97,"type":"cites","value":4},{"source":66,"target":9,"type":"cites","value":4},{"source":67,"target":9,"type":"cites","value":3},{"source":66,"target":185,"type":"cites","value":4},{"source":55,"target":117,"type":"cites","value":4},{"source":216,"target":35,"type":"cites","value":3},{"source":134,"target":67,"type":"cites","value":3},{"source":217,"target":102,"type":"cites","value":3},{"source":217,"target":103,"type":"cites","value":3},{"source":153,"target":102,"type":"cites","value":4},{"source":153,"target":103,"type":"cites","value":3},{"source":218,"target":102,"type":"cites","value":4},{"source":218,"target":103,"type":"cites","value":3},{"source":219,"target":35,"type":"cites","value":4},{"source":219,"target":135,"type":"cites","value":4},{"source":35,"target":135,"type":"cites","value":5},{"source":219,"target":113,"type":"cites","value":4},{"source":219,"target":114,"type":"cites","value":5},{"source":35,"target":136,"type":"cites","value":3},{"source":35,"target":137,"type":"cites","value":3},{"source":35,"target":138,"type":"cites","value":3},{"source":35,"target":139,"type":"cites","value":3},{"source":35,"target":140,"type":"cites","value":3},{"source":98,"target":99,"type":"cites","value":13},{"source":99,"target":98,"type":"cites","value":8},{"source":98,"target":133,"type":"cites","value":3},{"source":99,"target":133,"type":"cites","value":5},{"source":99,"target":80,"type":"cites","value":3},{"source":112,"target":133,"type":"cites","value":5},{"source":99,"target":72,"type":"cites","value":5},{"source":99,"target":215,"type":"cites","value":4},{"source":220,"target":185,"type":"cites","value":5},{"source":221,"target":205,"type":"cites","value":5},{"source":221,"target":115,"type":"cites","value":4},{"source":221,"target":206,"type":"cites","value":4},{"source":221,"target":207,"type":"cites","value":4},{"source":221,"target":84,"type":"cites","value":8},{"source":220,"target":205,"type":"cites","value":5},{"source":220,"target":115,"type":"cites","value":4},{"source":220,"target":206,"type":"cites","value":3},{"source":220,"target":207,"type":"cites","value":4},{"source":220,"target":84,"type":"cites","value":19},{"source":84,"target":221,"type":"cites","value":5},{"source":36,"target":200,"type":"cites","value":4},{"source":9,"target":161,"type":"cites","value":4},{"source":9,"target":222,"type":"cites","value":4},{"source":9,"target":23,"type":"cites","value":3},{"source":9,"target":120,"type":"cites","value":3},{"source":223,"target":23,"type":"cites","value":5},{"source":198,"target":87,"type":"cites","value":6},{"source":198,"target":20,"type":"cites","value":7},{"source":23,"target":224,"type":"cites","value":3},{"source":120,"target":224,"type":"cites","value":3},{"source":198,"target":88,"type":"cites","value":3},{"source":23,"target":198,"type":"cites","value":7},{"source":120,"target":198,"type":"cites","value":6},{"source":161,"target":203,"type":"cites","value":4},{"source":10,"target":225,"type":"cites","value":4},{"source":71,"target":213,"type":"cites","value":5},{"source":10,"target":213,"type":"cites","value":4},{"source":10,"target":71,"type":"cites","value":4},{"source":212,"target":142,"type":"cites","value":4},{"source":212,"target":174,"type":"cites","value":5},{"source":212,"target":35,"type":"cites","value":4},{"source":226,"target":36,"type":"cites","value":7},{"source":185,"target":36,"type":"cites","value":6},{"source":227,"target":98,"type":"cites","value":5},{"source":228,"target":110,"type":"cites","value":3},{"source":229,"target":110,"type":"cites","value":3},{"source":230,"target":84,"type":"cites","value":3},{"source":45,"target":169,"type":"cites","value":3},{"source":45,"target":11,"type":"cites","value":4},{"source":45,"target":106,"type":"cites","value":4},{"source":231,"target":114,"type":"cites","value":3},{"source":232,"target":114,"type":"cites","value":3},{"source":231,"target":56,"type":"cites","value":4},{"source":233,"target":56,"type":"cites","value":3},{"source":232,"target":56,"type":"cites","value":3},{"source":231,"target":40,"type":"cites","value":5},{"source":233,"target":40,"type":"cites","value":3},{"source":231,"target":36,"type":"cites","value":6},{"source":233,"target":36,"type":"cites","value":3},{"source":232,"target":36,"type":"cites","value":3},{"source":231,"target":143,"type":"cites","value":13},{"source":231,"target":234,"type":"cites","value":4},{"source":231,"target":39,"type":"cites","value":16},{"source":231,"target":235,"type":"cites","value":4},{"source":231,"target":1,"type":"cites","value":6},{"source":231,"target":112,"type":"cites","value":11},{"source":231,"target":236,"type":"cites","value":4},{"source":233,"target":143,"type":"cites","value":11},{"source":233,"target":39,"type":"cites","value":11},{"source":233,"target":1,"type":"cites","value":3},{"source":233,"target":112,"type":"cites","value":4},{"source":233,"target":236,"type":"cites","value":3},{"source":55,"target":143,"type":"cites","value":9},{"source":55,"target":39,"type":"cites","value":7},{"source":232,"target":143,"type":"cites","value":11},{"source":232,"target":39,"type":"cites","value":10},{"source":232,"target":1,"type":"cites","value":3},{"source":232,"target":236,"type":"cites","value":3},{"source":231,"target":146,"type":"cites","value":15},{"source":233,"target":146,"type":"cites","value":9},{"source":55,"target":146,"type":"cites","value":6},{"source":232,"target":146,"type":"cites","value":6},{"source":219,"target":134,"type":"cites","value":5},{"source":219,"target":237,"type":"cites","value":4},{"source":35,"target":134,"type":"cites","value":6},{"source":35,"target":237,"type":"cites","value":5},{"source":238,"target":191,"type":"cites","value":3},{"source":238,"target":13,"type":"cites","value":3},{"source":13,"target":191,"type":"cites","value":3},{"source":133,"target":239,"type":"cites","value":5},{"source":240,"target":71,"type":"cites","value":3},{"source":240,"target":66,"type":"cites","value":6},{"source":133,"target":66,"type":"cites","value":7},{"source":241,"target":9,"type":"cites","value":3},{"source":133,"target":9,"type":"cites","value":5},{"source":133,"target":242,"type":"cites","value":4},{"source":241,"target":66,"type":"cites","value":4},{"source":133,"target":134,"type":"cites","value":4},{"source":243,"target":240,"type":"cites","value":8},{"source":243,"target":133,"type":"cites","value":11},{"source":243,"target":71,"type":"cites","value":5},{"source":84,"target":225,"type":"cites","value":5},{"source":84,"target":10,"type":"cites","value":4},{"source":84,"target":80,"type":"cites","value":4},{"source":54,"target":240,"type":"cites","value":3},{"source":54,"target":133,"type":"cites","value":3},{"source":13,"target":240,"type":"cites","value":3},{"source":1,"target":130,"type":"cites","value":3},{"source":244,"target":242,"type":"cites","value":3},{"source":244,"target":239,"type":"cites","value":3},{"source":245,"target":242,"type":"cites","value":3},{"source":245,"target":239,"type":"cites","value":3},{"source":45,"target":242,"type":"cites","value":3},{"source":45,"target":239,"type":"cites","value":3},{"source":246,"target":242,"type":"cites","value":3},{"source":246,"target":239,"type":"cites","value":3},{"source":244,"target":72,"type":"cites","value":5},{"source":244,"target":71,"type":"cites","value":11},{"source":245,"target":72,"type":"cites","value":5},{"source":245,"target":71,"type":"cites","value":14},{"source":246,"target":72,"type":"cites","value":4},{"source":246,"target":71,"type":"cites","value":8},{"source":245,"target":213,"type":"cites","value":4},{"source":45,"target":134,"type":"cites","value":4},{"source":247,"target":4,"type":"cites","value":3},{"source":45,"target":4,"type":"cites","value":5},{"source":54,"target":84,"type":"cites","value":5},{"source":9,"target":213,"type":"cites","value":5},{"source":9,"target":134,"type":"cites","value":7},{"source":9,"target":248,"type":"cites","value":4},{"source":9,"target":249,"type":"cites","value":4},{"source":9,"target":99,"type":"cites","value":3},{"source":134,"target":225,"type":"cites","value":3},{"source":134,"target":10,"type":"cites","value":5},{"source":77,"target":225,"type":"cites","value":4},{"source":77,"target":10,"type":"cites","value":3},{"source":10,"target":67,"type":"cites","value":4},{"source":77,"target":66,"type":"cites","value":5},{"source":128,"target":86,"type":"cites","value":3},{"source":127,"target":86,"type":"cites","value":3},{"source":41,"target":36,"type":"cites","value":3},{"source":41,"target":1,"type":"cites","value":3},{"source":161,"target":200,"type":"cites","value":7},{"source":161,"target":89,"type":"cites","value":3},{"source":161,"target":250,"type":"cites","value":3},{"source":161,"target":251,"type":"cites","value":4},{"source":161,"target":252,"type":"cites","value":4},{"source":253,"target":192,"type":"cites","value":7},{"source":253,"target":193,"type":"cites","value":7},{"source":254,"target":204,"type":"cites","value":4},{"source":254,"target":255,"type":"cites","value":3},{"source":254,"target":256,"type":"cites","value":4},{"source":129,"target":193,"type":"cites","value":3},{"source":36,"target":185,"type":"cites","value":3},{"source":257,"target":258,"type":"cites","value":3},{"source":20,"target":159,"type":"cites","value":4},{"source":20,"target":259,"type":"cites","value":3},{"source":20,"target":194,"type":"cites","value":3},{"source":260,"target":261,"type":"cites","value":6},{"source":262,"target":263,"type":"cites","value":3},{"source":222,"target":263,"type":"cites","value":4},{"source":203,"target":264,"type":"cites","value":5},{"source":203,"target":204,"type":"cites","value":6},{"source":203,"target":256,"type":"cites","value":3},{"source":159,"target":222,"type":"cites","value":3},{"source":198,"target":89,"type":"cites","value":6},{"source":198,"target":91,"type":"cites","value":3},{"source":198,"target":92,"type":"cites","value":3},{"source":198,"target":93,"type":"cites","value":3},{"source":198,"target":94,"type":"cites","value":3},{"source":198,"target":95,"type":"cites","value":3},{"source":198,"target":96,"type":"cites","value":3},{"source":265,"target":205,"type":"cites","value":7},{"source":265,"target":207,"type":"cites","value":7},{"source":265,"target":115,"type":"cites","value":6},{"source":265,"target":206,"type":"cites","value":5},{"source":265,"target":84,"type":"cites","value":12},{"source":266,"target":231,"type":"cites","value":8},{"source":266,"target":233,"type":"cites","value":6},{"source":266,"target":55,"type":"cites","value":3},{"source":266,"target":232,"type":"cites","value":6},{"source":146,"target":231,"type":"cites","value":7},{"source":146,"target":233,"type":"cites","value":5},{"source":146,"target":55,"type":"cites","value":5},{"source":146,"target":232,"type":"cites","value":7},{"source":143,"target":231,"type":"cites","value":6},{"source":143,"target":233,"type":"cites","value":4},{"source":143,"target":55,"type":"cites","value":4},{"source":143,"target":232,"type":"cites","value":6},{"source":244,"target":45,"type":"cites","value":7},{"source":245,"target":45,"type":"cites","value":11},{"source":246,"target":45,"type":"cites","value":5},{"source":244,"target":9,"type":"cites","value":3},{"source":245,"target":9,"type":"cites","value":3},{"source":45,"target":247,"type":"cites","value":6},{"source":45,"target":267,"type":"cites","value":10},{"source":146,"target":134,"type":"cites","value":4},{"source":146,"target":71,"type":"cites","value":3},{"source":266,"target":134,"type":"cites","value":4},{"source":143,"target":134,"type":"cites","value":6},{"source":143,"target":71,"type":"cites","value":8},{"source":268,"target":134,"type":"cites","value":4},{"source":266,"target":102,"type":"cites","value":4},{"source":134,"target":103,"type":"cites","value":4},{"source":134,"target":102,"type":"cites","value":5},{"source":134,"target":77,"type":"cites","value":5},{"source":134,"target":231,"type":"cites","value":3},{"source":134,"target":232,"type":"cites","value":3},{"source":266,"target":36,"type":"cites","value":4},{"source":143,"target":66,"type":"cites","value":4},{"source":269,"target":113,"type":"cites","value":3},{"source":269,"target":114,"type":"cites","value":4},{"source":9,"target":270,"type":"cites","value":5},{"source":271,"target":84,"type":"cites","value":3},{"source":271,"target":102,"type":"cites","value":5},{"source":272,"target":13,"type":"cites","value":3},{"source":54,"target":66,"type":"cites","value":3},{"source":273,"target":55,"type":"cites","value":3},{"source":151,"target":10,"type":"cites","value":4},{"source":11,"target":66,"type":"cites","value":4},{"source":11,"target":71,"type":"cites","value":3},{"source":274,"target":17,"type":"cites","value":4},{"source":275,"target":17,"type":"cites","value":4},{"source":274,"target":54,"type":"cites","value":7},{"source":274,"target":77,"type":"cites","value":5},{"source":275,"target":54,"type":"cites","value":5},{"source":84,"target":66,"type":"cites","value":5},{"source":84,"target":67,"type":"cites","value":6},{"source":84,"target":213,"type":"cites","value":6},{"source":84,"target":134,"type":"cites","value":4},{"source":84,"target":71,"type":"cites","value":9},{"source":276,"target":185,"type":"cites","value":4},{"source":276,"target":84,"type":"cites","value":12},{"source":84,"target":166,"type":"cites","value":3},{"source":277,"target":80,"type":"cites","value":4},{"source":55,"target":80,"type":"cites","value":4},{"source":84,"target":220,"type":"cites","value":6},{"source":226,"target":143,"type":"cites","value":4},{"source":226,"target":39,"type":"cites","value":3},{"source":278,"target":143,"type":"cites","value":3},{"source":185,"target":143,"type":"cites","value":5},{"source":185,"target":39,"type":"cites","value":4},{"source":226,"target":35,"type":"cites","value":5},{"source":212,"target":36,"type":"cites","value":5},{"source":226,"target":185,"type":"cites","value":5},{"source":212,"target":185,"type":"cites","value":4},{"source":185,"target":226,"type":"cites","value":3},{"source":9,"target":185,"type":"cites","value":4},{"source":9,"target":84,"type":"cites","value":10},{"source":279,"target":280,"type":"cites","value":3},{"source":279,"target":77,"type":"cites","value":12},{"source":279,"target":84,"type":"cites","value":3},{"source":77,"target":84,"type":"cites","value":7},{"source":279,"target":54,"type":"cites","value":4},{"source":279,"target":78,"type":"cites","value":4},{"source":279,"target":79,"type":"cites","value":4},{"source":112,"target":35,"type":"cites","value":4},{"source":39,"target":134,"type":"cites","value":4},{"source":281,"target":165,"type":"cites","value":5},{"source":281,"target":80,"type":"cites","value":5},{"source":66,"target":165,"type":"cites","value":6},{"source":66,"target":80,"type":"cites","value":7},{"source":228,"target":98,"type":"cites","value":6},{"source":176,"target":99,"type":"cites","value":12},{"source":231,"target":144,"type":"cites","value":3},{"source":231,"target":53,"type":"cites","value":3},{"source":231,"target":145,"type":"cites","value":3},{"source":231,"target":55,"type":"cites","value":18},{"source":233,"target":55,"type":"cites","value":7},{"source":232,"target":55,"type":"cites","value":4},{"source":231,"target":233,"type":"cites","value":23},{"source":231,"target":232,"type":"cites","value":15},{"source":233,"target":231,"type":"cites","value":10},{"source":233,"target":232,"type":"cites","value":8},{"source":55,"target":231,"type":"cites","value":3},{"source":55,"target":233,"type":"cites","value":3},{"source":55,"target":232,"type":"cites","value":3},{"source":232,"target":231,"type":"cites","value":3},{"source":199,"target":282,"type":"cites","value":8},{"source":283,"target":161,"type":"cites","value":11},{"source":222,"target":203,"type":"cites","value":7},{"source":222,"target":204,"type":"cites","value":3},{"source":284,"target":124,"type":"cites","value":3},{"source":284,"target":199,"type":"cites","value":3},{"source":161,"target":264,"type":"cites","value":4},{"source":285,"target":23,"type":"cites","value":6},{"source":285,"target":120,"type":"cites","value":6},{"source":286,"target":25,"type":"cites","value":4},{"source":286,"target":26,"type":"cites","value":3},{"source":185,"target":120,"type":"cites","value":4},{"source":185,"target":287,"type":"cites","value":5},{"source":288,"target":23,"type":"cites","value":6},{"source":289,"target":23,"type":"cites","value":6},{"source":290,"target":23,"type":"cites","value":7},{"source":288,"target":120,"type":"cites","value":4},{"source":289,"target":120,"type":"cites","value":4},{"source":290,"target":120,"type":"cites","value":5},{"source":253,"target":203,"type":"cites","value":5},{"source":253,"target":261,"type":"cites","value":4},{"source":253,"target":57,"type":"cites","value":3},{"source":291,"target":161,"type":"cites","value":6},{"source":20,"target":36,"type":"cites","value":8},{"source":292,"target":36,"type":"cites","value":5},{"source":292,"target":20,"type":"cites","value":15},{"source":293,"target":294,"type":"cites","value":4},{"source":293,"target":161,"type":"cites","value":15},{"source":102,"target":55,"type":"cites","value":3},{"source":143,"target":113,"type":"cites","value":3},{"source":143,"target":114,"type":"cites","value":4},{"source":295,"target":143,"type":"cites","value":4},{"source":141,"target":134,"type":"cites","value":3},{"source":11,"target":84,"type":"cites","value":7},{"source":11,"target":205,"type":"cites","value":3},{"source":11,"target":13,"type":"cites","value":3},{"source":296,"target":41,"type":"cites","value":3},{"source":297,"target":41,"type":"cites","value":6},{"source":298,"target":41,"type":"cites","value":8},{"source":296,"target":165,"type":"cites","value":5},{"source":41,"target":165,"type":"cites","value":5},{"source":41,"target":66,"type":"cites","value":3},{"source":296,"target":80,"type":"cites","value":3},{"source":41,"target":80,"type":"cites","value":4},{"source":98,"target":299,"type":"cites","value":7},{"source":4,"target":300,"type":"cites","value":4},{"source":4,"target":71,"type":"cites","value":3},{"source":301,"target":4,"type":"cites","value":5},{"source":302,"target":54,"type":"cites","value":3},{"source":141,"target":54,"type":"cites","value":3},{"source":303,"target":54,"type":"cites","value":3},{"source":304,"target":54,"type":"cites","value":3},{"source":305,"target":77,"type":"cites","value":3},{"source":66,"target":134,"type":"cites","value":3},{"source":66,"target":77,"type":"cites","value":4},{"source":66,"target":71,"type":"cites","value":4},{"source":279,"target":306,"type":"cites","value":3},{"source":66,"target":84,"type":"cites","value":4},{"source":307,"target":13,"type":"cites","value":3},{"source":307,"target":66,"type":"cites","value":4},{"source":307,"target":67,"type":"cites","value":4},{"source":307,"target":71,"type":"cites","value":5},{"source":11,"target":67,"type":"cites","value":3},{"source":307,"target":205,"type":"cites","value":3},{"source":307,"target":84,"type":"cites","value":8},{"source":13,"target":84,"type":"cites","value":10},{"source":45,"target":67,"type":"cites","value":4},{"source":45,"target":308,"type":"cites","value":3},{"source":45,"target":309,"type":"cites","value":3},{"source":308,"target":176,"type":"cites","value":3},{"source":308,"target":99,"type":"cites","value":8},{"source":248,"target":99,"type":"cites","value":4},{"source":310,"target":311,"type":"cites","value":3},{"source":310,"target":312,"type":"cites","value":3},{"source":310,"target":313,"type":"cites","value":3},{"source":310,"target":314,"type":"cites","value":3},{"source":310,"target":315,"type":"cites","value":3},{"source":99,"target":311,"type":"cites","value":3},{"source":99,"target":312,"type":"cites","value":3},{"source":99,"target":313,"type":"cites","value":3},{"source":99,"target":314,"type":"cites","value":3},{"source":99,"target":315,"type":"cites","value":3},{"source":1,"target":311,"type":"cites","value":3},{"source":1,"target":312,"type":"cites","value":3},{"source":1,"target":313,"type":"cites","value":3},{"source":1,"target":314,"type":"cites","value":3},{"source":1,"target":315,"type":"cites","value":3},{"source":310,"target":176,"type":"cites","value":4},{"source":310,"target":316,"type":"cites","value":4},{"source":310,"target":317,"type":"cites","value":4},{"source":318,"target":176,"type":"cites","value":5},{"source":99,"target":176,"type":"cites","value":12},{"source":99,"target":316,"type":"cites","value":10},{"source":99,"target":317,"type":"cites","value":9},{"source":227,"target":176,"type":"cites","value":6},{"source":227,"target":316,"type":"cites","value":6},{"source":227,"target":317,"type":"cites","value":5},{"source":1,"target":176,"type":"cites","value":4},{"source":1,"target":316,"type":"cites","value":3},{"source":1,"target":317,"type":"cites","value":3},{"source":318,"target":143,"type":"cites","value":3},{"source":99,"target":146,"type":"cites","value":3},{"source":99,"target":143,"type":"cites","value":6},{"source":99,"target":39,"type":"cites","value":5},{"source":227,"target":143,"type":"cites","value":6},{"source":227,"target":39,"type":"cites","value":5},{"source":80,"target":212,"type":"cites","value":11},{"source":212,"target":66,"type":"cites","value":3},{"source":212,"target":300,"type":"cites","value":4},{"source":84,"target":117,"type":"cites","value":4},{"source":220,"target":36,"type":"cites","value":4},{"source":220,"target":209,"type":"cites","value":4},{"source":319,"target":84,"type":"cites","value":5},{"source":320,"target":266,"type":"cites","value":6},{"source":320,"target":146,"type":"cites","value":5},{"source":320,"target":143,"type":"cites","value":9},{"source":143,"target":266,"type":"cites","value":7},{"source":320,"target":71,"type":"cites","value":4},{"source":320,"target":45,"type":"cites","value":3},{"source":320,"target":231,"type":"cites","value":4},{"source":320,"target":232,"type":"cites","value":4},{"source":266,"target":143,"type":"cites","value":12},{"source":266,"target":39,"type":"cites","value":9},{"source":266,"target":40,"type":"cites","value":3},{"source":185,"target":102,"type":"cites","value":3},{"source":266,"target":146,"type":"cites","value":11},{"source":287,"target":266,"type":"cites","value":3},{"source":185,"target":266,"type":"cites","value":4},{"source":39,"target":266,"type":"cites","value":6},{"source":266,"target":321,"type":"cites","value":3},{"source":39,"target":321,"type":"cites","value":4},{"source":39,"target":71,"type":"cites","value":4},{"source":226,"target":231,"type":"cites","value":3},{"source":287,"target":185,"type":"cites","value":8},{"source":231,"target":102,"type":"cites","value":16},{"source":231,"target":103,"type":"cites","value":13},{"source":322,"target":102,"type":"cites","value":3},{"source":322,"target":103,"type":"cites","value":3},{"source":233,"target":102,"type":"cites","value":5},{"source":233,"target":103,"type":"cites","value":4},{"source":55,"target":102,"type":"cites","value":4},{"source":55,"target":103,"type":"cites","value":3},{"source":323,"target":66,"type":"cites","value":4},{"source":323,"target":67,"type":"cites","value":3},{"source":323,"target":71,"type":"cites","value":5},{"source":323,"target":133,"type":"cites","value":3},{"source":84,"target":240,"type":"cites","value":3},{"source":84,"target":133,"type":"cites","value":6},{"source":323,"target":276,"type":"cites","value":5},{"source":323,"target":205,"type":"cites","value":6},{"source":323,"target":84,"type":"cites","value":28},{"source":84,"target":276,"type":"cites","value":8},{"source":323,"target":9,"type":"cites","value":8},{"source":84,"target":9,"type":"cites","value":12},{"source":324,"target":66,"type":"cites","value":5},{"source":324,"target":67,"type":"cites","value":4},{"source":66,"target":174,"type":"cites","value":3},{"source":325,"target":66,"type":"cites","value":6},{"source":325,"target":67,"type":"cites","value":3},{"source":326,"target":204,"type":"cites","value":5},{"source":124,"target":222,"type":"cites","value":3},{"source":326,"target":283,"type":"cites","value":5},{"source":327,"target":23,"type":"cites","value":3},{"source":327,"target":120,"type":"cites","value":3},{"source":328,"target":23,"type":"cites","value":3},{"source":328,"target":120,"type":"cites","value":3},{"source":329,"target":330,"type":"cites","value":8},{"source":331,"target":329,"type":"cites","value":14},{"source":331,"target":330,"type":"cites","value":7},{"source":332,"target":203,"type":"cites","value":10},{"source":283,"target":192,"type":"cites","value":15},{"source":283,"target":193,"type":"cites","value":14},{"source":333,"target":192,"type":"cites","value":4},{"source":333,"target":193,"type":"cites","value":3},{"source":283,"target":253,"type":"cites","value":4},{"source":283,"target":203,"type":"cites","value":7},{"source":293,"target":203,"type":"cites","value":3},{"source":20,"target":334,"type":"cites","value":3},{"source":20,"target":335,"type":"cites","value":3},{"source":20,"target":336,"type":"cites","value":3},{"source":337,"target":89,"type":"cites","value":3},{"source":338,"target":89,"type":"cites","value":3},{"source":339,"target":91,"type":"cites","value":3},{"source":339,"target":89,"type":"cites","value":5},{"source":339,"target":92,"type":"cites","value":3},{"source":339,"target":93,"type":"cites","value":3},{"source":339,"target":94,"type":"cites","value":3},{"source":339,"target":95,"type":"cites","value":3},{"source":339,"target":96,"type":"cites","value":3},{"source":339,"target":20,"type":"cites","value":5},{"source":339,"target":198,"type":"cites","value":9},{"source":339,"target":23,"type":"cites","value":3},{"source":340,"target":161,"type":"cites","value":7},{"source":256,"target":161,"type":"cites","value":3},{"source":341,"target":161,"type":"cites","value":3},{"source":291,"target":294,"type":"cites","value":3},{"source":339,"target":90,"type":"cites","value":6},{"source":325,"target":89,"type":"cites","value":3},{"source":342,"target":343,"type":"cites","value":3},{"source":342,"target":344,"type":"cites","value":3},{"source":20,"target":161,"type":"cites","value":8},{"source":292,"target":161,"type":"cites","value":3},{"source":345,"target":80,"type":"cites","value":3},{"source":345,"target":133,"type":"cites","value":3},{"source":133,"target":240,"type":"cites","value":8},{"source":13,"target":220,"type":"cites","value":4},{"source":13,"target":115,"type":"cites","value":6},{"source":13,"target":346,"type":"cites","value":4},{"source":13,"target":347,"type":"cites","value":4},{"source":212,"target":54,"type":"cites","value":3},{"source":212,"target":165,"type":"cites","value":4},{"source":268,"target":143,"type":"cites","value":3},{"source":348,"target":349,"type":"cites","value":3},{"source":350,"target":351,"type":"cites","value":5},{"source":350,"target":352,"type":"cites","value":5},{"source":350,"target":353,"type":"cites","value":5},{"source":350,"target":349,"type":"cites","value":7},{"source":348,"target":182,"type":"cites","value":5},{"source":348,"target":181,"type":"cites","value":3},{"source":350,"target":354,"type":"cites","value":3},{"source":350,"target":182,"type":"cites","value":11},{"source":350,"target":181,"type":"cites","value":7},{"source":348,"target":179,"type":"cites","value":3},{"source":348,"target":355,"type":"cites","value":3},{"source":350,"target":356,"type":"cites","value":3},{"source":350,"target":179,"type":"cites","value":7},{"source":350,"target":355,"type":"cites","value":7},{"source":350,"target":180,"type":"cites","value":3},{"source":350,"target":357,"type":"cites","value":3},{"source":350,"target":183,"type":"cites","value":3},{"source":350,"target":341,"type":"cites","value":3},{"source":350,"target":358,"type":"cites","value":3},{"source":359,"target":84,"type":"cites","value":3},{"source":276,"target":323,"type":"cites","value":4},{"source":84,"target":323,"type":"cites","value":26},{"source":276,"target":205,"type":"cites","value":3},{"source":240,"target":67,"type":"cites","value":4},{"source":133,"target":67,"type":"cites","value":4},{"source":240,"target":84,"type":"cites","value":4},{"source":133,"target":84,"type":"cites","value":8},{"source":241,"target":133,"type":"cites","value":3},{"source":133,"target":323,"type":"cites","value":5},{"source":134,"target":151,"type":"cites","value":4},{"source":360,"target":151,"type":"cites","value":3},{"source":134,"target":35,"type":"cites","value":3},{"source":45,"target":10,"type":"cites","value":3},{"source":45,"target":361,"type":"cites","value":3},{"source":323,"target":254,"type":"cites","value":3},{"source":323,"target":362,"type":"cites","value":3},{"source":323,"target":363,"type":"cites","value":3},{"source":323,"target":225,"type":"cites","value":3},{"source":323,"target":265,"type":"cites","value":3},{"source":323,"target":221,"type":"cites","value":3},{"source":323,"target":207,"type":"cites","value":7},{"source":84,"target":364,"type":"cites","value":3},{"source":84,"target":365,"type":"cites","value":3},{"source":84,"target":366,"type":"cites","value":3},{"source":84,"target":265,"type":"cites","value":4},{"source":323,"target":307,"type":"cites","value":3},{"source":84,"target":307,"type":"cites","value":4},{"source":367,"target":213,"type":"cites","value":3},{"source":367,"target":71,"type":"cites","value":3},{"source":297,"target":0,"type":"cites","value":3},{"source":41,"target":0,"type":"cites","value":3},{"source":297,"target":134,"type":"cites","value":5},{"source":41,"target":10,"type":"cites","value":3},{"source":66,"target":36,"type":"cites","value":4},{"source":276,"target":45,"type":"cites","value":4},{"source":84,"target":45,"type":"cites","value":4},{"source":368,"target":72,"type":"cites","value":3},{"source":369,"target":72,"type":"cites","value":3},{"source":369,"target":71,"type":"cites","value":3},{"source":370,"target":72,"type":"cites","value":3},{"source":370,"target":71,"type":"cites","value":3},{"source":369,"target":45,"type":"cites","value":3},{"source":370,"target":45,"type":"cites","value":3},{"source":267,"target":9,"type":"cites","value":8},{"source":45,"target":112,"type":"cites","value":4},{"source":267,"target":45,"type":"cites","value":12},{"source":45,"target":124,"type":"cites","value":3},{"source":228,"target":299,"type":"cites","value":3},{"source":45,"target":84,"type":"cites","value":4},{"source":45,"target":371,"type":"cites","value":3},{"source":176,"target":213,"type":"cites","value":3},{"source":176,"target":134,"type":"cites","value":3},{"source":176,"target":71,"type":"cites","value":8},{"source":176,"target":100,"type":"cites","value":3},{"source":176,"target":101,"type":"cites","value":3},{"source":185,"target":285,"type":"cites","value":3},{"source":41,"target":296,"type":"cites","value":3},{"source":99,"target":55,"type":"cites","value":8},{"source":111,"target":134,"type":"cites","value":3},{"source":111,"target":9,"type":"cites","value":4},{"source":111,"target":166,"type":"cites","value":3},{"source":372,"target":71,"type":"cites","value":4},{"source":227,"target":231,"type":"cites","value":3},{"source":227,"target":233,"type":"cites","value":3},{"source":227,"target":55,"type":"cites","value":7},{"source":227,"target":232,"type":"cites","value":3},{"source":227,"target":214,"type":"cites","value":4},{"source":227,"target":1,"type":"cites","value":22},{"source":99,"target":214,"type":"cites","value":5},{"source":227,"target":310,"type":"cites","value":22},{"source":227,"target":318,"type":"cites","value":15},{"source":227,"target":99,"type":"cites","value":37},{"source":99,"target":310,"type":"cites","value":26},{"source":99,"target":318,"type":"cites","value":17},{"source":99,"target":227,"type":"cites","value":30},{"source":161,"target":23,"type":"cites","value":4},{"source":373,"target":161,"type":"cites","value":11},{"source":374,"target":161,"type":"cites","value":8},{"source":161,"target":294,"type":"cites","value":3},{"source":161,"target":375,"type":"cites","value":3},{"source":373,"target":283,"type":"cites","value":5},{"source":161,"target":283,"type":"cites","value":12},{"source":161,"target":192,"type":"cites","value":4},{"source":161,"target":193,"type":"cites","value":3},{"source":376,"target":254,"type":"cites","value":5},{"source":376,"target":363,"type":"cites","value":3},{"source":264,"target":254,"type":"cites","value":4},{"source":376,"target":124,"type":"cites","value":5},{"source":264,"target":124,"type":"cites","value":6},{"source":376,"target":264,"type":"cites","value":9},{"source":377,"target":20,"type":"cites","value":3},{"source":20,"target":292,"type":"cites","value":10},{"source":20,"target":203,"type":"cites","value":3},{"source":327,"target":161,"type":"cites","value":3},{"source":378,"target":256,"type":"cites","value":3},{"source":283,"target":379,"type":"cites","value":3},{"source":161,"target":282,"type":"cites","value":6},{"source":379,"target":199,"type":"cites","value":4},{"source":380,"target":161,"type":"cites","value":8},{"source":264,"target":161,"type":"cites","value":12},{"source":380,"target":293,"type":"cites","value":3},{"source":381,"target":253,"type":"cites","value":4},{"source":382,"target":253,"type":"cites","value":3},{"source":383,"target":253,"type":"cites","value":3},{"source":282,"target":199,"type":"cites","value":8},{"source":203,"target":332,"type":"cites","value":8},{"source":254,"target":203,"type":"cites","value":5},{"source":332,"target":204,"type":"cites","value":3},{"source":332,"target":340,"type":"cites","value":3},{"source":332,"target":256,"type":"cites","value":3},{"source":332,"target":283,"type":"cites","value":15},{"source":203,"target":283,"type":"cites","value":15},{"source":332,"target":384,"type":"cites","value":4},{"source":332,"target":200,"type":"cites","value":8},{"source":203,"target":200,"type":"cites","value":3},{"source":332,"target":254,"type":"cites","value":3},{"source":203,"target":254,"type":"cites","value":5},{"source":254,"target":257,"type":"cites","value":3},{"source":385,"target":161,"type":"cites","value":6},{"source":222,"target":294,"type":"cites","value":6},{"source":222,"target":375,"type":"cites","value":4},{"source":222,"target":161,"type":"cites","value":18},{"source":385,"target":260,"type":"cites","value":3},{"source":222,"target":260,"type":"cites","value":9},{"source":222,"target":77,"type":"cites","value":5},{"source":222,"target":251,"type":"cites","value":3},{"source":222,"target":252,"type":"cites","value":3},{"source":261,"target":192,"type":"cites","value":4},{"source":261,"target":193,"type":"cites","value":4},{"source":260,"target":222,"type":"cites","value":9},{"source":386,"target":193,"type":"cites","value":4},{"source":66,"target":325,"type":"cites","value":3},{"source":54,"target":23,"type":"cites","value":3},{"source":54,"target":25,"type":"cites","value":3},{"source":387,"target":263,"type":"cites","value":5},{"source":339,"target":388,"type":"cites","value":4},{"source":339,"target":389,"type":"cites","value":4},{"source":339,"target":338,"type":"cites","value":3},{"source":339,"target":337,"type":"cites","value":3},{"source":283,"target":333,"type":"cites","value":11},{"source":390,"target":192,"type":"cites","value":5},{"source":390,"target":193,"type":"cites","value":4},{"source":390,"target":23,"type":"cites","value":8},{"source":391,"target":23,"type":"cites","value":3},{"source":390,"target":124,"type":"cites","value":4},{"source":390,"target":185,"type":"cites","value":3},{"source":161,"target":286,"type":"cites","value":3},{"source":161,"target":185,"type":"cites","value":3},{"source":390,"target":120,"type":"cites","value":4},{"source":390,"target":294,"type":"cites","value":3},{"source":390,"target":375,"type":"cites","value":3},{"source":390,"target":161,"type":"cites","value":17},{"source":161,"target":25,"type":"cites","value":4},{"source":390,"target":341,"type":"cites","value":6},{"source":392,"target":213,"type":"cites","value":3},{"source":392,"target":71,"type":"cites","value":3},{"source":393,"target":342,"type":"cites","value":3},{"source":394,"target":342,"type":"cites","value":3},{"source":112,"target":342,"type":"cites","value":3},{"source":112,"target":231,"type":"cites","value":7},{"source":112,"target":232,"type":"cites","value":4},{"source":395,"target":25,"type":"cites","value":3},{"source":395,"target":26,"type":"cites","value":3},{"source":395,"target":23,"type":"cites","value":6},{"source":395,"target":120,"type":"cites","value":6},{"source":395,"target":231,"type":"cites","value":3},{"source":396,"target":4,"type":"cites","value":5},{"source":397,"target":4,"type":"cites","value":11},{"source":396,"target":300,"type":"cites","value":3},{"source":397,"target":300,"type":"cites","value":5},{"source":398,"target":84,"type":"cites","value":3},{"source":54,"target":212,"type":"cites","value":3},{"source":231,"target":322,"type":"cites","value":10},{"source":84,"target":243,"type":"cites","value":4},{"source":399,"target":84,"type":"cites","value":4},{"source":400,"target":84,"type":"cites","value":8},{"source":401,"target":84,"type":"cites","value":8},{"source":84,"target":402,"type":"cites","value":5},{"source":84,"target":403,"type":"cites","value":5},{"source":146,"target":266,"type":"cites","value":5},{"source":310,"target":318,"type":"cites","value":10},{"source":310,"target":99,"type":"cites","value":25},{"source":310,"target":227,"type":"cites","value":19},{"source":310,"target":1,"type":"cites","value":13},{"source":318,"target":99,"type":"cites","value":6},{"source":318,"target":227,"type":"cites","value":5},{"source":1,"target":310,"type":"cites","value":3},{"source":1,"target":318,"type":"cites","value":4},{"source":1,"target":227,"type":"cites","value":5},{"source":271,"target":231,"type":"cites","value":3},{"source":323,"target":77,"type":"cites","value":8},{"source":84,"target":77,"type":"cites","value":15},{"source":323,"target":209,"type":"cites","value":3},{"source":404,"target":143,"type":"cites","value":3},{"source":405,"target":143,"type":"cites","value":4},{"source":146,"target":114,"type":"cites","value":4},{"source":406,"target":240,"type":"cites","value":3},{"source":406,"target":133,"type":"cites","value":5},{"source":406,"target":243,"type":"cites","value":19},{"source":243,"target":185,"type":"cites","value":4},{"source":406,"target":407,"type":"cites","value":6},{"source":243,"target":407,"type":"cites","value":6},{"source":307,"target":166,"type":"cites","value":3},{"source":408,"target":84,"type":"cites","value":3},{"source":307,"target":134,"type":"cites","value":4},{"source":409,"target":107,"type":"cites","value":3},{"source":410,"target":133,"type":"cites","value":3},{"source":409,"target":133,"type":"cites","value":5},{"source":410,"target":71,"type":"cites","value":3},{"source":409,"target":72,"type":"cites","value":7},{"source":409,"target":71,"type":"cites","value":9},{"source":411,"target":321,"type":"cites","value":4},{"source":411,"target":186,"type":"cites","value":4},{"source":411,"target":412,"type":"cites","value":3},{"source":411,"target":413,"type":"cites","value":3},{"source":411,"target":39,"type":"cites","value":4},{"source":414,"target":321,"type":"cites","value":4},{"source":414,"target":186,"type":"cites","value":4},{"source":414,"target":412,"type":"cites","value":3},{"source":414,"target":413,"type":"cites","value":3},{"source":414,"target":39,"type":"cites","value":4},{"source":109,"target":321,"type":"cites","value":4},{"source":109,"target":186,"type":"cites","value":4},{"source":109,"target":412,"type":"cites","value":3},{"source":109,"target":413,"type":"cites","value":3},{"source":109,"target":39,"type":"cites","value":4},{"source":323,"target":402,"type":"cites","value":3},{"source":323,"target":403,"type":"cites","value":3},{"source":323,"target":45,"type":"cites","value":6},{"source":216,"target":99,"type":"cites","value":3},{"source":266,"target":99,"type":"cites","value":6},{"source":297,"target":298,"type":"cites","value":3},{"source":298,"target":297,"type":"cites","value":4},{"source":298,"target":415,"type":"cites","value":5},{"source":41,"target":297,"type":"cites","value":7},{"source":41,"target":415,"type":"cites","value":10},{"source":41,"target":298,"type":"cites","value":16},{"source":41,"target":16,"type":"cites","value":3},{"source":350,"target":348,"type":"cites","value":7},{"source":350,"target":416,"type":"cites","value":3},{"source":417,"target":296,"type":"cites","value":4},{"source":417,"target":418,"type":"cites","value":3},{"source":417,"target":41,"type":"cites","value":4},{"source":243,"target":296,"type":"cites","value":4},{"source":243,"target":418,"type":"cites","value":3},{"source":243,"target":99,"type":"cites","value":5},{"source":243,"target":41,"type":"cites","value":5},{"source":287,"target":296,"type":"cites","value":3},{"source":287,"target":41,"type":"cites","value":3},{"source":417,"target":419,"type":"cites","value":3},{"source":417,"target":165,"type":"cites","value":5},{"source":417,"target":80,"type":"cites","value":6},{"source":243,"target":165,"type":"cites","value":4},{"source":243,"target":80,"type":"cites","value":7},{"source":287,"target":419,"type":"cites","value":3},{"source":287,"target":165,"type":"cites","value":5},{"source":287,"target":80,"type":"cites","value":6},{"source":243,"target":84,"type":"cites","value":8},{"source":243,"target":420,"type":"cites","value":5},{"source":243,"target":1,"type":"cites","value":6},{"source":243,"target":112,"type":"cites","value":5},{"source":84,"target":421,"type":"cites","value":4},{"source":323,"target":247,"type":"cites","value":3},{"source":323,"target":422,"type":"cites","value":3},{"source":84,"target":367,"type":"cites","value":3},{"source":84,"target":422,"type":"cites","value":3},{"source":423,"target":9,"type":"cites","value":3},{"source":424,"target":9,"type":"cites","value":3},{"source":227,"target":83,"type":"cites","value":4},{"source":425,"target":134,"type":"cites","value":10},{"source":231,"target":134,"type":"cites","value":4},{"source":426,"target":10,"type":"cites","value":4},{"source":426,"target":77,"type":"cites","value":3},{"source":80,"target":227,"type":"cites","value":3},{"source":80,"target":99,"type":"cites","value":4},{"source":385,"target":283,"type":"cites","value":3},{"source":385,"target":222,"type":"cites","value":4},{"source":45,"target":20,"type":"cites","value":3},{"source":45,"target":23,"type":"cites","value":7},{"source":45,"target":120,"type":"cites","value":5},{"source":427,"target":161,"type":"cites","value":13},{"source":161,"target":374,"type":"cites","value":3},{"source":427,"target":282,"type":"cites","value":3},{"source":427,"target":199,"type":"cites","value":3},{"source":427,"target":200,"type":"cites","value":3},{"source":161,"target":199,"type":"cites","value":6},{"source":427,"target":428,"type":"cites","value":4},{"source":427,"target":429,"type":"cites","value":3},{"source":161,"target":428,"type":"cites","value":6},{"source":161,"target":427,"type":"cites","value":10},{"source":161,"target":429,"type":"cites","value":5},{"source":379,"target":283,"type":"cites","value":7},{"source":340,"target":283,"type":"cites","value":18},{"source":161,"target":378,"type":"cites","value":3},{"source":264,"target":430,"type":"cites","value":3},{"source":264,"target":431,"type":"cites","value":3},{"source":432,"target":282,"type":"cites","value":4},{"source":264,"target":282,"type":"cites","value":6},{"source":432,"target":199,"type":"cites","value":4},{"source":264,"target":199,"type":"cites","value":9},{"source":264,"target":380,"type":"cites","value":8},{"source":291,"target":282,"type":"cites","value":5},{"source":291,"target":199,"type":"cites","value":8},{"source":433,"target":330,"type":"cites","value":3},{"source":329,"target":331,"type":"cites","value":14},{"source":433,"target":329,"type":"cites","value":4},{"source":433,"target":331,"type":"cites","value":3},{"source":329,"target":283,"type":"cites","value":3},{"source":329,"target":200,"type":"cites","value":7},{"source":329,"target":36,"type":"cites","value":5},{"source":331,"target":200,"type":"cites","value":6},{"source":331,"target":36,"type":"cites","value":5},{"source":433,"target":200,"type":"cites","value":3},{"source":434,"target":327,"type":"cites","value":3},{"source":434,"target":328,"type":"cites","value":3},{"source":395,"target":327,"type":"cites","value":8},{"source":395,"target":328,"type":"cites","value":8},{"source":395,"target":200,"type":"cites","value":4},{"source":395,"target":36,"type":"cites","value":10},{"source":434,"target":264,"type":"cites","value":3},{"source":395,"target":264,"type":"cites","value":10},{"source":395,"target":435,"type":"cites","value":7},{"source":283,"target":261,"type":"cites","value":8},{"source":436,"target":387,"type":"cites","value":3},{"source":437,"target":332,"type":"cites","value":3},{"source":437,"target":203,"type":"cites","value":15},{"source":437,"target":254,"type":"cites","value":4},{"source":332,"target":438,"type":"cites","value":3},{"source":332,"target":261,"type":"cites","value":3},{"source":185,"target":161,"type":"cites","value":6},{"source":439,"target":339,"type":"cites","value":3},{"source":440,"target":441,"type":"cites","value":9},{"source":440,"target":286,"type":"cites","value":4},{"source":440,"target":339,"type":"cites","value":16},{"source":339,"target":441,"type":"cites","value":8},{"source":339,"target":286,"type":"cites","value":6},{"source":441,"target":286,"type":"cites","value":5},{"source":441,"target":339,"type":"cites","value":4},{"source":442,"target":161,"type":"cites","value":9},{"source":442,"target":390,"type":"cites","value":5},{"source":390,"target":282,"type":"cites","value":6},{"source":390,"target":199,"type":"cites","value":10},{"source":390,"target":200,"type":"cites","value":3},{"source":442,"target":199,"type":"cites","value":3},{"source":203,"target":199,"type":"cites","value":3},{"source":442,"target":23,"type":"cites","value":6},{"source":203,"target":23,"type":"cites","value":6},{"source":442,"target":294,"type":"cites","value":4},{"source":442,"target":375,"type":"cites","value":3},{"source":390,"target":20,"type":"cites","value":4},{"source":203,"target":20,"type":"cites","value":4},{"source":442,"target":120,"type":"cites","value":3},{"source":203,"target":120,"type":"cites","value":3},{"source":390,"target":203,"type":"cites","value":5},{"source":442,"target":203,"type":"cites","value":22},{"source":390,"target":283,"type":"cites","value":16},{"source":390,"target":378,"type":"cites","value":5},{"source":442,"target":283,"type":"cites","value":7},{"source":9,"target":199,"type":"cites","value":6},{"source":9,"target":283,"type":"cites","value":9},{"source":199,"target":200,"type":"cites","value":5},{"source":199,"target":443,"type":"cites","value":4},{"source":199,"target":444,"type":"cites","value":4},{"source":282,"target":200,"type":"cites","value":3},{"source":264,"target":445,"type":"cites","value":3},{"source":264,"target":283,"type":"cites","value":13},{"source":264,"target":333,"type":"cites","value":5},{"source":376,"target":283,"type":"cites","value":5},{"source":446,"target":199,"type":"cites","value":4},{"source":376,"target":199,"type":"cites","value":3},{"source":447,"target":199,"type":"cites","value":3},{"source":448,"target":449,"type":"cites","value":3},{"source":448,"target":325,"type":"cites","value":8},{"source":448,"target":66,"type":"cites","value":11},{"source":66,"target":448,"type":"cites","value":5},{"source":450,"target":20,"type":"cites","value":3},{"source":440,"target":198,"type":"cites","value":3},{"source":441,"target":198,"type":"cites","value":3},{"source":441,"target":451,"type":"cites","value":3},{"source":339,"target":452,"type":"cites","value":3},{"source":339,"target":451,"type":"cites","value":3},{"source":453,"target":339,"type":"cites","value":3},{"source":454,"target":339,"type":"cites","value":4},{"source":339,"target":161,"type":"cites","value":8},{"source":339,"target":427,"type":"cites","value":3},{"source":454,"target":161,"type":"cites","value":6},{"source":454,"target":427,"type":"cites","value":3},{"source":341,"target":282,"type":"cites","value":4},{"source":341,"target":199,"type":"cites","value":5},{"source":455,"target":161,"type":"cites","value":5},{"source":253,"target":283,"type":"cites","value":3},{"source":253,"target":23,"type":"cites","value":3},{"source":253,"target":161,"type":"cites","value":6},{"source":253,"target":428,"type":"cites","value":3},{"source":253,"target":427,"type":"cites","value":4},{"source":253,"target":429,"type":"cites","value":3},{"source":310,"target":456,"type":"cites","value":3},{"source":310,"target":457,"type":"cites","value":3},{"source":310,"target":458,"type":"cites","value":3},{"source":227,"target":456,"type":"cites","value":5},{"source":227,"target":457,"type":"cites","value":5},{"source":227,"target":458,"type":"cites","value":5},{"source":99,"target":456,"type":"cites","value":5},{"source":99,"target":457,"type":"cites","value":5},{"source":99,"target":458,"type":"cites","value":5},{"source":54,"target":459,"type":"cites","value":3},{"source":54,"target":460,"type":"cites","value":3},{"source":212,"target":176,"type":"cites","value":7},{"source":212,"target":461,"type":"cites","value":6},{"source":212,"target":462,"type":"cites","value":3},{"source":212,"target":297,"type":"cites","value":3},{"source":463,"target":240,"type":"cites","value":3},{"source":463,"target":133,"type":"cites","value":5},{"source":133,"target":241,"type":"cites","value":5},{"source":41,"target":176,"type":"cites","value":4},{"source":464,"target":75,"type":"cites","value":5},{"source":464,"target":76,"type":"cites","value":3},{"source":266,"target":1,"type":"cites","value":5},{"source":266,"target":112,"type":"cites","value":6},{"source":465,"target":84,"type":"cites","value":6},{"source":466,"target":84,"type":"cites","value":4},{"source":467,"target":185,"type":"cites","value":3},{"source":417,"target":287,"type":"cites","value":4},{"source":417,"target":185,"type":"cites","value":7},{"source":267,"target":247,"type":"cites","value":4},{"source":468,"target":45,"type":"cites","value":3},{"source":267,"target":405,"type":"cites","value":3},{"source":267,"target":143,"type":"cites","value":4},{"source":267,"target":84,"type":"cites","value":3},{"source":176,"target":143,"type":"cites","value":5},{"source":176,"target":320,"type":"cites","value":3},{"source":143,"target":80,"type":"cites","value":3},{"source":176,"target":231,"type":"cites","value":3},{"source":320,"target":112,"type":"cites","value":3},{"source":196,"target":469,"type":"cites","value":5},{"source":196,"target":470,"type":"cites","value":7},{"source":470,"target":196,"type":"cites","value":8},{"source":470,"target":469,"type":"cites","value":5},{"source":469,"target":196,"type":"cites","value":7},{"source":469,"target":470,"type":"cites","value":5},{"source":185,"target":196,"type":"cites","value":9},{"source":185,"target":469,"type":"cites","value":5},{"source":185,"target":470,"type":"cites","value":6},{"source":470,"target":185,"type":"cites","value":10},{"source":469,"target":185,"type":"cites","value":8},{"source":196,"target":266,"type":"cites","value":3},{"source":243,"target":9,"type":"cites","value":4},{"source":42,"target":426,"type":"cites","value":8},{"source":42,"target":10,"type":"cites","value":3},{"source":42,"target":147,"type":"cites","value":3},{"source":10,"target":1,"type":"cites","value":3},{"source":42,"target":1,"type":"cites","value":3},{"source":42,"target":297,"type":"cites","value":4},{"source":42,"target":41,"type":"cites","value":4},{"source":395,"target":297,"type":"cites","value":3},{"source":395,"target":415,"type":"cites","value":7},{"source":395,"target":298,"type":"cites","value":7},{"source":395,"target":41,"type":"cites","value":8},{"source":471,"target":415,"type":"cites","value":3},{"source":471,"target":41,"type":"cites","value":5},{"source":395,"target":161,"type":"cites","value":9},{"source":395,"target":307,"type":"cites","value":3},{"source":471,"target":307,"type":"cites","value":3},{"source":395,"target":9,"type":"cites","value":12},{"source":471,"target":9,"type":"cites","value":10},{"source":472,"target":323,"type":"cites","value":4},{"source":472,"target":84,"type":"cites","value":4},{"source":395,"target":323,"type":"cites","value":5},{"source":395,"target":84,"type":"cites","value":9},{"source":473,"target":323,"type":"cites","value":3},{"source":473,"target":84,"type":"cites","value":3},{"source":474,"target":323,"type":"cites","value":4},{"source":474,"target":84,"type":"cites","value":4},{"source":471,"target":323,"type":"cites","value":4},{"source":471,"target":84,"type":"cites","value":5},{"source":176,"target":475,"type":"cites","value":3},{"source":176,"target":212,"type":"cites","value":6},{"source":209,"target":115,"type":"cites","value":3},{"source":307,"target":10,"type":"cites","value":3},{"source":9,"target":77,"type":"cites","value":4},{"source":307,"target":270,"type":"cites","value":3},{"source":307,"target":9,"type":"cites","value":5},{"source":9,"target":307,"type":"cites","value":10},{"source":476,"target":231,"type":"cites","value":3},{"source":220,"target":400,"type":"cites","value":6},{"source":220,"target":401,"type":"cites","value":6},{"source":42,"target":80,"type":"cites","value":4},{"source":426,"target":42,"type":"cites","value":3},{"source":326,"target":124,"type":"cites","value":9},{"source":379,"target":200,"type":"cites","value":3},{"source":380,"target":200,"type":"cites","value":3},{"source":477,"target":296,"type":"cites","value":3},{"source":477,"target":418,"type":"cites","value":3},{"source":477,"target":41,"type":"cites","value":3},{"source":478,"target":203,"type":"cites","value":3},{"source":477,"target":283,"type":"cites","value":6},{"source":477,"target":185,"type":"cites","value":7},{"source":477,"target":193,"type":"cites","value":4},{"source":222,"target":385,"type":"cites","value":7},{"source":222,"target":479,"type":"cites","value":6},{"source":222,"target":332,"type":"cites","value":5},{"source":222,"target":374,"type":"cites","value":4},{"source":222,"target":378,"type":"cites","value":3},{"source":264,"target":376,"type":"cites","value":7},{"source":376,"target":203,"type":"cites","value":5},{"source":264,"target":442,"type":"cites","value":10},{"source":264,"target":203,"type":"cites","value":18},{"source":383,"target":161,"type":"cites","value":3},{"source":382,"target":161,"type":"cites","value":4},{"source":381,"target":161,"type":"cites","value":3},{"source":383,"target":378,"type":"cites","value":6},{"source":382,"target":378,"type":"cites","value":7},{"source":382,"target":379,"type":"cites","value":3},{"source":381,"target":378,"type":"cites","value":5},{"source":383,"target":283,"type":"cites","value":7},{"source":382,"target":283,"type":"cites","value":12},{"source":381,"target":283,"type":"cites","value":10},{"source":480,"target":193,"type":"cites","value":4},{"source":480,"target":203,"type":"cites","value":3},{"source":481,"target":23,"type":"cites","value":3},{"source":481,"target":120,"type":"cites","value":3},{"source":380,"target":283,"type":"cites","value":10},{"source":380,"target":333,"type":"cites","value":7},{"source":380,"target":264,"type":"cites","value":6},{"source":482,"target":283,"type":"cites","value":8},{"source":482,"target":333,"type":"cites","value":3},{"source":482,"target":199,"type":"cites","value":4},{"source":283,"target":199,"type":"cites","value":8},{"source":283,"target":200,"type":"cites","value":3},{"source":483,"target":212,"type":"cites","value":5},{"source":395,"target":212,"type":"cites","value":3},{"source":483,"target":185,"type":"cites","value":3},{"source":395,"target":185,"type":"cites","value":3},{"source":483,"target":84,"type":"cites","value":3},{"source":483,"target":25,"type":"cites","value":3},{"source":483,"target":26,"type":"cites","value":3},{"source":483,"target":63,"type":"cites","value":4},{"source":483,"target":64,"type":"cites","value":4},{"source":395,"target":63,"type":"cites","value":5},{"source":483,"target":198,"type":"cites","value":3},{"source":483,"target":23,"type":"cites","value":6},{"source":483,"target":120,"type":"cites","value":6},{"source":484,"target":23,"type":"cites","value":3},{"source":484,"target":120,"type":"cites","value":3},{"source":483,"target":20,"type":"cites","value":4},{"source":395,"target":20,"type":"cites","value":11},{"source":483,"target":264,"type":"cites","value":3},{"source":483,"target":203,"type":"cites","value":4},{"source":395,"target":390,"type":"cites","value":3},{"source":395,"target":203,"type":"cites","value":4},{"source":427,"target":124,"type":"cites","value":10},{"source":485,"target":36,"type":"cites","value":3},{"source":486,"target":36,"type":"cites","value":3},{"source":20,"target":327,"type":"cites","value":5},{"source":9,"target":36,"type":"cites","value":3},{"source":487,"target":488,"type":"cites","value":11},{"source":488,"target":487,"type":"cites","value":11},{"source":489,"target":490,"type":"cites","value":3},{"source":489,"target":124,"type":"cites","value":6},{"source":491,"target":335,"type":"cites","value":3},{"source":491,"target":336,"type":"cites","value":3},{"source":491,"target":492,"type":"cites","value":3},{"source":300,"target":335,"type":"cites","value":3},{"source":300,"target":336,"type":"cites","value":3},{"source":300,"target":492,"type":"cites","value":3},{"source":491,"target":20,"type":"cites","value":6},{"source":493,"target":20,"type":"cites","value":6},{"source":231,"target":20,"type":"cites","value":4},{"source":300,"target":20,"type":"cites","value":6},{"source":493,"target":23,"type":"cites","value":5},{"source":491,"target":194,"type":"cites","value":5},{"source":493,"target":194,"type":"cites","value":4},{"source":231,"target":194,"type":"cites","value":3},{"source":300,"target":194,"type":"cites","value":5},{"source":341,"target":63,"type":"cites","value":4},{"source":341,"target":108,"type":"cites","value":3},{"source":341,"target":89,"type":"cites","value":3},{"source":376,"target":446,"type":"cites","value":4},{"source":376,"target":447,"type":"cites","value":3},{"source":376,"target":161,"type":"cites","value":4},{"source":494,"target":441,"type":"cites","value":3},{"source":494,"target":339,"type":"cites","value":7},{"source":80,"target":441,"type":"cites","value":4},{"source":80,"target":339,"type":"cites","value":8},{"source":494,"target":161,"type":"cites","value":7},{"source":494,"target":428,"type":"cites","value":5},{"source":494,"target":427,"type":"cites","value":4},{"source":494,"target":429,"type":"cites","value":4},{"source":495,"target":161,"type":"cites","value":3},{"source":80,"target":161,"type":"cites","value":8},{"source":80,"target":428,"type":"cites","value":5},{"source":80,"target":427,"type":"cites","value":5},{"source":80,"target":429,"type":"cites","value":4},{"source":374,"target":428,"type":"cites","value":3},{"source":374,"target":427,"type":"cites","value":4},{"source":496,"target":161,"type":"cites","value":4},{"source":292,"target":395,"type":"cites","value":5},{"source":497,"target":185,"type":"cites","value":3},{"source":66,"target":161,"type":"cites","value":7},{"source":66,"target":283,"type":"cites","value":4},{"source":274,"target":9,"type":"cites","value":10},{"source":274,"target":36,"type":"cites","value":3},{"source":498,"target":355,"type":"cites","value":3},{"source":498,"target":182,"type":"cites","value":4},{"source":498,"target":179,"type":"cites","value":3},{"source":498,"target":350,"type":"cites","value":4},{"source":499,"target":350,"type":"cites","value":5},{"source":499,"target":348,"type":"cites","value":3},{"source":350,"target":500,"type":"cites","value":3},{"source":185,"target":307,"type":"cites","value":3},{"source":185,"target":205,"type":"cites","value":3},{"source":185,"target":207,"type":"cites","value":3},{"source":185,"target":220,"type":"cites","value":4},{"source":290,"target":501,"type":"cites","value":5},{"source":290,"target":84,"type":"cites","value":6},{"source":290,"target":55,"type":"cites","value":4},{"source":502,"target":503,"type":"cites","value":3},{"source":502,"target":80,"type":"cites","value":3},{"source":133,"target":503,"type":"cites","value":3},{"source":395,"target":283,"type":"cites","value":3},{"source":471,"target":283,"type":"cites","value":3},{"source":504,"target":4,"type":"cites","value":4},{"source":441,"target":340,"type":"cites","value":3},{"source":441,"target":161,"type":"cites","value":3},{"source":505,"target":185,"type":"cites","value":3},{"source":463,"target":112,"type":"cites","value":6},{"source":506,"target":112,"type":"cites","value":7},{"source":133,"target":39,"type":"cites","value":3},{"source":463,"target":266,"type":"cites","value":4},{"source":463,"target":146,"type":"cites","value":3},{"source":506,"target":266,"type":"cites","value":5},{"source":506,"target":146,"type":"cites","value":3},{"source":231,"target":266,"type":"cites","value":10},{"source":133,"target":266,"type":"cites","value":7},{"source":133,"target":146,"type":"cites","value":3},{"source":463,"target":36,"type":"cites","value":4},{"source":506,"target":36,"type":"cites","value":5},{"source":231,"target":507,"type":"cites","value":3},{"source":133,"target":231,"type":"cites","value":3},{"source":196,"target":84,"type":"cites","value":4},{"source":470,"target":84,"type":"cites","value":3},{"source":508,"target":66,"type":"cites","value":3},{"source":509,"target":510,"type":"cites","value":4},{"source":509,"target":511,"type":"cites","value":3},{"source":509,"target":512,"type":"cites","value":3},{"source":509,"target":398,"type":"cites","value":6},{"source":510,"target":511,"type":"cites","value":5},{"source":510,"target":512,"type":"cites","value":5},{"source":510,"target":398,"type":"cites","value":9},{"source":398,"target":510,"type":"cites","value":3},{"source":513,"target":176,"type":"cites","value":5},{"source":513,"target":316,"type":"cites","value":4},{"source":513,"target":317,"type":"cites","value":4},{"source":513,"target":227,"type":"cites","value":18},{"source":513,"target":99,"type":"cites","value":28},{"source":514,"target":84,"type":"cites","value":3},{"source":515,"target":84,"type":"cites","value":3},{"source":516,"target":84,"type":"cites","value":3},{"source":274,"target":66,"type":"cites","value":4},{"source":274,"target":134,"type":"cites","value":3},{"source":274,"target":84,"type":"cites","value":3},{"source":274,"target":307,"type":"cites","value":3},{"source":471,"target":395,"type":"cites","value":24},{"source":274,"target":395,"type":"cites","value":8},{"source":274,"target":471,"type":"cites","value":3},{"source":395,"target":471,"type":"cites","value":8},{"source":517,"target":102,"type":"cites","value":3},{"source":518,"target":102,"type":"cites","value":3},{"source":517,"target":185,"type":"cites","value":3},{"source":518,"target":185,"type":"cites","value":4},{"source":134,"target":360,"type":"cites","value":4},{"source":274,"target":212,"type":"cites","value":3},{"source":519,"target":83,"type":"cites","value":3},{"source":307,"target":99,"type":"cites","value":9},{"source":112,"target":507,"type":"cites","value":3},{"source":112,"target":233,"type":"cites","value":3},{"source":266,"target":133,"type":"cites","value":3},{"source":112,"target":266,"type":"cites","value":9},{"source":112,"target":520,"type":"cites","value":3},{"source":112,"target":521,"type":"cites","value":3},{"source":522,"target":41,"type":"cites","value":6},{"source":523,"target":185,"type":"cites","value":5},{"source":84,"target":287,"type":"cites","value":4},{"source":524,"target":267,"type":"cites","value":3},{"source":524,"target":45,"type":"cites","value":3},{"source":45,"target":393,"type":"cites","value":3},{"source":45,"target":468,"type":"cites","value":5},{"source":446,"target":376,"type":"cites","value":3},{"source":426,"target":283,"type":"cites","value":8},{"source":222,"target":283,"type":"cites","value":9},{"source":222,"target":333,"type":"cites","value":3},{"source":42,"target":283,"type":"cites","value":11},{"source":426,"target":222,"type":"cites","value":14},{"source":42,"target":222,"type":"cites","value":8},{"source":222,"target":426,"type":"cites","value":12},{"source":222,"target":42,"type":"cites","value":8},{"source":525,"target":435,"type":"cites","value":4},{"source":526,"target":435,"type":"cites","value":4},{"source":525,"target":222,"type":"cites","value":3},{"source":525,"target":42,"type":"cites","value":4},{"source":526,"target":222,"type":"cites","value":4},{"source":526,"target":42,"type":"cites","value":6},{"source":283,"target":482,"type":"cites","value":12},{"source":283,"target":378,"type":"cites","value":4},{"source":527,"target":124,"type":"cites","value":4},{"source":341,"target":124,"type":"cites","value":12},{"source":528,"target":124,"type":"cites","value":4},{"source":395,"target":124,"type":"cites","value":5},{"source":527,"target":376,"type":"cites","value":5},{"source":527,"target":282,"type":"cites","value":4},{"source":527,"target":199,"type":"cites","value":5},{"source":529,"target":282,"type":"cites","value":4},{"source":529,"target":199,"type":"cites","value":5},{"source":530,"target":376,"type":"cites","value":3},{"source":530,"target":282,"type":"cites","value":4},{"source":530,"target":199,"type":"cites","value":4},{"source":528,"target":376,"type":"cites","value":4},{"source":528,"target":282,"type":"cites","value":12},{"source":528,"target":199,"type":"cites","value":22},{"source":395,"target":376,"type":"cites","value":4},{"source":395,"target":282,"type":"cites","value":9},{"source":395,"target":199,"type":"cites","value":19},{"source":395,"target":388,"type":"cites","value":4},{"source":395,"target":90,"type":"cites","value":4},{"source":395,"target":389,"type":"cites","value":4},{"source":527,"target":434,"type":"cites","value":3},{"source":527,"target":395,"type":"cites","value":15},{"source":530,"target":395,"type":"cites","value":7},{"source":341,"target":395,"type":"cites","value":3},{"source":528,"target":434,"type":"cites","value":24},{"source":528,"target":484,"type":"cites","value":4},{"source":528,"target":395,"type":"cites","value":35},{"source":528,"target":63,"type":"cites","value":4},{"source":395,"target":434,"type":"cites","value":13},{"source":395,"target":484,"type":"cites","value":5},{"source":527,"target":20,"type":"cites","value":4},{"source":529,"target":20,"type":"cites","value":3},{"source":341,"target":20,"type":"cites","value":5},{"source":528,"target":450,"type":"cites","value":3},{"source":528,"target":531,"type":"cites","value":3},{"source":528,"target":20,"type":"cites","value":7},{"source":395,"target":284,"type":"cites","value":3},{"source":528,"target":532,"type":"cites","value":5},{"source":395,"target":532,"type":"cites","value":4},{"source":528,"target":378,"type":"cites","value":3},{"source":395,"target":378,"type":"cites","value":4},{"source":527,"target":435,"type":"cites","value":3},{"source":442,"target":254,"type":"cites","value":3},{"source":390,"target":222,"type":"cites","value":5},{"source":390,"target":36,"type":"cites","value":6},{"source":390,"target":340,"type":"cites","value":6},{"source":135,"target":283,"type":"cites","value":7},{"source":135,"target":222,"type":"cites","value":3},{"source":533,"target":161,"type":"cites","value":3},{"source":260,"target":374,"type":"cites","value":3},{"source":260,"target":161,"type":"cites","value":10},{"source":534,"target":161,"type":"cites","value":3},{"source":260,"target":283,"type":"cites","value":10},{"source":260,"target":333,"type":"cites","value":7},{"source":260,"target":535,"type":"cites","value":3},{"source":260,"target":341,"type":"cites","value":4},{"source":260,"target":291,"type":"cites","value":4},{"source":260,"target":193,"type":"cites","value":3},{"source":260,"target":192,"type":"cites","value":6},{"source":451,"target":161,"type":"cites","value":8},{"source":340,"target":282,"type":"cites","value":4},{"source":340,"target":199,"type":"cites","value":6},{"source":427,"target":204,"type":"cites","value":3},{"source":161,"target":340,"type":"cites","value":4},{"source":427,"target":341,"type":"cites","value":3},{"source":471,"target":199,"type":"cites","value":5},{"source":536,"target":282,"type":"cites","value":4},{"source":536,"target":199,"type":"cites","value":7},{"source":434,"target":199,"type":"cites","value":6},{"source":528,"target":9,"type":"cites","value":15},{"source":434,"target":9,"type":"cites","value":4},{"source":471,"target":20,"type":"cites","value":4},{"source":471,"target":537,"type":"cites","value":4},{"source":434,"target":20,"type":"cites","value":4},{"source":538,"target":20,"type":"cites","value":3},{"source":41,"target":203,"type":"cites","value":3},{"source":41,"target":222,"type":"cites","value":4},{"source":382,"target":381,"type":"cites","value":26},{"source":381,"target":382,"type":"cites","value":24},{"source":383,"target":381,"type":"cites","value":16},{"source":383,"target":382,"type":"cites","value":21},{"source":381,"target":333,"type":"cites","value":3},{"source":382,"target":383,"type":"cites","value":21},{"source":381,"target":383,"type":"cites","value":13},{"source":332,"target":282,"type":"cites","value":4},{"source":332,"target":199,"type":"cites","value":6},{"source":340,"target":333,"type":"cites","value":4},{"source":332,"target":333,"type":"cites","value":3},{"source":254,"target":395,"type":"cites","value":3},{"source":539,"target":199,"type":"cites","value":5},{"source":539,"target":161,"type":"cites","value":7},{"source":539,"target":36,"type":"cites","value":4},{"source":329,"target":332,"type":"cites","value":8},{"source":329,"target":203,"type":"cites","value":4},{"source":332,"target":376,"type":"cites","value":3},{"source":332,"target":264,"type":"cites","value":8},{"source":329,"target":264,"type":"cites","value":3},{"source":332,"target":329,"type":"cites","value":4},{"source":332,"target":331,"type":"cites","value":3},{"source":329,"target":384,"type":"cites","value":3},{"source":329,"target":438,"type":"cites","value":3},{"source":329,"target":433,"type":"cites","value":3},{"source":540,"target":264,"type":"cites","value":6},{"source":540,"target":283,"type":"cites","value":8},{"source":379,"target":192,"type":"cites","value":3},{"source":540,"target":192,"type":"cites","value":7},{"source":540,"target":193,"type":"cites","value":5},{"source":77,"target":23,"type":"cites","value":5},{"source":260,"target":198,"type":"cites","value":3},{"source":77,"target":120,"type":"cites","value":3},{"source":541,"target":161,"type":"cites","value":4},{"source":542,"target":543,"type":"cites","value":3},{"source":542,"target":544,"type":"cites","value":4},{"source":542,"target":545,"type":"cites","value":4},{"source":542,"target":546,"type":"cites","value":3},{"source":542,"target":547,"type":"cites","value":3},{"source":231,"target":544,"type":"cites","value":3},{"source":231,"target":545,"type":"cites","value":3},{"source":491,"target":493,"type":"cites","value":4},{"source":491,"target":231,"type":"cites","value":4},{"source":491,"target":300,"type":"cites","value":4},{"source":542,"target":231,"type":"cites","value":5},{"source":300,"target":491,"type":"cites","value":4},{"source":300,"target":493,"type":"cites","value":4},{"source":300,"target":231,"type":"cites","value":4},{"source":548,"target":549,"type":"cites","value":13},{"source":549,"target":548,"type":"cites","value":7},{"source":548,"target":222,"type":"cites","value":3},{"source":9,"target":550,"type":"cites","value":3},{"source":487,"target":36,"type":"cites","value":4},{"source":488,"target":36,"type":"cites","value":4},{"source":551,"target":283,"type":"cites","value":5},{"source":551,"target":333,"type":"cites","value":3},{"source":552,"target":283,"type":"cites","value":4},{"source":260,"target":380,"type":"cites","value":3},{"source":380,"target":199,"type":"cites","value":3},{"source":553,"target":291,"type":"cites","value":3},{"source":427,"target":326,"type":"cites","value":5},{"source":554,"target":282,"type":"cites","value":3},{"source":554,"target":199,"type":"cites","value":6},{"source":555,"target":282,"type":"cites","value":5},{"source":555,"target":199,"type":"cites","value":10},{"source":556,"target":282,"type":"cites","value":3},{"source":556,"target":199,"type":"cites","value":6},{"source":528,"target":339,"type":"cites","value":8},{"source":528,"target":557,"type":"cites","value":5},{"source":528,"target":162,"type":"cites","value":3},{"source":558,"target":161,"type":"cites","value":7},{"source":558,"target":428,"type":"cites","value":5},{"source":558,"target":427,"type":"cites","value":3},{"source":293,"target":428,"type":"cites","value":6},{"source":293,"target":427,"type":"cites","value":4},{"source":293,"target":429,"type":"cites","value":3},{"source":558,"target":293,"type":"cites","value":4},{"source":293,"target":559,"type":"cites","value":11},{"source":293,"target":89,"type":"cites","value":3},{"source":494,"target":495,"type":"cites","value":8},{"source":494,"target":80,"type":"cites","value":9},{"source":80,"target":494,"type":"cites","value":8},{"source":80,"target":495,"type":"cites","value":8},{"source":494,"target":91,"type":"cites","value":3},{"source":494,"target":89,"type":"cites","value":3},{"source":494,"target":92,"type":"cites","value":3},{"source":494,"target":93,"type":"cites","value":3},{"source":494,"target":94,"type":"cites","value":3},{"source":494,"target":95,"type":"cites","value":3},{"source":494,"target":96,"type":"cites","value":3},{"source":80,"target":91,"type":"cites","value":3},{"source":80,"target":89,"type":"cites","value":3},{"source":80,"target":92,"type":"cites","value":3},{"source":80,"target":93,"type":"cites","value":3},{"source":80,"target":94,"type":"cites","value":3},{"source":80,"target":95,"type":"cites","value":3},{"source":80,"target":96,"type":"cites","value":3},{"source":494,"target":548,"type":"cites","value":3},{"source":494,"target":549,"type":"cites","value":3},{"source":80,"target":548,"type":"cites","value":3},{"source":80,"target":549,"type":"cites","value":3},{"source":440,"target":283,"type":"cites","value":3},{"source":440,"target":291,"type":"cites","value":7},{"source":441,"target":341,"type":"cites","value":3},{"source":441,"target":440,"type":"cites","value":3},{"source":440,"target":161,"type":"cites","value":4},{"source":560,"target":161,"type":"cites","value":5},{"source":451,"target":427,"type":"cites","value":3},{"source":561,"target":427,"type":"cites","value":3},{"source":45,"target":405,"type":"cites","value":8},{"source":45,"target":320,"type":"cites","value":4},{"source":45,"target":143,"type":"cites","value":10},{"source":45,"target":236,"type":"cites","value":6},{"source":45,"target":39,"type":"cites","value":3},{"source":166,"target":405,"type":"cites","value":3},{"source":166,"target":36,"type":"cites","value":3},{"source":166,"target":45,"type":"cites","value":4},{"source":562,"target":233,"type":"cites","value":3},{"source":562,"target":231,"type":"cites","value":4},{"source":562,"target":55,"type":"cites","value":3},{"source":273,"target":146,"type":"cites","value":3},{"source":273,"target":143,"type":"cites","value":3},{"source":562,"target":39,"type":"cites","value":3},{"source":563,"target":71,"type":"cites","value":5},{"source":176,"target":72,"type":"cites","value":3},{"source":563,"target":165,"type":"cites","value":3},{"source":563,"target":212,"type":"cites","value":5},{"source":212,"target":77,"type":"cites","value":4},{"source":176,"target":409,"type":"cites","value":3},{"source":542,"target":212,"type":"cites","value":3},{"source":231,"target":212,"type":"cites","value":4},{"source":77,"target":9,"type":"cites","value":4},{"source":564,"target":84,"type":"cites","value":5},{"source":565,"target":84,"type":"cites","value":3},{"source":566,"target":84,"type":"cites","value":3},{"source":84,"target":290,"type":"cites","value":3},{"source":220,"target":567,"type":"cites","value":3},{"source":220,"target":568,"type":"cites","value":3},{"source":220,"target":569,"type":"cites","value":3},{"source":220,"target":290,"type":"cites","value":5},{"source":380,"target":501,"type":"cites","value":3},{"source":380,"target":374,"type":"cites","value":4},{"source":570,"target":84,"type":"cites","value":3},{"source":42,"target":9,"type":"cites","value":3},{"source":42,"target":133,"type":"cites","value":6},{"source":231,"target":271,"type":"cites","value":3},{"source":133,"target":271,"type":"cites","value":4},{"source":231,"target":133,"type":"cites","value":3},{"source":133,"target":506,"type":"cites","value":3},{"source":571,"target":350,"type":"cites","value":3},{"source":572,"target":350,"type":"cites","value":3},{"source":323,"target":166,"type":"cites","value":4},{"source":323,"target":161,"type":"cites","value":3},{"source":77,"target":161,"type":"cites","value":4},{"source":77,"target":36,"type":"cites","value":5},{"source":77,"target":117,"type":"cites","value":3},{"source":483,"target":395,"type":"cites","value":16},{"source":573,"target":483,"type":"cites","value":3},{"source":573,"target":84,"type":"cites","value":4},{"source":573,"target":245,"type":"cites","value":3},{"source":574,"target":9,"type":"cites","value":3},{"source":575,"target":9,"type":"cites","value":3},{"source":392,"target":9,"type":"cites","value":3},{"source":233,"target":266,"type":"cites","value":3},{"source":425,"target":135,"type":"cites","value":4},{"source":425,"target":360,"type":"cites","value":5},{"source":425,"target":232,"type":"cites","value":3},{"source":576,"target":13,"type":"cites","value":6},{"source":398,"target":13,"type":"cites","value":6},{"source":13,"target":272,"type":"cites","value":3},{"source":576,"target":398,"type":"cites","value":4},{"source":13,"target":398,"type":"cites","value":5},{"source":522,"target":263,"type":"cites","value":5},{"source":522,"target":387,"type":"cites","value":3},{"source":54,"target":522,"type":"cites","value":3},{"source":577,"target":54,"type":"cites","value":4},{"source":9,"target":37,"type":"cites","value":5},{"source":578,"target":99,"type":"cites","value":4},{"source":227,"target":579,"type":"cites","value":3},{"source":227,"target":580,"type":"cites","value":3},{"source":99,"target":579,"type":"cites","value":4},{"source":99,"target":580,"type":"cites","value":4},{"source":10,"target":99,"type":"cites","value":4},{"source":423,"target":84,"type":"cites","value":9},{"source":9,"target":323,"type":"cites","value":4},{"source":523,"target":196,"type":"cites","value":4},{"source":523,"target":84,"type":"cites","value":11},{"source":518,"target":84,"type":"cites","value":6},{"source":581,"target":84,"type":"cites","value":8},{"source":517,"target":84,"type":"cites","value":6},{"source":582,"target":84,"type":"cites","value":5},{"source":84,"target":196,"type":"cites","value":8},{"source":523,"target":253,"type":"cites","value":3},{"source":518,"target":253,"type":"cites","value":3},{"source":581,"target":253,"type":"cites","value":3},{"source":517,"target":253,"type":"cites","value":3},{"source":582,"target":253,"type":"cites","value":3},{"source":84,"target":253,"type":"cites","value":3},{"source":523,"target":518,"type":"cites","value":7},{"source":518,"target":523,"type":"cites","value":3},{"source":581,"target":518,"type":"cites","value":5},{"source":581,"target":523,"type":"cites","value":5},{"source":517,"target":518,"type":"cites","value":3},{"source":517,"target":523,"type":"cites","value":3},{"source":84,"target":518,"type":"cites","value":6},{"source":84,"target":523,"type":"cites","value":6},{"source":84,"target":470,"type":"cites","value":5},{"source":84,"target":283,"type":"cites","value":3},{"source":437,"target":283,"type":"cites","value":3},{"source":203,"target":482,"type":"cites","value":5},{"source":538,"target":185,"type":"cites","value":3},{"source":583,"target":161,"type":"cites","value":4},{"source":584,"target":283,"type":"cites","value":11},{"source":583,"target":283,"type":"cites","value":4},{"source":583,"target":222,"type":"cites","value":3},{"source":585,"target":193,"type":"cites","value":4},{"source":586,"target":193,"type":"cites","value":3},{"source":587,"target":23,"type":"cites","value":5},{"source":185,"target":518,"type":"cites","value":3},{"source":185,"target":523,"type":"cites","value":3},{"source":185,"target":9,"type":"cites","value":3},{"source":185,"target":222,"type":"cites","value":3},{"source":588,"target":283,"type":"cites","value":3},{"source":36,"target":283,"type":"cites","value":3},{"source":171,"target":487,"type":"cites","value":6},{"source":171,"target":488,"type":"cites","value":6},{"source":487,"target":589,"type":"cites","value":3},{"source":487,"target":590,"type":"cites","value":3},{"source":488,"target":589,"type":"cites","value":3},{"source":488,"target":590,"type":"cites","value":3},{"source":487,"target":591,"type":"cites","value":3},{"source":487,"target":592,"type":"cites","value":3},{"source":487,"target":307,"type":"cites","value":3},{"source":487,"target":9,"type":"cites","value":3},{"source":488,"target":591,"type":"cites","value":3},{"source":488,"target":592,"type":"cites","value":3},{"source":488,"target":307,"type":"cites","value":3},{"source":488,"target":9,"type":"cites","value":3},{"source":526,"target":525,"type":"cites","value":11},{"source":526,"target":593,"type":"cites","value":5},{"source":526,"target":594,"type":"cites","value":3},{"source":526,"target":116,"type":"cites","value":7},{"source":525,"target":526,"type":"cites","value":8},{"source":525,"target":593,"type":"cites","value":4},{"source":525,"target":116,"type":"cites","value":7},{"source":116,"target":525,"type":"cites","value":3},{"source":116,"target":526,"type":"cites","value":3},{"source":526,"target":376,"type":"cites","value":5},{"source":526,"target":264,"type":"cites","value":3},{"source":525,"target":376,"type":"cites","value":6},{"source":525,"target":264,"type":"cites","value":4},{"source":116,"target":376,"type":"cites","value":4},{"source":526,"target":124,"type":"cites","value":4},{"source":526,"target":595,"type":"cites","value":3},{"source":525,"target":124,"type":"cites","value":4},{"source":525,"target":595,"type":"cites","value":3},{"source":596,"target":283,"type":"cites","value":3},{"source":395,"target":483,"type":"cites","value":6},{"source":527,"target":203,"type":"cites","value":3},{"source":395,"target":332,"type":"cites","value":6},{"source":395,"target":382,"type":"cites","value":3},{"source":42,"target":84,"type":"cites","value":10},{"source":42,"target":161,"type":"cites","value":4},{"source":42,"target":135,"type":"cites","value":3},{"source":212,"target":597,"type":"cites","value":3},{"source":212,"target":598,"type":"cites","value":9},{"source":599,"target":222,"type":"cites","value":3},{"source":600,"target":222,"type":"cites","value":10},{"source":383,"target":441,"type":"cites","value":3},{"source":382,"target":441,"type":"cites","value":3},{"source":381,"target":441,"type":"cites","value":4},{"source":381,"target":339,"type":"cites","value":3},{"source":36,"target":161,"type":"cites","value":3},{"source":36,"target":264,"type":"cites","value":3},{"source":36,"target":390,"type":"cites","value":3},{"source":36,"target":203,"type":"cites","value":5},{"source":601,"target":254,"type":"cites","value":3},{"source":602,"target":263,"type":"cites","value":3},{"source":602,"target":41,"type":"cites","value":3},{"source":602,"target":522,"type":"cites","value":4},{"source":480,"target":603,"type":"cites","value":5},{"source":480,"target":387,"type":"cites","value":3},{"source":480,"target":604,"type":"cites","value":3},{"source":480,"target":129,"type":"cites","value":9},{"source":129,"target":603,"type":"cites","value":5},{"source":129,"target":480,"type":"cites","value":5},{"source":129,"target":387,"type":"cites","value":4},{"source":480,"target":435,"type":"cites","value":3},{"source":480,"target":605,"type":"cites","value":3},{"source":480,"target":606,"type":"cites","value":3},{"source":480,"target":607,"type":"cites","value":3},{"source":480,"target":608,"type":"cites","value":3},{"source":212,"target":9,"type":"cites","value":5},{"source":598,"target":212,"type":"cites","value":6},{"source":212,"target":497,"type":"cites","value":4},{"source":588,"target":199,"type":"cites","value":5},{"source":588,"target":20,"type":"cites","value":3},{"source":588,"target":223,"type":"cites","value":3},{"source":588,"target":23,"type":"cites","value":7},{"source":588,"target":120,"type":"cites","value":6},{"source":588,"target":198,"type":"cites","value":4},{"source":588,"target":336,"type":"cites","value":3},{"source":609,"target":203,"type":"cites","value":3},{"source":609,"target":382,"type":"cites","value":3},{"source":609,"target":381,"type":"cites","value":3},{"source":609,"target":222,"type":"cites","value":7},{"source":434,"target":528,"type":"cites","value":13},{"source":434,"target":555,"type":"cites","value":4},{"source":528,"target":554,"type":"cites","value":6},{"source":528,"target":536,"type":"cites","value":12},{"source":528,"target":555,"type":"cites","value":18},{"source":528,"target":556,"type":"cites","value":6},{"source":528,"target":291,"type":"cites","value":7},{"source":610,"target":528,"type":"cites","value":6},{"source":610,"target":555,"type":"cites","value":4},{"source":395,"target":554,"type":"cites","value":6},{"source":395,"target":536,"type":"cites","value":6},{"source":395,"target":528,"type":"cites","value":22},{"source":395,"target":555,"type":"cites","value":10},{"source":395,"target":556,"type":"cites","value":4},{"source":395,"target":291,"type":"cites","value":4},{"source":610,"target":199,"type":"cites","value":8},{"source":611,"target":199,"type":"cites","value":3},{"source":612,"target":199,"type":"cites","value":3},{"source":613,"target":199,"type":"cites","value":3},{"source":395,"target":557,"type":"cites","value":6},{"source":528,"target":446,"type":"cites","value":7},{"source":528,"target":614,"type":"cites","value":7},{"source":528,"target":447,"type":"cites","value":7},{"source":528,"target":264,"type":"cites","value":10},{"source":610,"target":264,"type":"cites","value":3},{"source":395,"target":446,"type":"cites","value":7},{"source":395,"target":614,"type":"cites","value":5},{"source":395,"target":447,"type":"cites","value":5},{"source":395,"target":379,"type":"cites","value":5},{"source":615,"target":161,"type":"cites","value":4},{"source":616,"target":161,"type":"cites","value":4},{"source":615,"target":395,"type":"cites","value":5},{"source":616,"target":395,"type":"cites","value":5},{"source":525,"target":254,"type":"cites","value":3},{"source":526,"target":254,"type":"cites","value":4},{"source":525,"target":332,"type":"cites","value":4},{"source":617,"target":283,"type":"cites","value":5},{"source":264,"target":482,"type":"cites","value":5},{"source":264,"target":294,"type":"cites","value":4},{"source":332,"target":161,"type":"cites","value":6},{"source":617,"target":260,"type":"cites","value":3},{"source":264,"target":533,"type":"cites","value":4},{"source":264,"target":260,"type":"cites","value":5},{"source":264,"target":534,"type":"cites","value":4},{"source":332,"target":260,"type":"cites","value":4},{"source":584,"target":199,"type":"cites","value":3},{"source":618,"target":161,"type":"cites","value":11},{"source":618,"target":428,"type":"cites","value":3},{"source":618,"target":427,"type":"cites","value":6},{"source":373,"target":427,"type":"cites","value":6},{"source":618,"target":374,"type":"cites","value":3},{"source":618,"target":373,"type":"cites","value":6},{"source":618,"target":327,"type":"cites","value":5},{"source":618,"target":454,"type":"cites","value":4},{"source":161,"target":222,"type":"cites","value":3},{"source":619,"target":292,"type":"cites","value":3},{"source":292,"target":619,"type":"cites","value":3},{"source":161,"target":326,"type":"cites","value":4},{"source":427,"target":203,"type":"cites","value":3},{"source":161,"target":332,"type":"cites","value":7},{"source":620,"target":283,"type":"cites","value":4},{"source":203,"target":333,"type":"cites","value":3},{"source":203,"target":437,"type":"cites","value":3},{"source":203,"target":442,"type":"cites","value":7},{"source":487,"target":480,"type":"cites","value":4},{"source":488,"target":480,"type":"cites","value":4},{"source":395,"target":589,"type":"cites","value":3},{"source":395,"target":590,"type":"cites","value":3},{"source":395,"target":487,"type":"cites","value":13},{"source":395,"target":488,"type":"cites","value":13},{"source":621,"target":487,"type":"cites","value":4},{"source":621,"target":488,"type":"cites","value":4},{"source":66,"target":192,"type":"cites","value":3},{"source":622,"target":36,"type":"cites","value":3},{"source":622,"target":623,"type":"cites","value":3},{"source":448,"target":36,"type":"cites","value":3},{"source":448,"target":623,"type":"cites","value":3},{"source":66,"target":623,"type":"cites","value":3},{"source":622,"target":161,"type":"cites","value":4},{"source":622,"target":427,"type":"cites","value":3},{"source":448,"target":161,"type":"cites","value":3},{"source":66,"target":427,"type":"cites","value":3},{"source":440,"target":528,"type":"cites","value":7},{"source":440,"target":555,"type":"cites","value":5},{"source":560,"target":528,"type":"cites","value":7},{"source":560,"target":555,"type":"cites","value":5},{"source":560,"target":291,"type":"cites","value":5},{"source":339,"target":528,"type":"cites","value":7},{"source":339,"target":555,"type":"cites","value":5},{"source":339,"target":291,"type":"cites","value":6},{"source":560,"target":388,"type":"cites","value":3},{"source":560,"target":90,"type":"cites","value":3},{"source":560,"target":389,"type":"cites","value":3},{"source":560,"target":441,"type":"cites","value":4},{"source":560,"target":339,"type":"cites","value":8},{"source":560,"target":20,"type":"cites","value":3},{"source":440,"target":20,"type":"cites","value":4},{"source":560,"target":440,"type":"cites","value":6},{"source":339,"target":440,"type":"cites","value":7},{"source":624,"target":99,"type":"cites","value":3},{"source":625,"target":310,"type":"cites","value":7},{"source":625,"target":227,"type":"cites","value":6},{"source":625,"target":1,"type":"cites","value":5},{"source":625,"target":99,"type":"cites","value":11},{"source":626,"target":45,"type":"cites","value":3},{"source":627,"target":219,"type":"cites","value":3},{"source":627,"target":35,"type":"cites","value":4},{"source":628,"target":219,"type":"cites","value":3},{"source":628,"target":35,"type":"cites","value":4},{"source":562,"target":219,"type":"cites","value":3},{"source":562,"target":35,"type":"cites","value":4},{"source":629,"target":219,"type":"cites","value":3},{"source":629,"target":35,"type":"cites","value":4},{"source":630,"target":219,"type":"cites","value":3},{"source":630,"target":35,"type":"cites","value":4},{"source":226,"target":219,"type":"cites","value":3},{"source":631,"target":219,"type":"cites","value":5},{"source":631,"target":35,"type":"cites","value":6},{"source":632,"target":510,"type":"cites","value":5},{"source":632,"target":511,"type":"cites","value":3},{"source":632,"target":512,"type":"cites","value":3},{"source":632,"target":398,"type":"cites","value":7},{"source":632,"target":509,"type":"cites","value":3},{"source":510,"target":509,"type":"cites","value":4},{"source":633,"target":227,"type":"cites","value":3},{"source":634,"target":227,"type":"cites","value":4},{"source":634,"target":99,"type":"cites","value":5},{"source":576,"target":115,"type":"cites","value":4},{"source":576,"target":84,"type":"cites","value":4},{"source":635,"target":135,"type":"cites","value":4},{"source":636,"target":135,"type":"cites","value":4},{"source":635,"target":70,"type":"cites","value":3},{"source":636,"target":70,"type":"cites","value":3},{"source":635,"target":68,"type":"cites","value":4},{"source":636,"target":68,"type":"cites","value":4},{"source":637,"target":99,"type":"cites","value":3},{"source":638,"target":212,"type":"cites","value":4},{"source":212,"target":20,"type":"cites","value":4},{"source":639,"target":640,"type":"cites","value":3},{"source":151,"target":640,"type":"cites","value":5},{"source":641,"target":166,"type":"cites","value":4},{"source":642,"target":166,"type":"cites","value":4},{"source":643,"target":166,"type":"cites","value":4},{"source":644,"target":166,"type":"cites","value":4},{"source":166,"target":212,"type":"cites","value":3},{"source":392,"target":465,"type":"cites","value":4},{"source":645,"target":42,"type":"cites","value":4},{"source":645,"target":13,"type":"cites","value":6},{"source":645,"target":133,"type":"cites","value":4},{"source":564,"target":220,"type":"cites","value":3},{"source":220,"target":564,"type":"cites","value":4},{"source":220,"target":565,"type":"cites","value":4},{"source":220,"target":566,"type":"cites","value":4},{"source":84,"target":41,"type":"cites","value":6},{"source":646,"target":209,"type":"cites","value":4},{"source":577,"target":471,"type":"cites","value":3},{"source":577,"target":395,"type":"cites","value":3},{"source":647,"target":471,"type":"cites","value":3},{"source":647,"target":395,"type":"cites","value":3},{"source":54,"target":471,"type":"cites","value":4},{"source":54,"target":395,"type":"cites","value":5},{"source":54,"target":307,"type":"cites","value":3},{"source":54,"target":9,"type":"cites","value":3},{"source":54,"target":274,"type":"cites","value":4},{"source":647,"target":54,"type":"cites","value":3},{"source":648,"target":380,"type":"cites","value":3},{"source":392,"target":649,"type":"cites","value":3},{"source":392,"target":575,"type":"cites","value":4},{"source":392,"target":650,"type":"cites","value":4},{"source":523,"target":581,"type":"cites","value":6},{"source":523,"target":517,"type":"cites","value":6},{"source":523,"target":582,"type":"cites","value":6},{"source":581,"target":517,"type":"cites","value":4},{"source":581,"target":582,"type":"cites","value":4},{"source":651,"target":84,"type":"cites","value":3},{"source":84,"target":581,"type":"cites","value":5},{"source":84,"target":517,"type":"cites","value":5},{"source":84,"target":582,"type":"cites","value":5},{"source":84,"target":297,"type":"cites","value":3},{"source":84,"target":298,"type":"cites","value":3},{"source":84,"target":423,"type":"cites","value":7},{"source":652,"target":77,"type":"cites","value":3},{"source":653,"target":405,"type":"cites","value":4},{"source":111,"target":405,"type":"cites","value":4},{"source":654,"target":99,"type":"cites","value":3},{"source":209,"target":567,"type":"cites","value":3},{"source":209,"target":568,"type":"cites","value":3},{"source":209,"target":569,"type":"cites","value":3},{"source":209,"target":290,"type":"cites","value":4},{"source":655,"target":564,"type":"cites","value":3},{"source":655,"target":400,"type":"cites","value":3},{"source":655,"target":401,"type":"cites","value":3},{"source":655,"target":565,"type":"cites","value":3},{"source":655,"target":84,"type":"cites","value":3},{"source":655,"target":566,"type":"cites","value":3},{"source":655,"target":220,"type":"cites","value":3},{"source":656,"target":564,"type":"cites","value":5},{"source":656,"target":400,"type":"cites","value":4},{"source":656,"target":401,"type":"cites","value":4},{"source":656,"target":565,"type":"cites","value":4},{"source":656,"target":84,"type":"cites","value":4},{"source":656,"target":566,"type":"cites","value":4},{"source":656,"target":220,"type":"cites","value":6},{"source":209,"target":564,"type":"cites","value":11},{"source":209,"target":400,"type":"cites","value":10},{"source":209,"target":401,"type":"cites","value":10},{"source":209,"target":565,"type":"cites","value":8},{"source":209,"target":84,"type":"cites","value":15},{"source":209,"target":566,"type":"cites","value":8},{"source":209,"target":220,"type":"cites","value":15},{"source":307,"target":1,"type":"cites","value":4},{"source":307,"target":310,"type":"cites","value":4},{"source":98,"target":310,"type":"cites","value":5},{"source":307,"target":227,"type":"cites","value":7},{"source":98,"target":227,"type":"cites","value":9},{"source":657,"target":45,"type":"cites","value":3},{"source":657,"target":267,"type":"cites","value":3},{"source":658,"target":77,"type":"cites","value":3},{"source":77,"target":323,"type":"cites","value":6},{"source":266,"target":227,"type":"cites","value":3},{"source":323,"target":297,"type":"cites","value":5},{"source":323,"target":41,"type":"cites","value":4},{"source":659,"target":143,"type":"cites","value":3},{"source":660,"target":143,"type":"cites","value":3},{"source":661,"target":143,"type":"cites","value":3},{"source":662,"target":143,"type":"cites","value":3},{"source":659,"target":231,"type":"cites","value":3},{"source":660,"target":231,"type":"cites","value":3},{"source":661,"target":231,"type":"cites","value":3},{"source":662,"target":231,"type":"cites","value":3},{"source":659,"target":266,"type":"cites","value":3},{"source":660,"target":266,"type":"cites","value":3},{"source":661,"target":266,"type":"cites","value":3},{"source":662,"target":266,"type":"cites","value":3},{"source":573,"target":323,"type":"cites","value":5},{"source":483,"target":323,"type":"cites","value":3},{"source":573,"target":9,"type":"cites","value":6},{"source":483,"target":9,"type":"cites","value":3},{"source":483,"target":66,"type":"cites","value":3},{"source":442,"target":332,"type":"cites","value":5},{"source":442,"target":264,"type":"cites","value":6},{"source":340,"target":380,"type":"cites","value":5},{"source":340,"target":264,"type":"cites","value":4},{"source":332,"target":380,"type":"cites","value":5},{"source":380,"target":539,"type":"cites","value":4},{"source":340,"target":332,"type":"cites","value":3},{"source":380,"target":332,"type":"cites","value":3},{"source":380,"target":203,"type":"cites","value":9},{"source":264,"target":332,"type":"cites","value":6},{"source":663,"target":203,"type":"cites","value":3},{"source":664,"target":203,"type":"cites","value":3},{"source":9,"target":434,"type":"cites","value":3},{"source":9,"target":395,"type":"cites","value":5},{"source":539,"target":222,"type":"cites","value":28},{"source":539,"target":441,"type":"cites","value":7},{"source":222,"target":339,"type":"cites","value":4},{"source":426,"target":539,"type":"cites","value":5},{"source":222,"target":539,"type":"cites","value":10},{"source":539,"target":326,"type":"cites","value":4},{"source":539,"target":382,"type":"cites","value":3},{"source":426,"target":381,"type":"cites","value":6},{"source":426,"target":382,"type":"cites","value":11},{"source":426,"target":383,"type":"cites","value":6},{"source":222,"target":381,"type":"cites","value":3},{"source":222,"target":382,"type":"cites","value":7},{"source":222,"target":383,"type":"cites","value":3},{"source":222,"target":665,"type":"cites","value":5},{"source":222,"target":666,"type":"cites","value":3},{"source":222,"target":667,"type":"cites","value":3},{"source":222,"target":668,"type":"cites","value":3},{"source":539,"target":42,"type":"cites","value":3},{"source":539,"target":426,"type":"cites","value":6},{"source":426,"target":669,"type":"cites","value":4},{"source":222,"target":669,"type":"cites","value":3},{"source":670,"target":161,"type":"cites","value":4},{"source":671,"target":161,"type":"cites","value":4},{"source":135,"target":161,"type":"cites","value":5},{"source":670,"target":283,"type":"cites","value":3},{"source":451,"target":283,"type":"cites","value":4},{"source":671,"target":283,"type":"cites","value":3},{"source":437,"target":23,"type":"cites","value":3},{"source":437,"target":120,"type":"cites","value":3},{"source":437,"target":380,"type":"cites","value":4},{"source":290,"target":380,"type":"cites","value":10},{"source":203,"target":380,"type":"cites","value":3},{"source":341,"target":489,"type":"cites","value":3},{"source":599,"target":376,"type":"cites","value":3},{"source":599,"target":264,"type":"cites","value":3},{"source":600,"target":200,"type":"cites","value":3},{"source":483,"target":340,"type":"cites","value":3},{"source":284,"target":200,"type":"cites","value":3},{"source":672,"target":395,"type":"cites","value":3},{"source":284,"target":330,"type":"cites","value":6},{"source":437,"target":442,"type":"cites","value":8},{"source":380,"target":437,"type":"cites","value":3},{"source":673,"target":528,"type":"cites","value":9},{"source":673,"target":555,"type":"cites","value":3},{"source":274,"target":528,"type":"cites","value":8},{"source":274,"target":555,"type":"cites","value":3},{"source":610,"target":20,"type":"cites","value":3},{"source":673,"target":20,"type":"cites","value":5},{"source":274,"target":20,"type":"cites","value":12},{"source":274,"target":292,"type":"cites","value":4},{"source":274,"target":588,"type":"cites","value":4},{"source":610,"target":9,"type":"cites","value":3},{"source":673,"target":264,"type":"cites","value":3},{"source":434,"target":124,"type":"cites","value":3},{"source":673,"target":204,"type":"cites","value":4},{"source":673,"target":124,"type":"cites","value":6},{"source":673,"target":36,"type":"cites","value":3},{"source":434,"target":340,"type":"cites","value":6},{"source":434,"target":332,"type":"cites","value":4},{"source":528,"target":340,"type":"cites","value":3},{"source":528,"target":332,"type":"cites","value":3},{"source":395,"target":340,"type":"cites","value":9},{"source":610,"target":395,"type":"cites","value":3},{"source":434,"target":610,"type":"cites","value":3},{"source":434,"target":395,"type":"cites","value":8},{"source":528,"target":610,"type":"cites","value":15},{"source":528,"target":611,"type":"cites","value":11},{"source":528,"target":612,"type":"cites","value":11},{"source":528,"target":613,"type":"cites","value":11},{"source":673,"target":395,"type":"cites","value":5},{"source":274,"target":434,"type":"cites","value":3},{"source":395,"target":610,"type":"cites","value":9},{"source":395,"target":611,"type":"cites","value":6},{"source":395,"target":612,"type":"cites","value":5},{"source":395,"target":613,"type":"cites","value":5},{"source":395,"target":599,"type":"cites","value":4},{"source":673,"target":161,"type":"cites","value":4},{"source":274,"target":161,"type":"cites","value":5},{"source":539,"target":332,"type":"cites","value":3},{"source":539,"target":203,"type":"cites","value":3},{"source":674,"target":222,"type":"cites","value":3},{"source":675,"target":222,"type":"cites","value":3},{"source":539,"target":200,"type":"cites","value":3},{"source":539,"target":340,"type":"cites","value":3},{"source":587,"target":185,"type":"cites","value":8},{"source":185,"target":587,"type":"cites","value":5},{"source":380,"target":290,"type":"cites","value":6},{"source":381,"target":669,"type":"cites","value":4},{"source":382,"target":669,"type":"cites","value":5},{"source":676,"target":283,"type":"cites","value":5},{"source":161,"target":482,"type":"cites","value":4},{"source":161,"target":596,"type":"cites","value":3},{"source":448,"target":528,"type":"cites","value":3},{"source":390,"target":528,"type":"cites","value":7},{"source":390,"target":555,"type":"cites","value":3},{"source":390,"target":382,"type":"cites","value":3},{"source":66,"target":340,"type":"cites","value":3},{"source":448,"target":20,"type":"cites","value":4},{"source":325,"target":20,"type":"cites","value":3},{"source":66,"target":20,"type":"cites","value":6},{"source":390,"target":332,"type":"cites","value":5},{"source":390,"target":264,"type":"cites","value":6},{"source":340,"target":482,"type":"cites","value":4},{"source":471,"target":536,"type":"cites","value":5},{"source":471,"target":528,"type":"cites","value":34},{"source":471,"target":434,"type":"cites","value":15},{"source":471,"target":484,"type":"cites","value":3},{"source":9,"target":677,"type":"cites","value":3},{"source":227,"target":9,"type":"cites","value":3},{"source":527,"target":341,"type":"cites","value":7},{"source":527,"target":529,"type":"cites","value":3},{"source":530,"target":527,"type":"cites","value":5},{"source":528,"target":527,"type":"cites","value":6},{"source":528,"target":341,"type":"cites","value":5},{"source":395,"target":527,"type":"cites","value":4},{"source":395,"target":341,"type":"cites","value":3},{"source":678,"target":80,"type":"cites","value":3},{"source":679,"target":80,"type":"cites","value":3},{"source":680,"target":185,"type":"cites","value":3},{"source":681,"target":209,"type":"cites","value":3},{"source":656,"target":655,"type":"cites","value":3},{"source":656,"target":209,"type":"cites","value":5},{"source":209,"target":655,"type":"cites","value":8},{"source":209,"target":682,"type":"cites","value":3},{"source":209,"target":656,"type":"cites","value":7},{"source":310,"target":55,"type":"cites","value":3},{"source":683,"target":266,"type":"cites","value":5},{"source":683,"target":39,"type":"cites","value":3},{"source":683,"target":112,"type":"cites","value":4},{"source":135,"target":684,"type":"cites","value":3},{"source":135,"target":77,"type":"cites","value":3},{"source":684,"target":222,"type":"cites","value":4},{"source":685,"target":380,"type":"cites","value":4},{"source":685,"target":290,"type":"cites","value":3},{"source":686,"target":380,"type":"cites","value":3},{"source":686,"target":290,"type":"cites","value":3},{"source":290,"target":685,"type":"cites","value":5},{"source":290,"target":567,"type":"cites","value":3},{"source":290,"target":320,"type":"cites","value":3},{"source":290,"target":687,"type":"cites","value":3},{"source":380,"target":390,"type":"cites","value":4},{"source":212,"target":193,"type":"cites","value":3},{"source":212,"target":340,"type":"cites","value":3},{"source":212,"target":161,"type":"cites","value":4},{"source":212,"target":283,"type":"cites","value":3},{"source":688,"target":212,"type":"cites","value":7},{"source":688,"target":80,"type":"cites","value":3},{"source":513,"target":310,"type":"cites","value":19},{"source":513,"target":1,"type":"cites","value":9},{"source":513,"target":689,"type":"cites","value":3},{"source":99,"target":513,"type":"cites","value":3},{"source":690,"target":392,"type":"cites","value":6},{"source":690,"target":465,"type":"cites","value":3},{"source":691,"target":4,"type":"cites","value":3},{"source":691,"target":301,"type":"cites","value":4},{"source":243,"target":323,"type":"cites","value":6},{"source":692,"target":523,"type":"cites","value":3},{"source":692,"target":518,"type":"cites","value":3},{"source":692,"target":581,"type":"cites","value":3},{"source":692,"target":517,"type":"cites","value":3},{"source":692,"target":582,"type":"cites","value":3},{"source":692,"target":84,"type":"cites","value":4},{"source":693,"target":112,"type":"cites","value":3},{"source":694,"target":84,"type":"cites","value":3},{"source":695,"target":441,"type":"cites","value":4},{"source":441,"target":54,"type":"cites","value":4},{"source":283,"target":374,"type":"cites","value":3},{"source":696,"target":185,"type":"cites","value":7},{"source":697,"target":185,"type":"cites","value":3},{"source":197,"target":185,"type":"cites","value":4},{"source":696,"target":203,"type":"cites","value":3},{"source":697,"target":203,"type":"cites","value":3},{"source":197,"target":203,"type":"cites","value":3},{"source":559,"target":293,"type":"cites","value":11},{"source":559,"target":698,"type":"cites","value":6},{"source":559,"target":699,"type":"cites","value":7},{"source":559,"target":700,"type":"cites","value":8},{"source":559,"target":701,"type":"cites","value":8},{"source":293,"target":698,"type":"cites","value":6},{"source":293,"target":699,"type":"cites","value":8},{"source":293,"target":700,"type":"cites","value":10},{"source":293,"target":701,"type":"cites","value":10},{"source":559,"target":374,"type":"cites","value":4},{"source":559,"target":161,"type":"cites","value":9},{"source":293,"target":374,"type":"cites","value":5},{"source":494,"target":293,"type":"cites","value":3},{"source":80,"target":293,"type":"cites","value":3},{"source":702,"target":161,"type":"cites","value":4},{"source":702,"target":212,"type":"cites","value":4},{"source":494,"target":212,"type":"cites","value":3},{"source":291,"target":528,"type":"cites","value":3},{"source":440,"target":434,"type":"cites","value":3},{"source":560,"target":434,"type":"cites","value":3},{"source":339,"target":434,"type":"cites","value":3},{"source":440,"target":560,"type":"cites","value":7},{"source":339,"target":560,"type":"cites","value":6},{"source":703,"target":559,"type":"cites","value":9},{"source":292,"target":335,"type":"cites","value":3},{"source":292,"target":336,"type":"cites","value":3},{"source":292,"target":525,"type":"cites","value":3},{"source":292,"target":526,"type":"cites","value":4},{"source":20,"target":526,"type":"cites","value":4},{"source":292,"target":222,"type":"cites","value":3},{"source":292,"target":260,"type":"cites","value":3},{"source":20,"target":222,"type":"cites","value":6},{"source":20,"target":260,"type":"cites","value":5},{"source":20,"target":77,"type":"cites","value":7},{"source":292,"target":23,"type":"cites","value":3},{"source":292,"target":527,"type":"cites","value":3},{"source":292,"target":341,"type":"cites","value":3},{"source":292,"target":529,"type":"cites","value":3},{"source":20,"target":341,"type":"cites","value":4},{"source":20,"target":395,"type":"cites","value":4},{"source":522,"target":23,"type":"cites","value":3},{"source":336,"target":491,"type":"cites","value":3},{"source":336,"target":493,"type":"cites","value":3},{"source":336,"target":300,"type":"cites","value":3},{"source":335,"target":336,"type":"cites","value":3},{"source":390,"target":427,"type":"cites","value":3},{"source":448,"target":390,"type":"cites","value":3},{"source":212,"target":494,"type":"cites","value":3},{"source":704,"target":84,"type":"cites","value":9},{"source":705,"target":84,"type":"cites","value":4},{"source":706,"target":84,"type":"cites","value":9},{"source":707,"target":84,"type":"cites","value":9},{"source":704,"target":205,"type":"cites","value":4},{"source":706,"target":205,"type":"cites","value":4},{"source":707,"target":205,"type":"cites","value":4},{"source":704,"target":207,"type":"cites","value":4},{"source":704,"target":115,"type":"cites","value":3},{"source":706,"target":207,"type":"cites","value":4},{"source":706,"target":115,"type":"cites","value":3},{"source":707,"target":207,"type":"cites","value":4},{"source":707,"target":115,"type":"cites","value":3},{"source":323,"target":115,"type":"cites","value":4},{"source":84,"target":526,"type":"cites","value":3},{"source":84,"target":525,"type":"cites","value":3},{"source":477,"target":196,"type":"cites","value":5},{"source":477,"target":84,"type":"cites","value":4},{"source":477,"target":161,"type":"cites","value":8},{"source":477,"target":66,"type":"cites","value":3},{"source":80,"target":449,"type":"cites","value":3},{"source":80,"target":708,"type":"cites","value":3},{"source":80,"target":535,"type":"cites","value":3},{"source":80,"target":709,"type":"cites","value":3},{"source":80,"target":710,"type":"cites","value":3},{"source":80,"target":711,"type":"cites","value":3},{"source":80,"target":712,"type":"cites","value":3},{"source":80,"target":713,"type":"cites","value":3},{"source":448,"target":440,"type":"cites","value":4},{"source":448,"target":560,"type":"cites","value":4},{"source":448,"target":339,"type":"cites","value":4},{"source":80,"target":440,"type":"cites","value":7},{"source":80,"target":560,"type":"cites","value":6},{"source":80,"target":446,"type":"cites","value":3},{"source":80,"target":264,"type":"cites","value":3},{"source":80,"target":376,"type":"cites","value":4},{"source":616,"target":283,"type":"cites","value":4},{"source":293,"target":535,"type":"cites","value":3},{"source":558,"target":374,"type":"cites","value":3},{"source":540,"target":415,"type":"cites","value":3},{"source":540,"target":41,"type":"cites","value":3},{"source":540,"target":298,"type":"cites","value":3},{"source":584,"target":261,"type":"cites","value":3},{"source":584,"target":193,"type":"cites","value":3},{"source":584,"target":192,"type":"cites","value":4},{"source":540,"target":261,"type":"cites","value":6},{"source":332,"target":192,"type":"cites","value":3},{"source":340,"target":261,"type":"cites","value":4},{"source":340,"target":193,"type":"cites","value":3},{"source":340,"target":192,"type":"cites","value":5},{"source":477,"target":525,"type":"cites","value":4},{"source":477,"target":526,"type":"cites","value":6},{"source":477,"target":469,"type":"cites","value":3},{"source":477,"target":470,"type":"cites","value":4},{"source":477,"target":714,"type":"cites","value":3},{"source":84,"target":477,"type":"cites","value":4},{"source":477,"target":478,"type":"cites","value":6},{"source":715,"target":161,"type":"cites","value":9},{"source":715,"target":283,"type":"cites","value":10},{"source":715,"target":539,"type":"cites","value":5},{"source":715,"target":426,"type":"cites","value":5},{"source":715,"target":222,"type":"cites","value":13},{"source":715,"target":427,"type":"cites","value":3},{"source":222,"target":427,"type":"cites","value":3},{"source":715,"target":374,"type":"cites","value":3},{"source":716,"target":161,"type":"cites","value":4},{"source":716,"target":437,"type":"cites","value":3},{"source":716,"target":380,"type":"cites","value":4},{"source":442,"target":437,"type":"cites","value":4},{"source":442,"target":380,"type":"cites","value":5},{"source":716,"target":264,"type":"cites","value":5},{"source":717,"target":382,"type":"cites","value":12},{"source":717,"target":381,"type":"cites","value":9},{"source":717,"target":383,"type":"cites","value":8},{"source":718,"target":382,"type":"cites","value":5},{"source":718,"target":381,"type":"cites","value":3},{"source":718,"target":383,"type":"cites","value":3},{"source":719,"target":382,"type":"cites","value":5},{"source":719,"target":381,"type":"cites","value":3},{"source":717,"target":539,"type":"cites","value":4},{"source":382,"target":539,"type":"cites","value":5},{"source":382,"target":426,"type":"cites","value":6},{"source":382,"target":222,"type":"cites","value":8},{"source":719,"target":222,"type":"cites","value":3},{"source":381,"target":539,"type":"cites","value":3},{"source":381,"target":426,"type":"cites","value":4},{"source":381,"target":222,"type":"cites","value":6},{"source":717,"target":283,"type":"cites","value":3},{"source":720,"target":483,"type":"cites","value":3},{"source":721,"target":395,"type":"cites","value":4},{"source":720,"target":23,"type":"cites","value":3},{"source":720,"target":120,"type":"cites","value":3},{"source":721,"target":23,"type":"cites","value":3},{"source":721,"target":120,"type":"cites","value":3},{"source":722,"target":23,"type":"cites","value":3},{"source":722,"target":120,"type":"cites","value":3},{"source":721,"target":20,"type":"cites","value":3},{"source":332,"target":480,"type":"cites","value":5},{"source":332,"target":129,"type":"cites","value":3},{"source":539,"target":260,"type":"cites","value":9},{"source":539,"target":588,"type":"cites","value":6},{"source":539,"target":335,"type":"cites","value":3},{"source":539,"target":336,"type":"cites","value":3},{"source":539,"target":723,"type":"cites","value":3},{"source":539,"target":724,"type":"cites","value":3},{"source":539,"target":725,"type":"cites","value":3},{"source":539,"target":77,"type":"cites","value":11},{"source":539,"target":20,"type":"cites","value":4},{"source":42,"target":376,"type":"cites","value":4},{"source":526,"target":601,"type":"cites","value":3},{"source":726,"target":525,"type":"cites","value":5},{"source":726,"target":526,"type":"cites","value":6},{"source":726,"target":116,"type":"cites","value":4},{"source":42,"target":525,"type":"cites","value":11},{"source":42,"target":526,"type":"cites","value":11},{"source":42,"target":593,"type":"cites","value":4},{"source":42,"target":116,"type":"cites","value":8},{"source":42,"target":264,"type":"cites","value":4},{"source":42,"target":727,"type":"cites","value":3},{"source":42,"target":728,"type":"cites","value":3},{"source":42,"target":415,"type":"cites","value":3},{"source":42,"target":298,"type":"cites","value":3},{"source":442,"target":66,"type":"cites","value":4},{"source":437,"target":390,"type":"cites","value":4},{"source":437,"target":66,"type":"cites","value":4},{"source":380,"target":222,"type":"cites","value":5},{"source":726,"target":283,"type":"cites","value":3},{"source":526,"target":283,"type":"cites","value":6},{"source":297,"target":192,"type":"cites","value":3},{"source":297,"target":193,"type":"cites","value":5},{"source":297,"target":283,"type":"cites","value":10},{"source":696,"target":332,"type":"cites","value":3},{"source":696,"target":697,"type":"cites","value":4},{"source":696,"target":197,"type":"cites","value":5},{"source":697,"target":197,"type":"cites","value":3},{"source":197,"target":696,"type":"cites","value":3},{"source":197,"target":697,"type":"cites","value":4},{"source":729,"target":332,"type":"cites","value":4},{"source":729,"target":203,"type":"cites","value":20},{"source":729,"target":254,"type":"cites","value":3},{"source":730,"target":203,"type":"cites","value":4},{"source":729,"target":482,"type":"cites","value":3},{"source":729,"target":596,"type":"cites","value":3},{"source":729,"target":283,"type":"cites","value":7},{"source":730,"target":482,"type":"cites","value":3},{"source":730,"target":596,"type":"cites","value":3},{"source":730,"target":283,"type":"cites","value":6},{"source":203,"target":596,"type":"cites","value":3},{"source":729,"target":161,"type":"cites","value":6},{"source":528,"target":673,"type":"cites","value":11},{"source":528,"target":274,"type":"cites","value":7},{"source":471,"target":610,"type":"cites","value":11},{"source":471,"target":673,"type":"cites","value":9},{"source":471,"target":274,"type":"cites","value":8},{"source":731,"target":610,"type":"cites","value":3},{"source":731,"target":434,"type":"cites","value":3},{"source":731,"target":528,"type":"cites","value":7},{"source":731,"target":395,"type":"cites","value":5},{"source":732,"target":610,"type":"cites","value":4},{"source":732,"target":434,"type":"cites","value":9},{"source":732,"target":528,"type":"cites","value":23},{"source":732,"target":673,"type":"cites","value":4},{"source":732,"target":395,"type":"cites","value":13},{"source":528,"target":212,"type":"cites","value":6},{"source":528,"target":733,"type":"cites","value":4},{"source":471,"target":733,"type":"cites","value":3},{"source":732,"target":9,"type":"cites","value":5},{"source":528,"target":471,"type":"cites","value":25},{"source":528,"target":731,"type":"cites","value":11},{"source":528,"target":734,"type":"cites","value":12},{"source":528,"target":735,"type":"cites","value":11},{"source":471,"target":731,"type":"cites","value":6},{"source":471,"target":734,"type":"cites","value":3},{"source":471,"target":735,"type":"cites","value":3},{"source":732,"target":471,"type":"cites","value":10},{"source":732,"target":731,"type":"cites","value":3},{"source":732,"target":734,"type":"cites","value":6},{"source":732,"target":735,"type":"cites","value":5},{"source":528,"target":489,"type":"cites","value":3},{"source":471,"target":555,"type":"cites","value":8},{"source":471,"target":611,"type":"cites","value":5},{"source":471,"target":612,"type":"cites","value":5},{"source":471,"target":613,"type":"cites","value":5},{"source":732,"target":555,"type":"cites","value":4},{"source":732,"target":611,"type":"cites","value":3},{"source":732,"target":612,"type":"cites","value":3},{"source":732,"target":613,"type":"cites","value":3},{"source":736,"target":283,"type":"cites","value":7},{"source":736,"target":326,"type":"cites","value":6},{"source":736,"target":124,"type":"cites","value":9},{"source":600,"target":442,"type":"cites","value":3},{"source":600,"target":203,"type":"cites","value":3},{"source":730,"target":442,"type":"cites","value":3},{"source":203,"target":588,"type":"cites","value":5},{"source":737,"target":283,"type":"cites","value":5},{"source":212,"target":332,"type":"cites","value":5},{"source":212,"target":376,"type":"cites","value":4},{"source":212,"target":264,"type":"cites","value":4},{"source":42,"target":331,"type":"cites","value":3},{"source":539,"target":323,"type":"cites","value":3},{"source":539,"target":84,"type":"cites","value":3},{"source":290,"target":539,"type":"cites","value":5},{"source":290,"target":222,"type":"cites","value":5},{"source":684,"target":539,"type":"cites","value":3},{"source":77,"target":539,"type":"cites","value":7},{"source":77,"target":426,"type":"cites","value":3},{"source":77,"target":222,"type":"cites","value":8},{"source":539,"target":54,"type":"cites","value":3},{"source":77,"target":55,"type":"cites","value":3},{"source":563,"target":392,"type":"cites","value":4},{"source":563,"target":465,"type":"cites","value":7},{"source":271,"target":392,"type":"cites","value":3},{"source":271,"target":465,"type":"cites","value":5},{"source":212,"target":392,"type":"cites","value":3},{"source":212,"target":465,"type":"cites","value":5},{"source":738,"target":227,"type":"cites","value":5},{"source":738,"target":99,"type":"cites","value":4},{"source":739,"target":405,"type":"cites","value":4},{"source":740,"target":45,"type":"cites","value":7},{"source":739,"target":45,"type":"cites","value":10},{"source":45,"target":524,"type":"cites","value":3},{"source":739,"target":143,"type":"cites","value":4},{"source":739,"target":267,"type":"cites","value":3},{"source":739,"target":468,"type":"cites","value":3},{"source":739,"target":9,"type":"cites","value":3},{"source":398,"target":576,"type":"cites","value":3},{"source":13,"target":576,"type":"cites","value":4},{"source":406,"target":741,"type":"cites","value":6},{"source":406,"target":42,"type":"cites","value":19},{"source":742,"target":741,"type":"cites","value":5},{"source":742,"target":406,"type":"cites","value":16},{"source":742,"target":243,"type":"cites","value":16},{"source":742,"target":42,"type":"cites","value":17},{"source":743,"target":741,"type":"cites","value":4},{"source":743,"target":406,"type":"cites","value":11},{"source":743,"target":243,"type":"cites","value":9},{"source":743,"target":42,"type":"cites","value":12},{"source":744,"target":741,"type":"cites","value":4},{"source":744,"target":406,"type":"cites","value":11},{"source":744,"target":243,"type":"cites","value":9},{"source":744,"target":42,"type":"cites","value":12},{"source":42,"target":741,"type":"cites","value":7},{"source":42,"target":406,"type":"cites","value":19},{"source":42,"target":243,"type":"cites","value":19},{"source":243,"target":741,"type":"cites","value":8},{"source":243,"target":406,"type":"cites","value":18},{"source":243,"target":42,"type":"cites","value":20},{"source":742,"target":407,"type":"cites","value":5},{"source":743,"target":407,"type":"cites","value":3},{"source":744,"target":407,"type":"cites","value":3},{"source":42,"target":407,"type":"cites","value":5},{"source":406,"target":323,"type":"cites","value":5},{"source":406,"target":745,"type":"cites","value":4},{"source":406,"target":84,"type":"cites","value":6},{"source":406,"target":746,"type":"cites","value":4},{"source":406,"target":747,"type":"cites","value":4},{"source":406,"target":748,"type":"cites","value":4},{"source":742,"target":323,"type":"cites","value":5},{"source":742,"target":745,"type":"cites","value":4},{"source":742,"target":84,"type":"cites","value":6},{"source":742,"target":746,"type":"cites","value":4},{"source":742,"target":747,"type":"cites","value":4},{"source":742,"target":748,"type":"cites","value":4},{"source":743,"target":84,"type":"cites","value":3},{"source":744,"target":84,"type":"cites","value":3},{"source":42,"target":323,"type":"cites","value":6},{"source":42,"target":745,"type":"cites","value":4},{"source":42,"target":746,"type":"cites","value":4},{"source":42,"target":747,"type":"cites","value":4},{"source":42,"target":748,"type":"cites","value":4},{"source":243,"target":745,"type":"cites","value":4},{"source":243,"target":746,"type":"cites","value":4},{"source":243,"target":747,"type":"cites","value":4},{"source":243,"target":748,"type":"cites","value":4},{"source":573,"target":524,"type":"cites","value":3},{"source":573,"target":45,"type":"cites","value":12},{"source":483,"target":524,"type":"cites","value":3},{"source":483,"target":45,"type":"cites","value":7},{"source":573,"target":146,"type":"cites","value":4},{"source":483,"target":146,"type":"cites","value":4},{"source":505,"target":77,"type":"cites","value":5},{"source":654,"target":318,"type":"cites","value":4},{"source":749,"target":222,"type":"cites","value":6},{"source":749,"target":426,"type":"cites","value":3},{"source":424,"target":323,"type":"cites","value":5},{"source":424,"target":84,"type":"cites","value":6},{"source":423,"target":323,"type":"cites","value":6},{"source":424,"target":77,"type":"cites","value":4},{"source":84,"target":658,"type":"cites","value":3},{"source":84,"target":750,"type":"cites","value":3},{"source":84,"target":55,"type":"cites","value":4},{"source":84,"target":751,"type":"cites","value":3},{"source":84,"target":752,"type":"cites","value":3},{"source":423,"target":77,"type":"cites","value":8},{"source":424,"target":423,"type":"cites","value":4},{"source":209,"target":231,"type":"cites","value":6},{"source":753,"target":84,"type":"cites","value":5},{"source":753,"target":207,"type":"cites","value":3},{"source":754,"target":84,"type":"cites","value":5},{"source":754,"target":207,"type":"cites","value":3},{"source":323,"target":185,"type":"cites","value":6},{"source":714,"target":36,"type":"cites","value":3},{"source":477,"target":36,"type":"cites","value":5},{"source":477,"target":755,"type":"cites","value":3},{"source":477,"target":23,"type":"cites","value":3},{"source":477,"target":120,"type":"cites","value":3},{"source":714,"target":77,"type":"cites","value":5},{"source":477,"target":658,"type":"cites","value":5},{"source":477,"target":750,"type":"cites","value":3},{"source":477,"target":77,"type":"cites","value":15},{"source":477,"target":55,"type":"cites","value":3},{"source":477,"target":751,"type":"cites","value":3},{"source":477,"target":752,"type":"cites","value":3},{"source":714,"target":477,"type":"cites","value":8},{"source":714,"target":478,"type":"cites","value":3},{"source":714,"target":417,"type":"cites","value":3},{"source":714,"target":756,"type":"cites","value":3},{"source":477,"target":417,"type":"cites","value":5},{"source":477,"target":756,"type":"cites","value":5},{"source":757,"target":382,"type":"cites","value":4},{"source":757,"target":381,"type":"cites","value":3},{"source":757,"target":383,"type":"cites","value":3},{"source":758,"target":382,"type":"cites","value":4},{"source":758,"target":381,"type":"cites","value":3},{"source":758,"target":383,"type":"cites","value":3},{"source":759,"target":382,"type":"cites","value":4},{"source":759,"target":381,"type":"cites","value":3},{"source":759,"target":383,"type":"cites","value":3},{"source":757,"target":341,"type":"cites","value":3},{"source":758,"target":341,"type":"cites","value":3},{"source":759,"target":341,"type":"cites","value":3},{"source":609,"target":703,"type":"cites","value":4},{"source":609,"target":760,"type":"cites","value":3},{"source":609,"target":761,"type":"cites","value":3},{"source":609,"target":441,"type":"cites","value":4},{"source":609,"target":335,"type":"cites","value":3},{"source":609,"target":336,"type":"cites","value":3},{"source":599,"target":283,"type":"cites","value":5},{"source":599,"target":192,"type":"cites","value":3},{"source":599,"target":333,"type":"cites","value":4},{"source":600,"target":283,"type":"cites","value":7},{"source":600,"target":192,"type":"cites","value":3},{"source":600,"target":333,"type":"cites","value":4},{"source":599,"target":161,"type":"cites","value":6},{"source":600,"target":161,"type":"cites","value":8},{"source":599,"target":528,"type":"cites","value":7},{"source":599,"target":395,"type":"cites","value":5},{"source":376,"target":528,"type":"cites","value":5},{"source":376,"target":395,"type":"cites","value":5},{"source":600,"target":528,"type":"cites","value":3},{"source":600,"target":204,"type":"cites","value":3},{"source":599,"target":254,"type":"cites","value":3},{"source":599,"target":446,"type":"cites","value":3},{"source":376,"target":332,"type":"cites","value":3},{"source":762,"target":292,"type":"cites","value":3},{"source":425,"target":84,"type":"cites","value":4},{"source":702,"target":495,"type":"cites","value":5},{"source":702,"target":80,"type":"cites","value":5},{"source":494,"target":763,"type":"cites","value":3},{"source":80,"target":763,"type":"cites","value":3},{"source":702,"target":528,"type":"cites","value":3},{"source":494,"target":528,"type":"cites","value":5},{"source":494,"target":395,"type":"cites","value":3},{"source":80,"target":528,"type":"cites","value":5},{"source":80,"target":395,"type":"cites","value":4},{"source":702,"target":494,"type":"cites","value":4},{"source":494,"target":702,"type":"cites","value":4},{"source":80,"target":702,"type":"cites","value":4},{"source":494,"target":440,"type":"cites","value":6},{"source":494,"target":560,"type":"cites","value":5},{"source":764,"target":293,"type":"cites","value":4},{"source":700,"target":559,"type":"cites","value":6},{"source":700,"target":698,"type":"cites","value":3},{"source":700,"target":699,"type":"cites","value":5},{"source":700,"target":701,"type":"cites","value":7},{"source":700,"target":293,"type":"cites","value":11},{"source":701,"target":559,"type":"cites","value":6},{"source":701,"target":698,"type":"cites","value":3},{"source":701,"target":699,"type":"cites","value":5},{"source":701,"target":700,"type":"cites","value":7},{"source":701,"target":293,"type":"cites","value":11},{"source":700,"target":703,"type":"cites","value":3},{"source":700,"target":760,"type":"cites","value":3},{"source":700,"target":761,"type":"cites","value":3},{"source":700,"target":441,"type":"cites","value":3},{"source":293,"target":703,"type":"cites","value":3},{"source":293,"target":760,"type":"cites","value":3},{"source":293,"target":761,"type":"cites","value":3},{"source":293,"target":441,"type":"cites","value":3},{"source":701,"target":703,"type":"cites","value":3},{"source":701,"target":760,"type":"cites","value":3},{"source":701,"target":761,"type":"cites","value":3},{"source":701,"target":441,"type":"cites","value":3},{"source":212,"target":260,"type":"cites","value":5},{"source":212,"target":765,"type":"cites","value":3},{"source":688,"target":598,"type":"cites","value":4},{"source":766,"target":283,"type":"cites","value":4},{"source":767,"target":283,"type":"cites","value":4},{"source":697,"target":283,"type":"cites","value":4},{"source":696,"target":482,"type":"cites","value":3},{"source":696,"target":283,"type":"cites","value":5},{"source":197,"target":283,"type":"cites","value":6},{"source":197,"target":261,"type":"cites","value":3},{"source":486,"target":166,"type":"cites","value":3},{"source":486,"target":20,"type":"cites","value":3},{"source":166,"target":20,"type":"cites","value":5},{"source":548,"target":434,"type":"cites","value":4},{"source":548,"target":528,"type":"cites","value":10},{"source":548,"target":611,"type":"cites","value":3},{"source":548,"target":395,"type":"cites","value":5},{"source":548,"target":440,"type":"cites","value":3},{"source":548,"target":560,"type":"cites","value":3},{"source":548,"target":441,"type":"cites","value":4},{"source":548,"target":339,"type":"cites","value":3},{"source":323,"target":415,"type":"cites","value":3},{"source":323,"target":298,"type":"cites","value":3},{"source":768,"target":395,"type":"cites","value":4},{"source":471,"target":557,"type":"cites","value":3},{"source":734,"target":434,"type":"cites","value":5},{"source":734,"target":528,"type":"cites","value":19},{"source":734,"target":555,"type":"cites","value":5},{"source":734,"target":610,"type":"cites","value":4},{"source":734,"target":395,"type":"cites","value":9},{"source":735,"target":434,"type":"cites","value":3},{"source":735,"target":528,"type":"cites","value":11},{"source":735,"target":555,"type":"cites","value":3},{"source":735,"target":610,"type":"cites","value":3},{"source":735,"target":395,"type":"cites","value":6},{"source":734,"target":673,"type":"cites","value":3},{"source":395,"target":673,"type":"cites","value":3},{"source":395,"target":274,"type":"cites","value":3},{"source":673,"target":489,"type":"cites","value":3},{"source":673,"target":341,"type":"cites","value":6},{"source":471,"target":340,"type":"cites","value":3},{"source":471,"target":264,"type":"cites","value":4},{"source":528,"target":530,"type":"cites","value":5},{"source":528,"target":769,"type":"cites","value":3},{"source":528,"target":770,"type":"cites","value":3},{"source":734,"target":536,"type":"cites","value":3},{"source":734,"target":291,"type":"cites","value":3},{"source":471,"target":732,"type":"cites","value":7},{"source":471,"target":771,"type":"cites","value":3},{"source":734,"target":471,"type":"cites","value":7},{"source":734,"target":731,"type":"cites","value":4},{"source":734,"target":732,"type":"cites","value":5},{"source":528,"target":732,"type":"cites","value":15},{"source":528,"target":771,"type":"cites","value":4},{"source":735,"target":471,"type":"cites","value":3},{"source":395,"target":772,"type":"cites","value":4},{"source":395,"target":773,"type":"cites","value":4},{"source":395,"target":774,"type":"cites","value":4},{"source":471,"target":446,"type":"cites","value":3},{"source":471,"target":36,"type":"cites","value":3},{"source":618,"target":539,"type":"cites","value":3},{"source":618,"target":426,"type":"cites","value":3},{"source":618,"target":222,"type":"cites","value":5},{"source":390,"target":539,"type":"cites","value":4},{"source":618,"target":341,"type":"cites","value":3},{"source":585,"target":487,"type":"cites","value":4},{"source":585,"target":488,"type":"cites","value":4},{"source":298,"target":487,"type":"cites","value":3},{"source":298,"target":488,"type":"cites","value":3},{"source":41,"target":487,"type":"cites","value":7},{"source":41,"target":488,"type":"cites","value":7},{"source":721,"target":487,"type":"cites","value":12},{"source":721,"target":488,"type":"cites","value":12},{"source":721,"target":775,"type":"cites","value":3},{"source":776,"target":487,"type":"cites","value":9},{"source":776,"target":488,"type":"cites","value":9},{"source":483,"target":487,"type":"cites","value":14},{"source":483,"target":488,"type":"cites","value":14},{"source":483,"target":775,"type":"cites","value":3},{"source":777,"target":487,"type":"cites","value":4},{"source":777,"target":488,"type":"cites","value":4},{"source":42,"target":332,"type":"cites","value":4},{"source":42,"target":482,"type":"cites","value":5},{"source":778,"target":526,"type":"cites","value":4},{"source":778,"target":525,"type":"cites","value":4},{"source":778,"target":116,"type":"cites","value":3},{"source":779,"target":526,"type":"cites","value":5},{"source":779,"target":525,"type":"cites","value":5},{"source":779,"target":116,"type":"cites","value":3},{"source":780,"target":332,"type":"cites","value":3},{"source":780,"target":283,"type":"cites","value":3},{"source":376,"target":600,"type":"cites","value":3},{"source":526,"target":296,"type":"cites","value":3},{"source":526,"target":41,"type":"cites","value":3},{"source":42,"target":726,"type":"cites","value":3},{"source":526,"target":778,"type":"cites","value":3},{"source":42,"target":36,"type":"cites","value":3},{"source":526,"target":36,"type":"cites","value":4},{"source":383,"target":587,"type":"cites","value":4},{"source":383,"target":185,"type":"cites","value":3},{"source":381,"target":587,"type":"cites","value":3},{"source":382,"target":587,"type":"cites","value":5},{"source":382,"target":185,"type":"cites","value":3},{"source":587,"target":383,"type":"cites","value":7},{"source":587,"target":382,"type":"cites","value":10},{"source":587,"target":381,"type":"cites","value":8},{"source":587,"target":378,"type":"cites","value":3},{"source":587,"target":161,"type":"cites","value":3},{"source":587,"target":477,"type":"cites","value":3},{"source":185,"target":477,"type":"cites","value":4},{"source":781,"target":199,"type":"cites","value":3},{"source":729,"target":737,"type":"cites","value":3},{"source":729,"target":716,"type":"cites","value":5},{"source":729,"target":264,"type":"cites","value":6},{"source":442,"target":716,"type":"cites","value":4},{"source":203,"target":716,"type":"cites","value":4},{"source":729,"target":380,"type":"cites","value":3},{"source":729,"target":437,"type":"cites","value":5},{"source":442,"target":588,"type":"cites","value":4},{"source":720,"target":283,"type":"cites","value":8},{"source":720,"target":482,"type":"cites","value":5},{"source":483,"target":283,"type":"cites","value":7},{"source":483,"target":482,"type":"cites","value":5},{"source":483,"target":41,"type":"cites","value":3},{"source":483,"target":596,"type":"cites","value":3},{"source":483,"target":573,"type":"cites","value":3},{"source":264,"target":596,"type":"cites","value":3},{"source":737,"target":203,"type":"cites","value":6},{"source":716,"target":203,"type":"cites","value":6},{"source":264,"target":730,"type":"cites","value":5},{"source":716,"target":442,"type":"cites","value":5},{"source":737,"target":161,"type":"cites","value":3},{"source":782,"target":264,"type":"cites","value":4},{"source":783,"target":264,"type":"cites","value":4},{"source":540,"target":332,"type":"cites","value":3},{"source":540,"target":340,"type":"cites","value":3},{"source":540,"target":161,"type":"cites","value":3},{"source":742,"target":743,"type":"cites","value":9},{"source":742,"target":744,"type":"cites","value":9},{"source":406,"target":742,"type":"cites","value":8},{"source":406,"target":743,"type":"cites","value":10},{"source":406,"target":744,"type":"cites","value":10},{"source":779,"target":42,"type":"cites","value":8},{"source":743,"target":742,"type":"cites","value":3},{"source":743,"target":744,"type":"cites","value":5},{"source":744,"target":742,"type":"cites","value":3},{"source":744,"target":743,"type":"cites","value":5},{"source":42,"target":742,"type":"cites","value":8},{"source":42,"target":743,"type":"cites","value":10},{"source":42,"target":744,"type":"cites","value":10},{"source":243,"target":742,"type":"cites","value":7},{"source":243,"target":743,"type":"cites","value":9},{"source":243,"target":744,"type":"cites","value":9},{"source":42,"target":784,"type":"cites","value":4},{"source":77,"target":196,"type":"cites","value":3},{"source":77,"target":470,"type":"cites","value":3},{"source":77,"target":185,"type":"cites","value":3},{"source":539,"target":374,"type":"cites","value":3},{"source":423,"target":539,"type":"cites","value":3},{"source":423,"target":222,"type":"cites","value":3},{"source":323,"target":222,"type":"cites","value":4},{"source":477,"target":539,"type":"cites","value":7},{"source":477,"target":222,"type":"cites","value":7},{"source":477,"target":323,"type":"cites","value":7},{"source":477,"target":42,"type":"cites","value":5},{"source":539,"target":609,"type":"cites","value":3},{"source":539,"target":477,"type":"cites","value":5},{"source":77,"target":477,"type":"cites","value":7},{"source":539,"target":380,"type":"cites","value":3},{"source":77,"target":658,"type":"cites","value":3},{"source":477,"target":423,"type":"cites","value":4},{"source":323,"target":220,"type":"cites","value":4},{"source":785,"target":382,"type":"cites","value":3},{"source":382,"target":717,"type":"cites","value":4},{"source":382,"target":718,"type":"cites","value":3},{"source":382,"target":786,"type":"cites","value":3},{"source":382,"target":787,"type":"cites","value":3},{"source":382,"target":788,"type":"cites","value":3},{"source":382,"target":719,"type":"cites","value":3},{"source":297,"target":222,"type":"cites","value":4},{"source":134,"target":789,"type":"cites","value":4},{"source":134,"target":790,"type":"cites","value":3},{"source":297,"target":789,"type":"cites","value":4},{"source":297,"target":790,"type":"cites","value":3},{"source":212,"target":791,"type":"cites","value":3},{"source":792,"target":264,"type":"cites","value":3},{"source":442,"target":793,"type":"cites","value":3},{"source":794,"target":442,"type":"cites","value":5},{"source":715,"target":440,"type":"cites","value":3},{"source":715,"target":560,"type":"cites","value":3},{"source":715,"target":339,"type":"cites","value":3},{"source":222,"target":440,"type":"cites","value":3},{"source":222,"target":560,"type":"cites","value":3},{"source":222,"target":715,"type":"cites","value":4},{"source":434,"target":471,"type":"cites","value":5},{"source":434,"target":732,"type":"cites","value":3},{"source":795,"target":528,"type":"cites","value":4},{"source":796,"target":528,"type":"cites","value":4},{"source":528,"target":797,"type":"cites","value":4},{"source":528,"target":798,"type":"cites","value":3},{"source":434,"target":222,"type":"cites","value":3},{"source":528,"target":222,"type":"cites","value":3},{"source":528,"target":799,"type":"cites","value":3},{"source":528,"target":800,"type":"cites","value":3},{"source":528,"target":440,"type":"cites","value":7},{"source":528,"target":801,"type":"cites","value":4},{"source":528,"target":560,"type":"cites","value":7},{"source":528,"target":802,"type":"cites","value":4},{"source":380,"target":445,"type":"cites","value":3},{"source":803,"target":283,"type":"cites","value":3},{"source":804,"target":283,"type":"cites","value":3},{"source":805,"target":283,"type":"cites","value":3},{"source":806,"target":283,"type":"cites","value":3},{"source":807,"target":283,"type":"cites","value":3},{"source":803,"target":326,"type":"cites","value":3},{"source":807,"target":326,"type":"cites","value":3},{"source":161,"target":395,"type":"cites","value":3},{"source":676,"target":124,"type":"cites","value":3},{"source":808,"target":283,"type":"cites","value":4},{"source":809,"target":442,"type":"cites","value":3},{"source":809,"target":203,"type":"cites","value":3},{"source":810,"target":42,"type":"cites","value":3},{"source":563,"target":271,"type":"cites","value":3},{"source":811,"target":271,"type":"cites","value":3},{"source":811,"target":465,"type":"cites","value":4},{"source":690,"target":650,"type":"cites","value":3},{"source":690,"target":575,"type":"cites","value":3},{"source":812,"target":406,"type":"cites","value":5},{"source":812,"target":743,"type":"cites","value":3},{"source":812,"target":744,"type":"cites","value":3},{"source":812,"target":42,"type":"cites","value":5},{"source":812,"target":243,"type":"cites","value":4},{"source":513,"target":55,"type":"cites","value":3},{"source":813,"target":84,"type":"cites","value":4},{"source":814,"target":84,"type":"cites","value":4},{"source":815,"target":84,"type":"cites","value":4},{"source":816,"target":84,"type":"cites","value":4},{"source":817,"target":84,"type":"cites","value":4},{"source":818,"target":220,"type":"cites","value":3},{"source":818,"target":209,"type":"cites","value":3},{"source":819,"target":655,"type":"cites","value":4},{"source":819,"target":564,"type":"cites","value":6},{"source":819,"target":656,"type":"cites","value":4},{"source":819,"target":220,"type":"cites","value":10},{"source":819,"target":209,"type":"cites","value":12},{"source":818,"target":84,"type":"cites","value":3},{"source":819,"target":400,"type":"cites","value":6},{"source":819,"target":401,"type":"cites","value":6},{"source":819,"target":84,"type":"cites","value":8},{"source":820,"target":231,"type":"cites","value":14},{"source":820,"target":322,"type":"cites","value":5},{"source":820,"target":233,"type":"cites","value":8},{"source":820,"target":55,"type":"cites","value":6},{"source":820,"target":102,"type":"cites","value":6},{"source":820,"target":103,"type":"cites","value":5},{"source":821,"target":45,"type":"cites","value":4},{"source":483,"target":528,"type":"cites","value":15},{"source":573,"target":231,"type":"cites","value":4},{"source":573,"target":247,"type":"cites","value":4},{"source":573,"target":267,"type":"cites","value":3},{"source":822,"target":45,"type":"cites","value":3},{"source":822,"target":146,"type":"cites","value":3},{"source":823,"target":310,"type":"cites","value":9},{"source":823,"target":227,"type":"cites","value":8},{"source":823,"target":1,"type":"cites","value":4},{"source":823,"target":99,"type":"cites","value":14},{"source":823,"target":318,"type":"cites","value":3},{"source":513,"target":318,"type":"cites","value":6},{"source":513,"target":456,"type":"cites","value":3},{"source":513,"target":457,"type":"cites","value":3},{"source":513,"target":458,"type":"cites","value":3},{"source":823,"target":513,"type":"cites","value":5},{"source":824,"target":99,"type":"cites","value":3},{"source":825,"target":99,"type":"cites","value":3},{"source":133,"target":10,"type":"cites","value":4},{"source":133,"target":652,"type":"cites","value":4},{"source":133,"target":151,"type":"cites","value":4},{"source":133,"target":287,"type":"cites","value":3},{"source":133,"target":185,"type":"cites","value":3},{"source":738,"target":487,"type":"cites","value":4},{"source":738,"target":488,"type":"cites","value":4},{"source":41,"target":227,"type":"cites","value":4},{"source":738,"target":585,"type":"cites","value":5},{"source":738,"target":415,"type":"cites","value":3},{"source":738,"target":298,"type":"cites","value":5},{"source":738,"target":41,"type":"cites","value":7},{"source":298,"target":585,"type":"cites","value":3},{"source":41,"target":585,"type":"cites","value":10},{"source":41,"target":826,"type":"cites","value":4},{"source":738,"target":721,"type":"cites","value":3},{"source":738,"target":483,"type":"cites","value":5},{"source":738,"target":171,"type":"cites","value":3},{"source":41,"target":721,"type":"cites","value":4},{"source":41,"target":776,"type":"cites","value":3},{"source":41,"target":483,"type":"cites","value":7},{"source":41,"target":777,"type":"cites","value":3},{"source":41,"target":171,"type":"cites","value":4},{"source":738,"target":318,"type":"cites","value":4},{"source":41,"target":738,"type":"cites","value":8},{"source":41,"target":318,"type":"cites","value":4},{"source":827,"target":487,"type":"cites","value":3},{"source":827,"target":488,"type":"cites","value":3},{"source":505,"target":487,"type":"cites","value":3},{"source":505,"target":488,"type":"cites","value":3},{"source":828,"target":222,"type":"cites","value":3},{"source":20,"target":588,"type":"cites","value":4},{"source":828,"target":454,"type":"cites","value":3},{"source":20,"target":339,"type":"cites","value":6},{"source":20,"target":454,"type":"cites","value":3},{"source":828,"target":161,"type":"cites","value":4},{"source":828,"target":618,"type":"cites","value":6},{"source":20,"target":618,"type":"cites","value":7},{"source":588,"target":185,"type":"cites","value":3},{"source":341,"target":204,"type":"cites","value":5},{"source":326,"target":341,"type":"cites","value":3},{"source":703,"target":264,"type":"cites","value":3},{"source":559,"target":340,"type":"cites","value":6},{"source":559,"target":332,"type":"cites","value":3},{"source":559,"target":264,"type":"cites","value":3},{"source":703,"target":441,"type":"cites","value":3},{"source":559,"target":703,"type":"cites","value":16},{"source":559,"target":760,"type":"cites","value":9},{"source":559,"target":761,"type":"cites","value":9},{"source":559,"target":441,"type":"cites","value":15},{"source":539,"target":293,"type":"cites","value":3},{"source":526,"target":161,"type":"cites","value":3},{"source":714,"target":539,"type":"cites","value":3},{"source":726,"target":477,"type":"cites","value":3},{"source":526,"target":323,"type":"cites","value":3},{"source":526,"target":477,"type":"cites","value":6},{"source":526,"target":77,"type":"cites","value":4},{"source":539,"target":292,"type":"cites","value":3},{"source":274,"target":483,"type":"cites","value":7},{"source":274,"target":721,"type":"cites","value":5},{"source":829,"target":20,"type":"cites","value":3},{"source":274,"target":336,"type":"cites","value":3},{"source":274,"target":487,"type":"cites","value":3},{"source":84,"target":830,"type":"cites","value":4},{"source":467,"target":84,"type":"cites","value":3},{"source":467,"target":323,"type":"cites","value":4},{"source":831,"target":525,"type":"cites","value":9},{"source":831,"target":526,"type":"cites","value":9},{"source":831,"target":593,"type":"cites","value":7},{"source":831,"target":116,"type":"cites","value":8},{"source":293,"target":525,"type":"cites","value":6},{"source":293,"target":526,"type":"cites","value":6},{"source":293,"target":593,"type":"cites","value":4},{"source":293,"target":116,"type":"cites","value":5},{"source":832,"target":525,"type":"cites","value":6},{"source":832,"target":526,"type":"cites","value":6},{"source":832,"target":593,"type":"cites","value":4},{"source":832,"target":116,"type":"cites","value":5},{"source":831,"target":332,"type":"cites","value":6},{"source":831,"target":203,"type":"cites","value":4},{"source":293,"target":332,"type":"cites","value":5},{"source":832,"target":332,"type":"cites","value":5},{"source":831,"target":376,"type":"cites","value":4},{"source":293,"target":376,"type":"cites","value":4},{"source":293,"target":264,"type":"cites","value":3},{"source":832,"target":376,"type":"cites","value":4},{"source":832,"target":264,"type":"cites","value":3},{"source":831,"target":161,"type":"cites","value":3},{"source":832,"target":161,"type":"cites","value":4},{"source":831,"target":293,"type":"cites","value":5},{"source":832,"target":700,"type":"cites","value":3},{"source":832,"target":701,"type":"cites","value":3},{"source":832,"target":293,"type":"cites","value":5},{"source":293,"target":185,"type":"cites","value":3},{"source":494,"target":199,"type":"cites","value":7},{"source":494,"target":282,"type":"cites","value":5},{"source":833,"target":199,"type":"cites","value":3},{"source":833,"target":282,"type":"cites","value":3},{"source":80,"target":199,"type":"cites","value":8},{"source":80,"target":282,"type":"cites","value":6},{"source":833,"target":440,"type":"cites","value":3},{"source":833,"target":339,"type":"cites","value":3},{"source":833,"target":494,"type":"cites","value":4},{"source":833,"target":495,"type":"cites","value":3},{"source":833,"target":80,"type":"cites","value":4},{"source":494,"target":801,"type":"cites","value":3},{"source":494,"target":802,"type":"cites","value":3},{"source":80,"target":801,"type":"cites","value":3},{"source":80,"target":802,"type":"cites","value":3},{"source":834,"target":124,"type":"cites","value":4},{"source":835,"target":196,"type":"cites","value":3},{"source":835,"target":470,"type":"cites","value":3},{"source":835,"target":469,"type":"cites","value":3},{"source":835,"target":185,"type":"cites","value":3},{"source":395,"target":477,"type":"cites","value":3},{"source":836,"target":487,"type":"cites","value":4},{"source":836,"target":488,"type":"cites","value":4},{"source":837,"target":487,"type":"cites","value":4},{"source":837,"target":488,"type":"cites","value":4},{"source":838,"target":487,"type":"cites","value":4},{"source":838,"target":488,"type":"cites","value":4},{"source":483,"target":721,"type":"cites","value":3},{"source":395,"target":721,"type":"cites","value":5},{"source":395,"target":776,"type":"cites","value":4},{"source":395,"target":777,"type":"cites","value":4},{"source":395,"target":171,"type":"cites","value":7},{"source":395,"target":585,"type":"cites","value":6},{"source":395,"target":826,"type":"cites","value":4},{"source":395,"target":839,"type":"cites","value":3},{"source":395,"target":840,"type":"cites","value":3},{"source":395,"target":841,"type":"cites","value":3},{"source":395,"target":842,"type":"cites","value":3},{"source":395,"target":621,"type":"cites","value":4},{"source":395,"target":478,"type":"cites","value":4},{"source":395,"target":160,"type":"cites","value":4},{"source":779,"target":222,"type":"cites","value":3},{"source":42,"target":390,"type":"cites","value":4},{"source":826,"target":185,"type":"cites","value":3},{"source":41,"target":185,"type":"cites","value":4},{"source":843,"target":585,"type":"cites","value":3},{"source":844,"target":585,"type":"cites","value":3},{"source":843,"target":395,"type":"cites","value":3},{"source":844,"target":395,"type":"cites","value":3},{"source":768,"target":487,"type":"cites","value":3},{"source":768,"target":488,"type":"cites","value":3},{"source":483,"target":527,"type":"cites","value":9},{"source":483,"target":530,"type":"cites","value":8},{"source":483,"target":769,"type":"cites","value":3},{"source":483,"target":770,"type":"cites","value":3},{"source":483,"target":376,"type":"cites","value":3},{"source":471,"target":222,"type":"cites","value":4},{"source":395,"target":222,"type":"cites","value":3},{"source":845,"target":9,"type":"cites","value":3},{"source":846,"target":9,"type":"cites","value":4},{"source":274,"target":286,"type":"cites","value":3},{"source":846,"target":339,"type":"cites","value":3},{"source":847,"target":528,"type":"cites","value":6},{"source":848,"target":528,"type":"cites","value":6},{"source":847,"target":395,"type":"cites","value":3},{"source":848,"target":395,"type":"cites","value":4},{"source":734,"target":440,"type":"cites","value":3},{"source":734,"target":560,"type":"cites","value":3},{"source":734,"target":339,"type":"cites","value":3},{"source":799,"target":528,"type":"cites","value":6},{"source":799,"target":395,"type":"cites","value":3},{"source":800,"target":528,"type":"cites","value":6},{"source":800,"target":395,"type":"cites","value":3},{"source":799,"target":471,"type":"cites","value":3},{"source":800,"target":471,"type":"cites","value":3},{"source":528,"target":795,"type":"cites","value":3},{"source":528,"target":796,"type":"cites","value":3},{"source":528,"target":847,"type":"cites","value":4},{"source":528,"target":848,"type":"cites","value":4},{"source":732,"target":536,"type":"cites","value":3},{"source":527,"target":530,"type":"cites","value":10},{"source":527,"target":528,"type":"cites","value":9},{"source":530,"target":528,"type":"cites","value":3},{"source":599,"target":434,"type":"cites","value":3},{"source":599,"target":600,"type":"cites","value":3},{"source":599,"target":363,"type":"cites","value":3},{"source":527,"target":599,"type":"cites","value":5},{"source":599,"target":203,"type":"cites","value":3},{"source":376,"target":730,"type":"cites","value":4},{"source":599,"target":339,"type":"cites","value":3},{"source":376,"target":440,"type":"cites","value":5},{"source":376,"target":560,"type":"cites","value":5},{"source":376,"target":339,"type":"cites","value":5},{"source":527,"target":471,"type":"cites","value":4},{"source":448,"target":622,"type":"cites","value":3},{"source":828,"target":292,"type":"cites","value":5},{"source":828,"target":762,"type":"cites","value":3},{"source":20,"target":762,"type":"cites","value":3},{"source":20,"target":488,"type":"cites","value":3},{"source":20,"target":487,"type":"cites","value":3},{"source":20,"target":166,"type":"cites","value":3},{"source":292,"target":494,"type":"cites","value":3},{"source":292,"target":80,"type":"cites","value":3},{"source":849,"target":20,"type":"cites","value":9},{"source":849,"target":588,"type":"cites","value":5},{"source":849,"target":292,"type":"cites","value":5},{"source":292,"target":850,"type":"cites","value":3},{"source":292,"target":588,"type":"cites","value":5},{"source":446,"target":222,"type":"cites","value":3},{"source":274,"target":41,"type":"cites","value":3},{"source":238,"target":721,"type":"cites","value":4},{"source":238,"target":776,"type":"cites","value":4},{"source":238,"target":483,"type":"cites","value":4},{"source":851,"target":395,"type":"cites","value":3},{"source":238,"target":395,"type":"cites","value":4},{"source":852,"target":124,"type":"cites","value":3},{"source":853,"target":487,"type":"cites","value":3},{"source":853,"target":488,"type":"cites","value":3},{"source":854,"target":487,"type":"cites","value":3},{"source":854,"target":488,"type":"cites","value":3},{"source":853,"target":161,"type":"cites","value":3},{"source":854,"target":161,"type":"cites","value":3},{"source":293,"target":764,"type":"cites","value":3},{"source":700,"target":764,"type":"cites","value":3},{"source":701,"target":764,"type":"cites","value":3},{"source":700,"target":161,"type":"cites","value":3},{"source":701,"target":161,"type":"cites","value":3},{"source":609,"target":559,"type":"cites","value":3},{"source":797,"target":440,"type":"cites","value":4},{"source":797,"target":560,"type":"cites","value":4},{"source":797,"target":339,"type":"cites","value":4},{"source":798,"target":440,"type":"cites","value":4},{"source":798,"target":560,"type":"cites","value":4},{"source":798,"target":339,"type":"cites","value":4},{"source":797,"target":434,"type":"cites","value":4},{"source":797,"target":528,"type":"cites","value":14},{"source":797,"target":395,"type":"cites","value":6},{"source":855,"target":528,"type":"cites","value":5},{"source":855,"target":395,"type":"cites","value":3},{"source":856,"target":528,"type":"cites","value":5},{"source":856,"target":395,"type":"cites","value":3},{"source":798,"target":434,"type":"cites","value":4},{"source":798,"target":528,"type":"cites","value":13},{"source":798,"target":395,"type":"cites","value":6},{"source":797,"target":471,"type":"cites","value":7},{"source":855,"target":471,"type":"cites","value":3},{"source":856,"target":471,"type":"cites","value":3},{"source":798,"target":471,"type":"cites","value":7},{"source":797,"target":734,"type":"cites","value":3},{"source":797,"target":735,"type":"cites","value":3},{"source":798,"target":734,"type":"cites","value":3},{"source":798,"target":735,"type":"cites","value":3},{"source":528,"target":548,"type":"cites","value":3},{"source":857,"target":858,"type":"cites","value":3},{"source":857,"target":763,"type":"cites","value":3},{"source":857,"target":495,"type":"cites","value":4},{"source":857,"target":325,"type":"cites","value":5},{"source":857,"target":448,"type":"cites","value":5},{"source":857,"target":66,"type":"cites","value":6},{"source":857,"target":80,"type":"cites","value":5},{"source":859,"target":448,"type":"cites","value":3},{"source":448,"target":858,"type":"cites","value":3},{"source":448,"target":763,"type":"cites","value":3},{"source":448,"target":495,"type":"cites","value":3},{"source":448,"target":80,"type":"cites","value":3},{"source":857,"target":440,"type":"cites","value":3},{"source":857,"target":560,"type":"cites","value":3},{"source":857,"target":339,"type":"cites","value":3},{"source":857,"target":528,"type":"cites","value":8},{"source":857,"target":395,"type":"cites","value":3},{"source":615,"target":528,"type":"cites","value":5},{"source":715,"target":482,"type":"cites","value":4},{"source":715,"target":596,"type":"cites","value":3},{"source":860,"target":222,"type":"cites","value":3},{"source":861,"target":222,"type":"cites","value":3},{"source":390,"target":482,"type":"cites","value":6},{"source":390,"target":596,"type":"cites","value":5},{"source":862,"target":482,"type":"cites","value":4},{"source":862,"target":283,"type":"cites","value":7},{"source":863,"target":283,"type":"cites","value":3},{"source":864,"target":283,"type":"cites","value":3},{"source":283,"target":596,"type":"cites","value":3},{"source":283,"target":865,"type":"cites","value":3},{"source":283,"target":866,"type":"cites","value":3},{"source":865,"target":482,"type":"cites","value":3},{"source":865,"target":283,"type":"cites","value":5},{"source":866,"target":482,"type":"cites","value":3},{"source":866,"target":283,"type":"cites","value":8},{"source":867,"target":283,"type":"cites","value":4},{"source":866,"target":261,"type":"cites","value":3},{"source":866,"target":193,"type":"cites","value":3},{"source":866,"target":192,"type":"cites","value":3},{"source":336,"target":193,"type":"cites","value":3},{"source":336,"target":192,"type":"cites","value":3},{"source":385,"target":42,"type":"cites","value":4},{"source":868,"target":618,"type":"cites","value":3},{"source":868,"target":373,"type":"cites","value":4},{"source":869,"target":618,"type":"cites","value":3},{"source":869,"target":373,"type":"cites","value":4},{"source":868,"target":161,"type":"cites","value":3},{"source":869,"target":161,"type":"cites","value":3},{"source":868,"target":20,"type":"cites","value":3},{"source":869,"target":20,"type":"cites","value":3},{"source":717,"target":477,"type":"cites","value":3},{"source":809,"target":283,"type":"cites","value":3},{"source":870,"target":329,"type":"cites","value":3},{"source":870,"target":331,"type":"cites","value":3},{"source":329,"target":871,"type":"cites","value":4},{"source":872,"target":329,"type":"cites","value":3},{"source":872,"target":331,"type":"cites","value":3},{"source":873,"target":329,"type":"cites","value":6},{"source":873,"target":331,"type":"cites","value":6},{"source":874,"target":329,"type":"cites","value":4},{"source":874,"target":331,"type":"cites","value":4},{"source":331,"target":332,"type":"cites","value":5},{"source":331,"target":871,"type":"cites","value":3},{"source":875,"target":426,"type":"cites","value":3},{"source":876,"target":426,"type":"cites","value":3},{"source":877,"target":426,"type":"cites","value":3},{"source":875,"target":222,"type":"cites","value":3},{"source":876,"target":222,"type":"cites","value":3},{"source":877,"target":222,"type":"cites","value":3},{"source":729,"target":294,"type":"cites","value":3},{"source":878,"target":729,"type":"cites","value":3},{"source":878,"target":203,"type":"cites","value":4},{"source":729,"target":442,"type":"cites","value":12},{"source":264,"target":729,"type":"cites","value":5},{"source":879,"target":199,"type":"cites","value":3},{"source":879,"target":282,"type":"cites","value":3},{"source":880,"target":199,"type":"cites","value":3},{"source":880,"target":282,"type":"cites","value":3},{"source":881,"target":784,"type":"cites","value":3},{"source":881,"target":882,"type":"cites","value":3},{"source":881,"target":883,"type":"cites","value":3},{"source":881,"target":42,"type":"cites","value":4},{"source":42,"target":882,"type":"cites","value":3},{"source":42,"target":883,"type":"cites","value":3},{"source":561,"target":441,"type":"cites","value":3},{"source":884,"target":283,"type":"cites","value":5},{"source":561,"target":283,"type":"cites","value":6},{"source":618,"target":20,"type":"cites","value":8},{"source":618,"target":885,"type":"cites","value":4},{"source":42,"target":779,"type":"cites","value":5},{"source":886,"target":282,"type":"cites","value":4},{"source":886,"target":199,"type":"cites","value":5},{"source":887,"target":282,"type":"cites","value":3},{"source":887,"target":199,"type":"cites","value":4},{"source":888,"target":282,"type":"cites","value":3},{"source":888,"target":199,"type":"cites","value":4},{"source":426,"target":282,"type":"cites","value":4},{"source":426,"target":199,"type":"cites","value":5},{"source":889,"target":332,"type":"cites","value":4},{"source":889,"target":203,"type":"cites","value":6},{"source":442,"target":729,"type":"cites","value":3},{"source":890,"target":23,"type":"cites","value":4},{"source":401,"target":23,"type":"cites","value":4},{"source":891,"target":23,"type":"cites","value":4},{"source":220,"target":23,"type":"cites","value":4},{"source":274,"target":538,"type":"cites","value":3},{"source":892,"target":425,"type":"cites","value":3},{"source":893,"target":425,"type":"cites","value":3},{"source":894,"target":425,"type":"cites","value":3},{"source":395,"target":895,"type":"cites","value":4},{"source":395,"target":42,"type":"cites","value":3},{"source":395,"target":526,"type":"cites","value":3},{"source":896,"target":231,"type":"cites","value":4},{"source":231,"target":820,"type":"cites","value":4},{"source":290,"target":684,"type":"cites","value":3},{"source":290,"target":77,"type":"cites","value":3},{"source":209,"target":818,"type":"cites","value":4},{"source":209,"target":819,"type":"cites","value":6},{"source":209,"target":897,"type":"cites","value":3},{"source":209,"target":898,"type":"cites","value":3},{"source":133,"target":899,"type":"cites","value":3},{"source":133,"target":683,"type":"cites","value":3},{"source":900,"target":901,"type":"cites","value":3},{"source":900,"target":609,"type":"cites","value":3},{"source":902,"target":901,"type":"cites","value":3},{"source":902,"target":609,"type":"cites","value":3},{"source":465,"target":901,"type":"cites","value":3},{"source":465,"target":609,"type":"cites","value":3},{"source":900,"target":80,"type":"cites","value":3},{"source":902,"target":80,"type":"cites","value":3},{"source":465,"target":80,"type":"cites","value":3},{"source":13,"target":209,"type":"cites","value":4},{"source":45,"target":739,"type":"cites","value":7},{"source":903,"target":23,"type":"cites","value":3},{"source":45,"target":231,"type":"cites","value":3},{"source":904,"target":99,"type":"cites","value":3},{"source":905,"target":99,"type":"cites","value":3},{"source":906,"target":99,"type":"cites","value":3},{"source":907,"target":99,"type":"cites","value":3},{"source":908,"target":99,"type":"cites","value":3},{"source":176,"target":227,"type":"cites","value":4},{"source":909,"target":84,"type":"cites","value":3},{"source":739,"target":236,"type":"cites","value":3},{"source":134,"target":283,"type":"cites","value":6},{"source":45,"target":467,"type":"cites","value":3},{"source":819,"target":818,"type":"cites","value":4},{"source":819,"target":565,"type":"cites","value":4},{"source":819,"target":566,"type":"cites","value":4},{"source":910,"target":267,"type":"cites","value":4},{"source":910,"target":9,"type":"cites","value":3},{"source":910,"target":45,"type":"cites","value":5},{"source":527,"target":911,"type":"cites","value":3},{"source":527,"target":912,"type":"cites","value":3},{"source":913,"target":222,"type":"cites","value":3},{"source":684,"target":441,"type":"cites","value":3},{"source":559,"target":283,"type":"cites","value":8},{"source":559,"target":261,"type":"cites","value":4},{"source":559,"target":260,"type":"cites","value":3},{"source":559,"target":914,"type":"cites","value":3},{"source":915,"target":20,"type":"cites","value":6},{"source":528,"target":80,"type":"cites","value":3},{"source":916,"target":528,"type":"cites","value":6},{"source":917,"target":528,"type":"cites","value":6},{"source":536,"target":528,"type":"cites","value":6},{"source":918,"target":528,"type":"cites","value":6},{"source":916,"target":471,"type":"cites","value":4},{"source":917,"target":471,"type":"cites","value":4},{"source":536,"target":471,"type":"cites","value":4},{"source":918,"target":471,"type":"cites","value":4},{"source":618,"target":528,"type":"cites","value":3},{"source":548,"target":20,"type":"cites","value":4},{"source":828,"target":559,"type":"cites","value":3},{"source":618,"target":559,"type":"cites","value":4},{"source":20,"target":559,"type":"cites","value":3},{"source":20,"target":441,"type":"cites","value":4},{"source":20,"target":440,"type":"cites","value":4},{"source":20,"target":560,"type":"cites","value":4},{"source":828,"target":885,"type":"cites","value":3},{"source":828,"target":919,"type":"cites","value":3},{"source":828,"target":327,"type":"cites","value":3},{"source":828,"target":20,"type":"cites","value":7},{"source":618,"target":828,"type":"cites","value":3},{"source":20,"target":828,"type":"cites","value":10},{"source":20,"target":885,"type":"cites","value":4},{"source":20,"target":919,"type":"cites","value":4},{"source":41,"target":920,"type":"cites","value":3},{"source":758,"target":283,"type":"cites","value":3},{"source":757,"target":283,"type":"cites","value":3},{"source":759,"target":283,"type":"cites","value":3},{"source":921,"target":548,"type":"cites","value":4},{"source":921,"target":549,"type":"cites","value":4},{"source":548,"target":922,"type":"cites","value":5},{"source":548,"target":923,"type":"cites","value":5},{"source":559,"target":548,"type":"cites","value":9},{"source":559,"target":549,"type":"cites","value":9},{"source":921,"target":559,"type":"cites","value":3},{"source":921,"target":699,"type":"cites","value":3},{"source":921,"target":700,"type":"cites","value":3},{"source":921,"target":701,"type":"cites","value":3},{"source":921,"target":293,"type":"cites","value":3},{"source":548,"target":559,"type":"cites","value":4},{"source":921,"target":376,"type":"cites","value":3},{"source":548,"target":376,"type":"cites","value":3},{"source":559,"target":376,"type":"cites","value":3},{"source":924,"target":487,"type":"cites","value":3},{"source":924,"target":488,"type":"cites","value":3},{"source":925,"target":487,"type":"cites","value":3},{"source":925,"target":488,"type":"cites","value":3},{"source":616,"target":487,"type":"cites","value":3},{"source":616,"target":488,"type":"cites","value":3},{"source":924,"target":283,"type":"cites","value":4},{"source":925,"target":283,"type":"cites","value":4},{"source":924,"target":527,"type":"cites","value":8},{"source":924,"target":530,"type":"cites","value":7},{"source":924,"target":528,"type":"cites","value":13},{"source":924,"target":395,"type":"cites","value":7},{"source":926,"target":527,"type":"cites","value":5},{"source":926,"target":530,"type":"cites","value":5},{"source":926,"target":528,"type":"cites","value":6},{"source":926,"target":395,"type":"cites","value":4},{"source":925,"target":527,"type":"cites","value":8},{"source":925,"target":530,"type":"cites","value":7},{"source":925,"target":528,"type":"cites","value":13},{"source":925,"target":395,"type":"cites","value":7},{"source":616,"target":527,"type":"cites","value":4},{"source":616,"target":530,"type":"cites","value":3},{"source":616,"target":528,"type":"cites","value":7},{"source":924,"target":599,"type":"cites","value":3},{"source":483,"target":599,"type":"cites","value":3},{"source":925,"target":599,"type":"cites","value":3},{"source":702,"target":199,"type":"cites","value":4},{"source":927,"target":199,"type":"cites","value":4},{"source":927,"target":494,"type":"cites","value":3},{"source":927,"target":495,"type":"cites","value":3},{"source":927,"target":80,"type":"cites","value":3},{"source":928,"target":222,"type":"cites","value":7},{"source":929,"target":222,"type":"cites","value":7},{"source":930,"target":222,"type":"cites","value":6},{"source":931,"target":222,"type":"cites","value":7},{"source":928,"target":374,"type":"cites","value":3},{"source":928,"target":161,"type":"cites","value":6},{"source":600,"target":374,"type":"cites","value":3},{"source":932,"target":161,"type":"cites","value":3},{"source":929,"target":374,"type":"cites","value":3},{"source":929,"target":161,"type":"cites","value":6},{"source":928,"target":600,"type":"cites","value":4},{"source":929,"target":600,"type":"cites","value":4},{"source":930,"target":600,"type":"cites","value":3},{"source":931,"target":600,"type":"cites","value":4},{"source":933,"target":395,"type":"cites","value":3},{"source":846,"target":395,"type":"cites","value":6},{"source":934,"target":395,"type":"cites","value":3},{"source":933,"target":721,"type":"cites","value":3},{"source":933,"target":776,"type":"cites","value":3},{"source":933,"target":483,"type":"cites","value":3},{"source":846,"target":721,"type":"cites","value":3},{"source":846,"target":776,"type":"cites","value":3},{"source":846,"target":483,"type":"cites","value":3},{"source":934,"target":721,"type":"cites","value":3},{"source":934,"target":776,"type":"cites","value":3},{"source":934,"target":483,"type":"cites","value":3},{"source":935,"target":525,"type":"cites","value":4},{"source":935,"target":526,"type":"cites","value":4},{"source":935,"target":116,"type":"cites","value":3},{"source":80,"target":936,"type":"cites","value":3},{"source":937,"target":440,"type":"cites","value":5},{"source":937,"target":560,"type":"cites","value":4},{"source":937,"target":339,"type":"cites","value":6},{"source":938,"target":325,"type":"cites","value":4},{"source":938,"target":448,"type":"cites","value":4},{"source":938,"target":66,"type":"cites","value":4},{"source":939,"target":325,"type":"cites","value":4},{"source":939,"target":448,"type":"cites","value":4},{"source":939,"target":66,"type":"cites","value":4},{"source":477,"target":726,"type":"cites","value":3},{"source":477,"target":778,"type":"cites","value":3},{"source":84,"target":539,"type":"cites","value":3},{"source":390,"target":395,"type":"cites","value":3},{"source":496,"target":441,"type":"cites","value":3},{"source":696,"target":124,"type":"cites","value":3},{"source":940,"target":585,"type":"cites","value":3},{"source":940,"target":298,"type":"cites","value":3},{"source":940,"target":41,"type":"cites","value":4},{"source":941,"target":585,"type":"cites","value":3},{"source":941,"target":298,"type":"cites","value":3},{"source":941,"target":41,"type":"cites","value":4},{"source":940,"target":483,"type":"cites","value":4},{"source":941,"target":483,"type":"cites","value":4},{"source":275,"target":124,"type":"cites","value":7},{"source":275,"target":376,"type":"cites","value":4},{"source":275,"target":161,"type":"cites","value":4},{"source":275,"target":185,"type":"cites","value":4},{"source":878,"target":730,"type":"cites","value":3},{"source":729,"target":525,"type":"cites","value":5},{"source":729,"target":730,"type":"cites","value":5},{"source":729,"target":42,"type":"cites","value":3},{"source":264,"target":525,"type":"cites","value":5},{"source":264,"target":42,"type":"cites","value":3},{"source":729,"target":526,"type":"cites","value":4},{"source":264,"target":526,"type":"cites","value":4},{"source":729,"target":23,"type":"cites","value":4},{"source":264,"target":23,"type":"cites","value":4},{"source":729,"target":600,"type":"cites","value":3},{"source":729,"target":376,"type":"cites","value":5},{"source":942,"target":477,"type":"cites","value":3},{"source":943,"target":282,"type":"cites","value":3},{"source":943,"target":199,"type":"cites","value":3},{"source":489,"target":282,"type":"cites","value":3},{"source":489,"target":199,"type":"cites","value":3},{"source":943,"target":528,"type":"cites","value":3},{"source":489,"target":528,"type":"cites","value":3},{"source":161,"target":528,"type":"cites","value":3},{"source":944,"target":442,"type":"cites","value":7},{"source":944,"target":203,"type":"cites","value":7},{"source":944,"target":66,"type":"cites","value":3},{"source":42,"target":203,"type":"cites","value":5},{"source":427,"target":283,"type":"cites","value":4},{"source":427,"target":482,"type":"cites","value":3},{"source":945,"target":283,"type":"cites","value":3},{"source":946,"target":283,"type":"cites","value":3},{"source":947,"target":395,"type":"cites","value":4},{"source":948,"target":395,"type":"cites","value":5},{"source":949,"target":212,"type":"cites","value":3},{"source":950,"target":212,"type":"cites","value":3},{"source":284,"target":212,"type":"cites","value":7},{"source":284,"target":20,"type":"cites","value":3},{"source":284,"target":376,"type":"cites","value":3},{"source":284,"target":264,"type":"cites","value":4},{"source":889,"target":283,"type":"cites","value":5},{"source":480,"target":36,"type":"cites","value":4},{"source":951,"target":283,"type":"cites","value":4},{"source":952,"target":283,"type":"cites","value":5},{"source":952,"target":329,"type":"cites","value":4},{"source":952,"target":331,"type":"cites","value":4},{"source":953,"target":41,"type":"cites","value":3},{"source":954,"target":41,"type":"cites","value":3},{"source":955,"target":41,"type":"cites","value":3},{"source":956,"target":41,"type":"cites","value":3},{"source":957,"target":45,"type":"cites","value":6},{"source":957,"target":739,"type":"cites","value":4},{"source":45,"target":958,"type":"cites","value":3},{"source":45,"target":959,"type":"cites","value":3},{"source":45,"target":957,"type":"cites","value":3},{"source":45,"target":960,"type":"cites","value":3},{"source":45,"target":279,"type":"cites","value":3},{"source":961,"target":13,"type":"cites","value":4},{"source":962,"target":564,"type":"cites","value":3},{"source":962,"target":220,"type":"cites","value":4},{"source":963,"target":220,"type":"cites","value":3},{"source":962,"target":209,"type":"cites","value":6},{"source":963,"target":209,"type":"cites","value":4},{"source":962,"target":819,"type":"cites","value":3},{"source":964,"target":133,"type":"cites","value":5},{"source":740,"target":133,"type":"cites","value":4},{"source":740,"target":10,"type":"cites","value":3},{"source":740,"target":652,"type":"cites","value":3},{"source":740,"target":151,"type":"cites","value":3},{"source":176,"target":310,"type":"cites","value":3},{"source":965,"target":71,"type":"cites","value":3},{"source":966,"target":71,"type":"cites","value":3},{"source":967,"target":380,"type":"cites","value":4},{"source":967,"target":290,"type":"cites","value":3},{"source":968,"target":380,"type":"cites","value":3},{"source":968,"target":290,"type":"cites","value":3},{"source":969,"target":380,"type":"cites","value":3},{"source":969,"target":290,"type":"cites","value":3},{"source":970,"target":395,"type":"cites","value":3},{"source":971,"target":395,"type":"cites","value":5},{"source":970,"target":171,"type":"cites","value":3},{"source":971,"target":171,"type":"cites","value":3},{"source":471,"target":171,"type":"cites","value":3},{"source":970,"target":36,"type":"cites","value":3},{"source":471,"target":487,"type":"cites","value":4},{"source":471,"target":488,"type":"cites","value":3},{"source":970,"target":471,"type":"cites","value":3},{"source":971,"target":528,"type":"cites","value":3},{"source":971,"target":846,"type":"cites","value":3},{"source":471,"target":238,"type":"cites","value":4},{"source":471,"target":846,"type":"cites","value":6},{"source":972,"target":548,"type":"cites","value":3},{"source":390,"target":548,"type":"cites","value":3},{"source":972,"target":528,"type":"cites","value":3},{"source":618,"target":548,"type":"cites","value":5},{"source":618,"target":549,"type":"cites","value":4},{"source":973,"target":921,"type":"cites","value":5},{"source":973,"target":548,"type":"cites","value":6},{"source":973,"target":549,"type":"cites","value":6},{"source":973,"target":559,"type":"cites","value":16},{"source":559,"target":921,"type":"cites","value":8},{"source":973,"target":699,"type":"cites","value":3},{"source":973,"target":700,"type":"cites","value":3},{"source":973,"target":293,"type":"cites","value":3},{"source":973,"target":701,"type":"cites","value":3},{"source":973,"target":828,"type":"cites","value":3},{"source":973,"target":618,"type":"cites","value":5},{"source":973,"target":327,"type":"cites","value":3},{"source":973,"target":20,"type":"cites","value":3},{"source":548,"target":618,"type":"cites","value":6},{"source":559,"target":828,"type":"cites","value":3},{"source":559,"target":618,"type":"cites","value":5},{"source":559,"target":327,"type":"cites","value":3},{"source":559,"target":20,"type":"cites","value":3},{"source":973,"target":703,"type":"cites","value":6},{"source":973,"target":441,"type":"cites","value":4},{"source":974,"target":282,"type":"cites","value":3},{"source":974,"target":199,"type":"cites","value":3},{"source":588,"target":282,"type":"cites","value":4},{"source":975,"target":441,"type":"cites","value":4},{"source":975,"target":559,"type":"cites","value":8},{"source":975,"target":703,"type":"cites","value":3},{"source":889,"target":292,"type":"cites","value":3},{"source":976,"target":588,"type":"cites","value":3},{"source":976,"target":20,"type":"cites","value":5},{"source":928,"target":283,"type":"cites","value":5},{"source":929,"target":283,"type":"cites","value":5},{"source":600,"target":715,"type":"cites","value":3},{"source":928,"target":929,"type":"cites","value":3},{"source":600,"target":928,"type":"cites","value":4},{"source":600,"target":929,"type":"cites","value":4},{"source":600,"target":930,"type":"cites","value":3},{"source":600,"target":931,"type":"cites","value":3},{"source":929,"target":928,"type":"cites","value":3},{"source":931,"target":928,"type":"cites","value":3},{"source":931,"target":929,"type":"cites","value":3},{"source":931,"target":930,"type":"cites","value":3},{"source":20,"target":548,"type":"cites","value":5},{"source":20,"target":549,"type":"cites","value":4},{"source":828,"target":539,"type":"cites","value":4},{"source":828,"target":77,"type":"cites","value":3},{"source":20,"target":539,"type":"cites","value":9},{"source":20,"target":477,"type":"cites","value":3},{"source":212,"target":222,"type":"cites","value":4},{"source":539,"target":329,"type":"cites","value":7},{"source":539,"target":330,"type":"cites","value":6},{"source":539,"target":331,"type":"cites","value":4},{"source":599,"target":428,"type":"cites","value":3},{"source":928,"target":333,"type":"cites","value":3},{"source":929,"target":333,"type":"cites","value":3},{"source":599,"target":551,"type":"cites","value":3},{"source":599,"target":260,"type":"cites","value":3},{"source":928,"target":551,"type":"cites","value":3},{"source":928,"target":260,"type":"cites","value":3},{"source":600,"target":551,"type":"cites","value":3},{"source":600,"target":260,"type":"cites","value":3},{"source":929,"target":551,"type":"cites","value":3},{"source":929,"target":260,"type":"cites","value":3},{"source":329,"target":77,"type":"cites","value":3},{"source":673,"target":834,"type":"cites","value":3},{"source":275,"target":834,"type":"cites","value":3},{"source":275,"target":341,"type":"cites","value":5},{"source":275,"target":204,"type":"cites","value":3},{"source":274,"target":283,"type":"cites","value":4},{"source":977,"target":395,"type":"cites","value":3},{"source":978,"target":395,"type":"cites","value":5},{"source":979,"target":395,"type":"cites","value":3},{"source":977,"target":528,"type":"cites","value":6},{"source":978,"target":528,"type":"cites","value":6},{"source":980,"target":528,"type":"cites","value":3},{"source":979,"target":528,"type":"cites","value":7},{"source":977,"target":434,"type":"cites","value":3},{"source":978,"target":434,"type":"cites","value":5},{"source":979,"target":434,"type":"cites","value":3},{"source":979,"target":9,"type":"cites","value":3},{"source":978,"target":332,"type":"cites","value":3},{"source":981,"target":124,"type":"cites","value":4},{"source":982,"target":380,"type":"cites","value":4},{"source":390,"target":380,"type":"cites","value":4},{"source":390,"target":442,"type":"cites","value":3},{"source":982,"target":482,"type":"cites","value":3},{"source":982,"target":283,"type":"cites","value":7},{"source":983,"target":527,"type":"cites","value":6},{"source":983,"target":530,"type":"cites","value":5},{"source":984,"target":527,"type":"cites","value":3},{"source":984,"target":530,"type":"cites","value":3},{"source":983,"target":528,"type":"cites","value":12},{"source":983,"target":395,"type":"cites","value":5},{"source":984,"target":528,"type":"cites","value":5},{"source":983,"target":283,"type":"cites","value":3},{"source":924,"target":471,"type":"cites","value":5},{"source":924,"target":734,"type":"cites","value":3},{"source":983,"target":471,"type":"cites","value":5},{"source":983,"target":734,"type":"cites","value":3},{"source":925,"target":471,"type":"cites","value":5},{"source":925,"target":734,"type":"cites","value":3},{"source":483,"target":471,"type":"cites","value":5},{"source":483,"target":734,"type":"cites","value":3},{"source":924,"target":732,"type":"cites","value":3},{"source":983,"target":732,"type":"cites","value":3},{"source":925,"target":732,"type":"cites","value":3},{"source":483,"target":732,"type":"cites","value":3},{"source":553,"target":528,"type":"cites","value":7},{"source":985,"target":528,"type":"cites","value":7},{"source":846,"target":528,"type":"cites","value":7},{"source":797,"target":732,"type":"cites","value":3},{"source":553,"target":471,"type":"cites","value":3},{"source":985,"target":471,"type":"cites","value":3},{"source":846,"target":471,"type":"cites","value":3},{"source":986,"target":341,"type":"cites","value":5},{"source":45,"target":528,"type":"cites","value":3},{"source":987,"target":423,"type":"cites","value":3},{"source":987,"target":323,"type":"cites","value":3},{"source":987,"target":84,"type":"cites","value":4},{"source":988,"target":395,"type":"cites","value":3},{"source":988,"target":528,"type":"cites","value":3},{"source":989,"target":283,"type":"cites","value":5},{"source":990,"target":525,"type":"cites","value":3},{"source":990,"target":526,"type":"cites","value":3},{"source":991,"target":525,"type":"cites","value":3},{"source":991,"target":526,"type":"cites","value":3},{"source":992,"target":525,"type":"cites","value":3},{"source":992,"target":526,"type":"cites","value":3},{"source":993,"target":442,"type":"cites","value":4},{"source":994,"target":442,"type":"cites","value":4},{"source":993,"target":437,"type":"cites","value":4},{"source":994,"target":437,"type":"cites","value":4},{"source":264,"target":437,"type":"cites","value":4},{"source":993,"target":203,"type":"cites","value":6},{"source":994,"target":203,"type":"cites","value":6},{"source":284,"target":609,"type":"cites","value":5},{"source":284,"target":329,"type":"cites","value":7},{"source":995,"target":380,"type":"cites","value":6},{"source":995,"target":264,"type":"cites","value":7},{"source":996,"target":264,"type":"cites","value":3},{"source":997,"target":380,"type":"cites","value":6},{"source":997,"target":264,"type":"cites","value":7},{"source":889,"target":42,"type":"cites","value":3},{"source":998,"target":222,"type":"cites","value":3},{"source":999,"target":283,"type":"cites","value":3},{"source":471,"target":1000,"type":"cites","value":3},{"source":260,"target":42,"type":"cites","value":3},{"source":480,"target":290,"type":"cites","value":3},{"source":1001,"target":283,"type":"cites","value":3},{"source":944,"target":161,"type":"cites","value":3},{"source":437,"target":161,"type":"cites","value":3},{"source":944,"target":526,"type":"cites","value":3},{"source":437,"target":526,"type":"cites","value":3},{"source":437,"target":386,"type":"cites","value":3},{"source":1002,"target":283,"type":"cites","value":3},{"source":1002,"target":326,"type":"cites","value":3},{"source":1003,"target":329,"type":"cites","value":6},{"source":1003,"target":330,"type":"cites","value":5},{"source":1004,"target":329,"type":"cites","value":6},{"source":1004,"target":330,"type":"cites","value":5},{"source":1005,"target":329,"type":"cites","value":6},{"source":1005,"target":330,"type":"cites","value":5},{"source":1006,"target":329,"type":"cites","value":3},{"source":1007,"target":329,"type":"cites","value":3},{"source":397,"target":329,"type":"cites","value":6},{"source":397,"target":330,"type":"cites","value":5},{"source":1008,"target":329,"type":"cites","value":6},{"source":1008,"target":330,"type":"cites","value":5},{"source":1003,"target":331,"type":"cites","value":3},{"source":1004,"target":331,"type":"cites","value":3},{"source":1005,"target":331,"type":"cites","value":3},{"source":397,"target":331,"type":"cites","value":3},{"source":284,"target":331,"type":"cites","value":3},{"source":1008,"target":331,"type":"cites","value":3},{"source":889,"target":442,"type":"cites","value":3},{"source":952,"target":442,"type":"cites","value":3},{"source":42,"target":442,"type":"cites","value":4},{"source":617,"target":203,"type":"cites","value":3},{"source":1009,"target":227,"type":"cites","value":7},{"source":1009,"target":99,"type":"cites","value":11},{"source":1010,"target":227,"type":"cites","value":4},{"source":1010,"target":99,"type":"cites","value":8},{"source":1011,"target":227,"type":"cites","value":4},{"source":1011,"target":99,"type":"cites","value":8},{"source":1009,"target":513,"type":"cites","value":5},{"source":1010,"target":513,"type":"cites","value":4},{"source":1011,"target":513,"type":"cites","value":4},{"source":1009,"target":310,"type":"cites","value":7},{"source":1010,"target":310,"type":"cites","value":5},{"source":1011,"target":310,"type":"cites","value":5},{"source":964,"target":271,"type":"cites","value":3},{"source":1012,"target":739,"type":"cites","value":4},{"source":1012,"target":45,"type":"cites","value":5},{"source":740,"target":739,"type":"cites","value":3},{"source":243,"target":12,"type":"cites","value":3},{"source":243,"target":14,"type":"cites","value":3},{"source":243,"target":13,"type":"cites","value":5},{"source":742,"target":12,"type":"cites","value":3},{"source":742,"target":14,"type":"cites","value":3},{"source":742,"target":13,"type":"cites","value":5},{"source":406,"target":12,"type":"cites","value":3},{"source":406,"target":14,"type":"cites","value":3},{"source":406,"target":13,"type":"cites","value":5},{"source":645,"target":12,"type":"cites","value":3},{"source":645,"target":14,"type":"cites","value":3},{"source":645,"target":406,"type":"cites","value":3},{"source":645,"target":243,"type":"cites","value":5},{"source":742,"target":133,"type":"cites","value":3},{"source":1013,"target":742,"type":"cites","value":3},{"source":1013,"target":406,"type":"cites","value":4},{"source":1013,"target":743,"type":"cites","value":3},{"source":1013,"target":744,"type":"cites","value":3},{"source":1013,"target":42,"type":"cites","value":4},{"source":1013,"target":243,"type":"cites","value":5},{"source":749,"target":382,"type":"cites","value":3},{"source":1014,"target":20,"type":"cites","value":3},{"source":1015,"target":487,"type":"cites","value":6},{"source":1015,"target":488,"type":"cites","value":6},{"source":528,"target":977,"type":"cites","value":3},{"source":528,"target":979,"type":"cites","value":4},{"source":275,"target":528,"type":"cites","value":3},{"source":1016,"target":828,"type":"cites","value":4},{"source":1016,"target":20,"type":"cites","value":4},{"source":849,"target":828,"type":"cites","value":3},{"source":292,"target":828,"type":"cites","value":4},{"source":20,"target":212,"type":"cites","value":5},{"source":865,"target":329,"type":"cites","value":3},{"source":1017,"target":329,"type":"cites","value":3},{"source":1018,"target":329,"type":"cites","value":3},{"source":1019,"target":329,"type":"cites","value":3},{"source":1020,"target":329,"type":"cites","value":3},{"source":1021,"target":329,"type":"cites","value":3},{"source":1022,"target":329,"type":"cites","value":3},{"source":282,"target":329,"type":"cites","value":3},{"source":199,"target":329,"type":"cites","value":3},{"source":1023,"target":559,"type":"cites","value":7},{"source":1024,"target":559,"type":"cites","value":7},{"source":1025,"target":559,"type":"cites","value":7},{"source":559,"target":973,"type":"cites","value":3},{"source":1026,"target":609,"type":"cites","value":3},{"source":1027,"target":609,"type":"cites","value":3},{"source":20,"target":609,"type":"cites","value":3},{"source":376,"target":609,"type":"cites","value":3},{"source":20,"target":528,"type":"cites","value":4},{"source":1026,"target":440,"type":"cites","value":3},{"source":1026,"target":560,"type":"cites","value":3},{"source":1026,"target":339,"type":"cites","value":3},{"source":1027,"target":440,"type":"cites","value":3},{"source":1027,"target":560,"type":"cites","value":3},{"source":1027,"target":339,"type":"cites","value":3},{"source":988,"target":124,"type":"cites","value":3},{"source":673,"target":376,"type":"cites","value":3},{"source":600,"target":339,"type":"cites","value":3},{"source":1028,"target":77,"type":"cites","value":3},{"source":1028,"target":477,"type":"cites","value":3},{"source":1029,"target":133,"type":"cites","value":3},{"source":1030,"target":133,"type":"cites","value":3},{"source":133,"target":964,"type":"cites","value":3},{"source":1031,"target":293,"type":"cites","value":6},{"source":1031,"target":700,"type":"cites","value":4},{"source":1031,"target":701,"type":"cites","value":4},{"source":1031,"target":548,"type":"cites","value":4},{"source":1031,"target":549,"type":"cites","value":3},{"source":700,"target":548,"type":"cites","value":4},{"source":700,"target":549,"type":"cites","value":3},{"source":701,"target":548,"type":"cites","value":4},{"source":701,"target":549,"type":"cites","value":3},{"source":293,"target":548,"type":"cites","value":4},{"source":293,"target":549,"type":"cites","value":3},{"source":1031,"target":559,"type":"cites","value":3},{"source":1032,"target":341,"type":"cites","value":5},{"source":1033,"target":341,"type":"cites","value":5},{"source":1034,"target":528,"type":"cites","value":6},{"source":1035,"target":339,"type":"cites","value":3},{"source":1036,"target":559,"type":"cites","value":6},{"source":978,"target":340,"type":"cites","value":4},{"source":794,"target":161,"type":"cites","value":4},{"source":1037,"target":283,"type":"cites","value":4},{"source":1038,"target":222,"type":"cites","value":3},{"source":1039,"target":222,"type":"cites","value":3},{"source":1040,"target":222,"type":"cites","value":3},{"source":971,"target":274,"type":"cites","value":3},{"source":1041,"target":274,"type":"cites","value":3},{"source":1042,"target":274,"type":"cites","value":3},{"source":851,"target":274,"type":"cites","value":3},{"source":1043,"target":274,"type":"cites","value":3},{"source":274,"target":732,"type":"cites","value":3},{"source":1044,"target":283,"type":"cites","value":5},{"source":1045,"target":283,"type":"cites","value":5},{"source":1046,"target":283,"type":"cites","value":5},{"source":952,"target":42,"type":"cites","value":3},{"source":810,"target":283,"type":"cites","value":4},{"source":1047,"target":283,"type":"cites","value":4},{"source":1048,"target":283,"type":"cites","value":4},{"source":741,"target":283,"type":"cites","value":4},{"source":1049,"target":203,"type":"cites","value":4},{"source":1050,"target":203,"type":"cites","value":4},{"source":1049,"target":442,"type":"cites","value":4},{"source":1050,"target":442,"type":"cites","value":4},{"source":540,"target":480,"type":"cites","value":3},{"source":952,"target":480,"type":"cites","value":4},{"source":1051,"target":480,"type":"cites","value":3},{"source":730,"target":480,"type":"cites","value":3},{"source":1052,"target":380,"type":"cites","value":3},{"source":1052,"target":264,"type":"cites","value":3},{"source":1053,"target":382,"type":"cites","value":3},{"source":1054,"target":84,"type":"cites","value":3},{"source":1055,"target":45,"type":"cites","value":4},{"source":1056,"target":45,"type":"cites","value":4},{"source":1057,"target":45,"type":"cites","value":4},{"source":1058,"target":45,"type":"cites","value":4},{"source":1059,"target":133,"type":"cites","value":3},{"source":279,"target":133,"type":"cites","value":3},{"source":1060,"target":45,"type":"cites","value":3},{"source":1061,"target":45,"type":"cites","value":3},{"source":226,"target":45,"type":"cites","value":3},{"source":562,"target":45,"type":"cites","value":3},{"source":243,"target":231,"type":"cites","value":3},{"source":1062,"target":231,"type":"cites","value":3},{"source":280,"target":231,"type":"cites","value":3},{"source":359,"target":231,"type":"cites","value":3},{"source":1063,"target":283,"type":"cites","value":3},{"source":1064,"target":283,"type":"cites","value":3},{"source":1065,"target":395,"type":"cites","value":3},{"source":1066,"target":395,"type":"cites","value":3},{"source":1067,"target":395,"type":"cites","value":3},{"source":1068,"target":395,"type":"cites","value":3},{"source":1069,"target":395,"type":"cites","value":3},{"source":1070,"target":395,"type":"cites","value":3},{"source":1071,"target":395,"type":"cites","value":3},{"source":1072,"target":487,"type":"cites","value":4},{"source":1072,"target":488,"type":"cites","value":4},{"source":1073,"target":528,"type":"cites","value":5},{"source":1074,"target":528,"type":"cites","value":5},{"source":1075,"target":528,"type":"cites","value":5},{"source":1076,"target":341,"type":"cites","value":3},{"source":1077,"target":124,"type":"cites","value":3},{"source":1078,"target":212,"type":"cites","value":3},{"source":1079,"target":212,"type":"cites","value":3},{"source":1080,"target":212,"type":"cites","value":3},{"source":285,"target":212,"type":"cites","value":3},{"source":1081,"target":212,"type":"cites","value":3},{"source":1082,"target":293,"type":"cites","value":3},{"source":1083,"target":293,"type":"cites","value":3},{"source":1084,"target":45,"type":"cites","value":3},{"source":505,"target":45,"type":"cites","value":3},{"source":371,"target":45,"type":"cites","value":3},{"source":1085,"target":45,"type":"cites","value":3},{"source":1084,"target":77,"type":"cites","value":3},{"source":740,"target":77,"type":"cites","value":3},{"source":371,"target":77,"type":"cites","value":3},{"source":1085,"target":77,"type":"cites","value":3}],"nodes":[{"name":"Gregory M. Nielson","value":213,"numPapers":24,"cluster":"6","visible":1,"index":0,"weight":10,"x":221.98070566865013,"y":447.2655534573115,"px":228.53429598646002,"py":446.646198512824,"node":{"Conference":"Vis","Year":"1990","Title":"Visualization of irregular multivariate data","DOI":"10.1109/VISUAL.1990.146388","Link":"http://dx.doi.org/10.1109/VISUAL.1990.146388","FirstPage":"247","LastPage":"254, 478-9","PaperType":"C","Abstract":"The authors discuss effective techniques for representing scalar and vector valued functions that interpolate to irregularly located data. Special attention is given to the situations where the sampling domain is a two-dimensional plane, 3-D volume, or a closed 3-D surface. The authors first discuss the multiquadric and thin-plate spline methods for interpolating scalar data sampled at arbitrary locations in a plane. Straightforward generalizations are then made to data sampled in 3-D volumetric regions as well as in higher dimensional spaces. The globally defined interpolants can be evaluated on a fine regular grid and they can then be visualized using conventional techniques. Triangular and tetrahedral based visualization techniques are also presented.<<ETX>>","AuthorNamesDeduped":"Thomas A. Foley;David A. Lane","AuthorNames":"T.A. Foley;D.A. Lane","AuthorAffiliation":"Dept. of Comput. Sci., Arizona State Univ., Tempe, AZ, USA;Dept. of Comput. Sci., Arizona State Univ., Tempe, AZ, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"50","XPloreCitationCount022019":"7","PubsCited":"31","Award":""}},{"name":"Bernd Hamann","value":551,"numPapers":107,"cluster":"6","visible":1,"index":1,"weight":42,"x":258.1101199221297,"y":442.9189138952297,"px":264.0874061082175,"py":441.7956665349316,"node":{"Conference":"Vis","Year":"1990","Title":"Visualization of irregular multivariate data","DOI":"10.1109/VISUAL.1990.146388","Link":"http://dx.doi.org/10.1109/VISUAL.1990.146388","FirstPage":"247","LastPage":"254, 478-9","PaperType":"C","Abstract":"The authors discuss effective techniques for representing scalar and vector valued functions that interpolate to irregularly located data. Special attention is given to the situations where the sampling domain is a two-dimensional plane, 3-D volume, or a closed 3-D surface. The authors first discuss the multiquadric and thin-plate spline methods for interpolating scalar data sampled at arbitrary locations in a plane. Straightforward generalizations are then made to data sampled in 3-D volumetric regions as well as in higher dimensional spaces. The globally defined interpolants can be evaluated on a fine regular grid and they can then be visualized using conventional techniques. Triangular and tetrahedral based visualization techniques are also presented.<<ETX>>","AuthorNamesDeduped":"Thomas A. Foley;David A. Lane","AuthorNames":"T.A. Foley;D.A. Lane","AuthorAffiliation":"Dept. of Comput. Sci., Arizona State Univ., Tempe, AZ, USA;Dept. of Comput. Sci., Arizona State Univ., Tempe, AZ, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"50","XPloreCitationCount022019":"7","PubsCited":"31","Award":""}},{"name":"T. Todd Elvins","value":14,"numPapers":8,"cluster":"14","visible":1,"index":2,"weight":1,"x":1419.5521943891742,"y":864.9868605994413,"px":1416.854884631617,"py":862.2083999685206,"node":{"Conference":"Vis","Year":"1990","Title":"A procedural interface for volume rendering","DOI":"10.1109/VISUAL.1990.146362","Link":"http://dx.doi.org/10.1109/VISUAL.1990.146362","FirstPage":"36","LastPage":"44, 462","PaperType":"C","Abstract":"The author presents a simple, procedural interface for volume rendering. The interface is built on three types of objects: volumes, which contain the data to be visualized, environments, which set up viewing and lighting, and image objects, which convert results to a user-definable format. A volume is rendered against a particular environment with the results sent to an image object for conversion. By defining volume qualities such as color, opacity, and gradient in terms of user-definable transfer functions, the rendering process is made independent of the data set's underlying representation.<<ETX>>","AuthorNamesDeduped":"James L. Montine","AuthorNames":"J.L. Montine","AuthorAffiliation":"Alliant Comput. Syst., Littleton, MA, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"","XPloreCitationCount022019":"3","PubsCited":"9","Award":""}},{"name":"David R. Nadeau","value":14,"numPapers":6,"cluster":"14","visible":1,"index":3,"weight":1,"x":1390.7765933166597,"y":913.1338869345192,"px":1388.254542932318,"py":910.1829879508056,"node":{"Conference":"Vis","Year":"1990","Title":"A procedural interface for volume rendering","DOI":"10.1109/VISUAL.1990.146362","Link":"http://dx.doi.org/10.1109/VISUAL.1990.146362","FirstPage":"36","LastPage":"44, 462","PaperType":"C","Abstract":"The author presents a simple, procedural interface for volume rendering. The interface is built on three types of objects: volumes, which contain the data to be visualized, environments, which set up viewing and lighting, and image objects, which convert results to a user-definable format. A volume is rendered against a particular environment with the results sent to an image object for conversion. By defining volume qualities such as color, opacity, and gradient in terms of user-definable transfer functions, the rendering process is made independent of the data set's underlying representation.<<ETX>>","AuthorNamesDeduped":"James L. Montine","AuthorNames":"J.L. Montine","AuthorAffiliation":"Alliant Comput. Syst., Littleton, MA, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"","XPloreCitationCount022019":"3","PubsCited":"9","Award":""}},{"name":"Andrew J. Hanson","value":198,"numPapers":58,"cluster":"15","visible":1,"index":4,"weight":16,"x":229.55411898962396,"y":152.29577617138523,"px":234.18408847006376,"py":158.91082435529074,"node":{"Conference":"Vis","Year":"1990","Title":"Techniques for visualizing Fermat's last theorem: a case study","DOI":"10.1109/VISUAL.1990.146370","Link":"http://dx.doi.org/10.1109/VISUAL.1990.146370","FirstPage":"97","LastPage":"106, 467-8","PaperType":"C","Abstract":"The authors describe some mathematical approaches and computer graphics techniques for illustrating concepts related to Fermat's last theorem. They present a selection of visualization methods, and describe observations made in the process of creating a three-minute computer animated videotape dealing with some elementary aspects of Fermat's last theorem, a problem in number theory. The approach to the representation of the different concepts presented in the video was influenced by many factors: the available hardware, real and perceived constraints of the available software, constraints imposed by the video medium, and a number of peculiarities and features of the mathematical domain itself. The authors describe the experiences with the software systems that played a part in these efforts, some specific successful visualization techniques, and some unexpected mathematical insights.<<ETX>>","AuthorNamesDeduped":"Andrew J. Hanson;Pheng-Ann Heng;B. C. Kaplan","AuthorNames":"A.J. Hanson;P.A. Heng;B.C. Kaplan","AuthorAffiliation":"Indiana Univ., Bloomington, IN, USA;Indiana Univ., Bloomington, IN, USA;Indiana Univ., Bloomington, IN, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"1","XPloreCitationCount022019":"2","PubsCited":"5","Award":""}},{"name":"Pheng-Ann Heng","value":37,"numPapers":15,"cluster":"15","visible":1,"index":5,"weight":3,"x":94.08102597519158,"y":0.6356914904246107,"px":99.05194376254205,"py":7.711636818865362,"node":{"Conference":"Vis","Year":"1990","Title":"Techniques for visualizing Fermat's last theorem: a case study","DOI":"10.1109/VISUAL.1990.146370","Link":"http://dx.doi.org/10.1109/VISUAL.1990.146370","FirstPage":"97","LastPage":"106, 467-8","PaperType":"C","Abstract":"The authors describe some mathematical approaches and computer graphics techniques for illustrating concepts related to Fermat's last theorem. They present a selection of visualization methods, and describe observations made in the process of creating a three-minute computer animated videotape dealing with some elementary aspects of Fermat's last theorem, a problem in number theory. The approach to the representation of the different concepts presented in the video was influenced by many factors: the available hardware, real and perceived constraints of the available software, constraints imposed by the video medium, and a number of peculiarities and features of the mathematical domain itself. The authors describe the experiences with the software systems that played a part in these efforts, some specific successful visualization techniques, and some unexpected mathematical insights.<<ETX>>","AuthorNamesDeduped":"Andrew J. Hanson;Pheng-Ann Heng;B. C. Kaplan","AuthorNames":"A.J. Hanson;P.A. Heng;B.C. Kaplan","AuthorAffiliation":"Indiana Univ., Bloomington, IN, USA;Indiana Univ., Bloomington, IN, USA;Indiana Univ., Bloomington, IN, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"1","XPloreCitationCount022019":"2","PubsCited":"5","Award":""}},{"name":"William J. Schroeder","value":214,"numPapers":27,"cluster":"13","visible":1,"index":6,"weight":1,"x":-38.29402091200208,"y":1196.2195055923276,"px":-38.261427621014334,"py":1189.9096263038293,"node":{"Conference":"Vis","Year":"1991","Title":"The stream polygon: A technique for 3D vector field visualization","DOI":"10.1109/VISUAL.1991.175789","Link":"http://dx.doi.org/10.1109/VISUAL.1991.175789","FirstPage":"126","LastPage":"132, 417","PaperType":"C","Abstract":"A method is presented for the visualization of 3D vector fields. The stream polygon, which is a regular, n-sided polygon, oriented normal to the local vector, can present local deformations due to rigid body rotation and both normal and shear strain. The effect of translation and scalar functions can be represented by sweeping the stream polygon along the streamline, and by appropriately varying the radius and shading the surface of the resulting streamtube. A mathematical foundation for the stream is developed, and examples with application to velocity field visualization are provided.<<ETX>>","AuthorNamesDeduped":"William J. Schroeder;Christopher R. Volpe;William E. Lorensen","AuthorNames":"W.J. Schroeder;C.R. Volpe;W.E. Lorensen","AuthorAffiliation":"General Electric Corp. Res. & Dev., Schenectady, NY, USA;General Electric Corp. Res. & Dev., Schenectady, NY, USA;General Electric Corp. Res. & Dev., Schenectady, NY, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"134","XPloreCitationCount022019":"35","PubsCited":"10","Award":""}},{"name":"William E. Lorensen","value":132,"numPapers":8,"cluster":"13","visible":1,"index":7,"weight":2,"x":9.031469923683712,"y":1200.0298093109823,"px":8.72418334676165,"py":1193.111582716378,"node":{"Conference":"Vis","Year":"1991","Title":"The stream polygon: A technique for 3D vector field visualization","DOI":"10.1109/VISUAL.1991.175789","Link":"http://dx.doi.org/10.1109/VISUAL.1991.175789","FirstPage":"126","LastPage":"132, 417","PaperType":"C","Abstract":"A method is presented for the visualization of 3D vector fields. The stream polygon, which is a regular, n-sided polygon, oriented normal to the local vector, can present local deformations due to rigid body rotation and both normal and shear strain. The effect of translation and scalar functions can be represented by sweeping the stream polygon along the streamline, and by appropriately varying the radius and shading the surface of the resulting streamtube. A mathematical foundation for the stream is developed, and examples with application to velocity field visualization are provided.<<ETX>>","AuthorNamesDeduped":"William J. Schroeder;Christopher R. Volpe;William E. Lorensen","AuthorNames":"W.J. Schroeder;C.R. Volpe;W.E. Lorensen","AuthorAffiliation":"General Electric Corp. Res. & Dev., Schenectady, NY, USA;General Electric Corp. Res. & Dev., Schenectady, NY, USA;General Electric Corp. Res. & Dev., Schenectady, NY, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"134","XPloreCitationCount022019":"35","PubsCited":"10","Award":""}},{"name":"Christopher R. Volpe","value":62,"numPapers":7,"cluster":"13","visible":1,"index":8,"weight":1,"x":-50.54549796509761,"y":1155.018550454763,"px":-51.12786410060418,"py":1148.3720653559724,"node":{"Conference":"Vis","Year":"1991","Title":"The stream polygon: A technique for 3D vector field visualization","DOI":"10.1109/VISUAL.1991.175789","Link":"http://dx.doi.org/10.1109/VISUAL.1991.175789","FirstPage":"126","LastPage":"132, 417","PaperType":"C","Abstract":"A method is presented for the visualization of 3D vector fields. The stream polygon, which is a regular, n-sided polygon, oriented normal to the local vector, can present local deformations due to rigid body rotation and both normal and shear strain. The effect of translation and scalar functions can be represented by sweeping the stream polygon along the streamline, and by appropriately varying the radius and shading the surface of the resulting streamtube. A mathematical foundation for the stream is developed, and examples with application to velocity field visualization are provided.<<ETX>>","AuthorNamesDeduped":"William J. Schroeder;Christopher R. Volpe;William E. Lorensen","AuthorNames":"W.J. Schroeder;C.R. Volpe;W.E. Lorensen","AuthorAffiliation":"General Electric Corp. Res. & Dev., Schenectady, NY, USA;General Electric Corp. Res. & Dev., Schenectady, NY, USA;General Electric Corp. Res. & Dev., Schenectady, NY, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"134","XPloreCitationCount022019":"35","PubsCited":"10","Award":""}},{"name":"Kwan-Liu Ma","value":1000,"numPapers":277,"cluster":"5","visible":1,"index":9,"weight":74,"x":456.0422520644601,"y":410.0216229543128,"px":459.60687529729046,"py":409.8870842147775,"node":{"Conference":"Vis","Year":"1991","Title":"Volume rendering of flow-visualization point data","DOI":"10.1109/VISUAL.1991.175772","Link":"http://dx.doi.org/10.1109/VISUAL.1991.175772","FirstPage":"25","LastPage":"32","PaperType":"C","Abstract":"A survey of 2D and 3D flow visualization techniques is provided. The approach is based on applying volume rendering to flow-visualization data. Linear interpolation and B-spline approximation are used, and several views are given for both. Suggestions for efficient volume rendering are provided.<<ETX>>","AuthorNamesDeduped":"Paul Gene Swann;Sudhanshu Kumar Semwal","AuthorNames":"P.G. Swann;S.K. Semwal","AuthorAffiliation":"Dept. of Comput. Sci., Colorado Univ., Colorado Springs, CO, USA;Dept. of Comput. Sci., Colorado Univ., Colorado Springs, CO, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"50","XPloreCitationCount022019":"4","PubsCited":"27","Award":""}},{"name":"Ross T. Whitaker","value":334,"numPapers":47,"cluster":"4","visible":1,"index":10,"weight":18,"x":363.52747852473,"y":404.68588822350563,"px":368.09804866617145,"py":405.0990625671494,"node":{"Conference":"Vis","Year":"1991","Title":"Achieving direct volume visualization with interactive semantic region selection","DOI":"10.1109/VISUAL.1991.175778","Link":"http://dx.doi.org/10.1109/VISUAL.1991.175778","FirstPage":"58","LastPage":"65, 410","PaperType":"C","Abstract":"The authors have achieved rates as high as 15 frames per second for interactive direct visualization of 3D data by trading some function for speed, while volume rendering with a full complement of ramp classification capabilities is performed at 1.4 frames per second. These speeds have made the combination of region selection with volume rendering practical for the first time. Semantic-driven selection, rather than geometric clipping, has proved to be a natural means of interacting with 3D data. Internal organs in medical data or other regions of interest can be built from preprocessed region primitives. The resulting combined system has been applied to real 3D medical data with encouraging results.<<ETX>>","AuthorNamesDeduped":"Terry S. Yoo;Ulrich Neumann;Henry Fuchs;Stephen M. Pizer;Tim J. Cullip;John Rhoades;Ross T. Whitaker","AuthorNames":"T.S. Yoo;U. Neumann;H. Fuchs;S.M. Pizer;T. Cullip;J. Rhoades;R. Whitaker","AuthorAffiliation":"North Carolina Univ., Chapel Hill, NC, USA;North Carolina Univ., Chapel Hill, NC, USA;North Carolina Univ., Chapel Hill, NC, USA;North Carolina Univ., Chapel Hill, NC, USA;North Carolina Univ., Chapel Hill, NC, USA;North Carolina Univ., Chapel Hill, NC, USA;North Carolina Univ., Chapel Hill, NC, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"32","XPloreCitationCount022019":"10","PubsCited":"13","Award":""}},{"name":"Deborah Silver","value":239,"numPapers":50,"cluster":"4","visible":1,"index":11,"weight":14,"x":415.52187603767254,"y":535.670054677927,"px":418.7159358792766,"py":533.9497526127948,"node":{"Conference":"Vis","Year":"1991","Title":"Visualizing causal effects in 4D space-time vector fields","DOI":"10.1109/VISUAL.1991.175770","Link":"http://dx.doi.org/10.1109/VISUAL.1991.175770","FirstPage":"12","LastPage":"16, 406","PaperType":"C","Abstract":"A method is presented for juxtaposing 4D space-time vector fields, of which one contains a source variable and the other the response field. Thresholding, ellipsoid fitting, and vortex line generation are used to reduce the amount of information and help analyze the relationship between two 3D vector variables evolving in time. The technique helps to highlight the topological relationship between the two in an effort to understand the causal connection. These concepts are applied to on-going research in evolving fluid dynamics problems.<<ETX>>","AuthorNamesDeduped":"Deborah Silver;M. Gao;Norman J. Zabusky","AuthorNames":"D. Silver;M. Gao;N. Zabusky","AuthorAffiliation":"Rutgers Univ., Piscataway, NJ, USA;Rutgers Univ., Piscataway, NJ, USA;Rutgers Univ., Piscataway, NJ, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"","XPloreCitationCount022019":"5","PubsCited":"8","Award":""}},{"name":"Ricardo S. Avila","value":122,"numPapers":14,"cluster":"4","visible":1,"index":12,"weight":12,"x":440.0387242624777,"y":580.910811945967,"px":442.85689129872674,"py":575.9455680751342,"node":{"Conference":"Vis","Year":"1990","Title":"A procedural interface for volume rendering","DOI":"10.1109/VISUAL.1990.146362","Link":"http://dx.doi.org/10.1109/VISUAL.1990.146362","FirstPage":"36","LastPage":"44, 462","PaperType":"C","Abstract":"The author presents a simple, procedural interface for volume rendering. The interface is built on three types of objects: volumes, which contain the data to be visualized, environments, which set up viewing and lighting, and image objects, which convert results to a user-definable format. A volume is rendered against a particular environment with the results sent to an image object for conversion. By defining volume qualities such as color, opacity, and gradient in terms of user-definable transfer functions, the rendering process is made independent of the data set's underlying representation.<<ETX>>","AuthorNamesDeduped":"James L. Montine","AuthorNames":"J.L. Montine","AuthorAffiliation":"Alliant Comput. Syst., Littleton, MA, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"","XPloreCitationCount022019":"3","PubsCited":"9","Award":""}},{"name":"Arie E. Kaufman","value":628,"numPapers":171,"cluster":"4","visible":1,"index":13,"weight":59,"x":436.57619975221127,"y":551.569916709856,"px":439.0949385033849,"py":547.1008519272419,"node":{"Conference":"Vis","Year":"1991","Title":"Realistic volume imaging","DOI":"10.1109/VISUAL.1991.175805","Link":"http://dx.doi.org/10.1109/VISUAL.1991.175805","FirstPage":"226","LastPage":"231, 425","PaperType":"C","Abstract":"A set of volume visualization tools that are based on the use of recursive ray tracing as the primary vehicle for realistic volume imaging is presented. The tools include shadows, mirrors, specularity, and constructive solid geometry. The underlying representation for the ray tracer is a 3-D raster of voxels that holds the discrete form of the scene. Unlike traditional volume rendering techniques, the discrete recursive ray tracer models many illumination phenomena by traversing discrete rays in voxel space. The approach provides true ray tracing of sampled or computed datasets, as well as ray tracing of hybrid scenes where sampled or computed data are intermixed with geometric models and enhances the understanding of complex biomedical datasets.<<ETX>>","AuthorNamesDeduped":"Roni Yagel;Arie E. Kaufman;Qiang Zhang","AuthorNames":"R. Yagel;A. Kaufman;Q. Zhang","AuthorAffiliation":"Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA;Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA;Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"","XPloreCitationCount022019":"11","PubsCited":"24","Award":""}},{"name":"Lisa M. Sobierajski","value":122,"numPapers":14,"cluster":"4","visible":1,"index":14,"weight":12,"x":385.3224510323599,"y":560.2652788679206,"px":389.67463538221017,"py":554.0532362996773,"node":{"Conference":"Vis","Year":"1990","Title":"A procedural interface for volume rendering","DOI":"10.1109/VISUAL.1990.146362","Link":"http://dx.doi.org/10.1109/VISUAL.1990.146362","FirstPage":"36","LastPage":"44, 462","PaperType":"C","Abstract":"The author presents a simple, procedural interface for volume rendering. The interface is built on three types of objects: volumes, which contain the data to be visualized, environments, which set up viewing and lighting, and image objects, which convert results to a user-definable format. A volume is rendered against a particular environment with the results sent to an image object for conversion. By defining volume qualities such as color, opacity, and gradient in terms of user-definable transfer functions, the rendering process is made independent of the data set's underlying representation.<<ETX>>","AuthorNamesDeduped":"James L. Montine","AuthorNames":"J.L. Montine","AuthorAffiliation":"Alliant Comput. Syst., Littleton, MA, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"","XPloreCitationCount022019":"3","PubsCited":"9","Award":""}},{"name":"Roni Yagel","value":190,"numPapers":11,"cluster":"4","visible":1,"index":15,"weight":7,"x":429.5666748998656,"y":472.85251223892163,"px":432.8337245011599,"py":470.55636924866695,"node":{"Conference":"Vis","Year":"1991","Title":"Realistic volume imaging","DOI":"10.1109/VISUAL.1991.175805","Link":"http://dx.doi.org/10.1109/VISUAL.1991.175805","FirstPage":"226","LastPage":"231, 425","PaperType":"C","Abstract":"A set of volume visualization tools that are based on the use of recursive ray tracing as the primary vehicle for realistic volume imaging is presented. The tools include shadows, mirrors, specularity, and constructive solid geometry. The underlying representation for the ray tracer is a 3-D raster of voxels that holds the discrete form of the scene. Unlike traditional volume rendering techniques, the discrete recursive ray tracer models many illumination phenomena by traversing discrete rays in voxel space. The approach provides true ray tracing of sampled or computed datasets, as well as ray tracing of hybrid scenes where sampled or computed data are intermixed with geometric models and enhances the understanding of complex biomedical datasets.<<ETX>>","AuthorNamesDeduped":"Roni Yagel;Arie E. Kaufman;Qiang Zhang","AuthorNames":"R. Yagel;A. Kaufman;Q. Zhang","AuthorAffiliation":"Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA;Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA;Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"","XPloreCitationCount022019":"11","PubsCited":"24","Award":""}},{"name":"Nelson L. Max","value":311,"numPapers":22,"cluster":"4","visible":1,"index":16,"weight":10,"x":382.0597806380793,"y":421.0230604931539,"px":386.00758517040094,"py":419.7905031652037,"node":{"Conference":"Vis","Year":"1990","Title":"An interpersonal multimedia visualization system","DOI":"10.1109/VISUAL.1990.146399","Link":"http://dx.doi.org/10.1109/VISUAL.1990.146399","FirstPage":"338","LastPage":"341","PaperType":"C","Abstract":"MediaView is a computer program that provides a generic infrastructure for authoring and interacting with multimedia documents. Among its applications is the ability to furnish a user with a comprehensive environment for analysis and visualization. With this program the user can produce a document that contains mathematics, datasets and associated visualizations. From the dataset or embedded mathematics animated sequences can be produced in situ. Equations that appear in a document have a backing format that is compatible with the Mathematica language. Thus, by clicking on an equation, its semantics are conveyed to Mathematica, where the user can perform a variety of symbolic and numerical operations. Since the document is all digital, it can be shared on a local network or mailed electronically to a distant site. Animations and any other substructures of the document persist through the mailing process and can be awakened at the destination by the recipient.<<ETX>>","AuthorNamesDeduped":"Richard L. Phillips","AuthorNames":"R.L. Phillips","AuthorAffiliation":"Los Alamos Nat. Lab., NM, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"50","XPloreCitationCount022019":"0","PubsCited":"8","Award":""}},{"name":"Roger Crawfis","value":375,"numPapers":68,"cluster":"4","visible":1,"index":17,"weight":22,"x":413.46000875139435,"y":414.0973915199358,"px":416.96143600133354,"py":414.4900488921906,"node":{"Conference":"Vis","Year":"1991","Title":"A tool for visualizing the topology of three-dimensional vector fields","DOI":"10.1109/VISUAL.1991.175773","Link":"http://dx.doi.org/10.1109/VISUAL.1991.175773","FirstPage":"33","LastPage":"40, 408","PaperType":"C","Abstract":"A description is given of a software system, TOPO, that numerically analyzes and graphically displays topological aspects of a three-dimensional vector field, v, to produce a single, relatively simple picture that characterizes v. The topology of v considered consists of its critical points (where v=0), their invariant manifolds, and the integral curves connecting these invariant manifolds. The field in the neighborhood of each critical point is approximated by the Taylor expansion. The coefficients of the first nonzero term of the Taylor expansion around a critical point are the 3*3 matrix Delta v. Critical points are classified by examining Delta v's eigenvalues. The eigenvectors of Delta v span the invariant manifolds of the linearized field around a critical point. Curves integrated from initial points on the eigenvectors a small distance from a critical point connect with other critical points (or the boundary) to complete the topology. One class of critical surfaces that is important in computational fluid dynamics is analyzed.<<ETX>>","AuthorNamesDeduped":"Al Globus;Creon Levit;T. Lasinski","AuthorNames":"A. Globus;C. Levit;T. Lasinski","AuthorAffiliation":"","InternalReferences":"10.1109/VISUAL.1990.146360;10.1109/VISUAL.1990.146359","AuthorKeywords":"","AminerCitationCount022019":"296","XPloreCitationCount022019":"93","PubsCited":"44","Award":""}},{"name":"Barry G. Becker","value":69,"numPapers":23,"cluster":"2","visible":1,"index":18,"weight":4,"x":444.0997214739779,"y":271.4609232561214,"px":448.2704826290249,"py":273.75358390186494,"node":{"Conference":"Vis","Year":"1992","Title":"Visualizing wind velocities by advecting cloud textures","DOI":"10.1109/VISUAL.1992.235210","Link":"http://dx.doi.org/10.1109/VISUAL.1992.235210","FirstPage":"179","LastPage":"184","PaperType":"C","Abstract":"In order to visualize both clouds and wind in climate simulations, clouds were rendered using a 3D texture which was advected by the wind flow. The simulation is described. Rendering, the advection of texture coordinates, and haze effects are discussed. Results are presented.<<ETX>>","AuthorNamesDeduped":"Nelson L. Max;Roger Crawfis;Dean Williams","AuthorNames":"N. Max;R. Crawfis;D. Williams","AuthorAffiliation":"Lawrence Livermore Nat. Lab., CA, USA;Lawrence Livermore Nat. Lab., CA, USA;Lawrence Livermore Nat. Lab., CA, USA","InternalReferences":"10.1109/VISUAL.1991.175773","AuthorKeywords":"advection, 3-D texture, volume visualization, vectorfield, wind, clouds, climate modeling","AminerCitationCount022019":"79","XPloreCitationCount022019":"24","PubsCited":"11","Award":""}},{"name":"Taosong He","value":143,"numPapers":11,"cluster":"4","visible":1,"index":19,"weight":5,"x":406.54354132826825,"y":715.3297624662688,"px":409.345001571032,"py":708.9221585698125,"node":{"Conference":"Vis","Year":"1992","Title":"Towards a comprehensive volume visualization system","DOI":"10.1109/VISUAL.1992.235231","Link":"http://dx.doi.org/10.1109/VISUAL.1992.235231","FirstPage":"13","LastPage":"20","PaperType":"C","Abstract":"The VolVis system has been developed to satisfy the diverse requirements of the volume visualization community by comfortably housing numerous visualization algorithms and methods within a consistent and well organized framework. The VolVis system is supported by a generalized abstract model which provides for both geometric and volumetric constructs. VolVis contains several rendering algorithms that span the speed versus accuracy continuum. A fast volume rendering algorithm has been developed, which is capable of exploiting existing graphics hardware without placing any viewing restrictions or compromising accuracy. In addition, VolVis includes a volumetric navigation facility, key-frame animation generator, quantitative analysis tools, and a generalized protocol for communicating with 3D input devices.<<ETX>>","AuthorNamesDeduped":"Ricardo S. Avila;Lisa M. Sobierajski;Arie E. Kaufman","AuthorNames":"R.S. Avila;L.M. Sobierajski;A.E. Kaufman","AuthorAffiliation":"State Univ. of New York, Stony Brook, NY, USA;State Univ. of New York, Stony Brook, NY, USA;State Univ. of New York, Stony Brook, NY, USA","InternalReferences":"10.1109/VISUAL.1990.146362;10.1109/VISUAL.1990.146413;10.1109/VISUAL.1991.175805","AuthorKeywords":"","AminerCitationCount022019":"156","XPloreCitationCount022019":"26","PubsCited":"16","Award":""}},{"name":"Daniel A. Keim","value":976,"numPapers":254,"cluster":"2","visible":1,"index":20,"weight":103,"x":533.0003246710096,"y":322.84100244685175,"px":534.9147383599185,"py":320.13220198802134,"node":{"Conference":"Vis","Year":"1990","Title":"Shape coding of multidimensional data on a microcomputer display","DOI":"10.1109/VISUAL.1990.146387","Link":"http://dx.doi.org/10.1109/VISUAL.1990.146387","FirstPage":"238","LastPage":"246, 478","PaperType":"C","Abstract":"The author presents a simple and flexible method of sharp coding for higher dimensional data sets that allows the database operator or the scientist quick access to promising patterns within and among records or samples. The example used is a 13-parameter set of solar wind, magnetosphere, and ground observation data collected hourly for 21 days in 1976. The software system is a prototype developed to demonstrate the glyph approach to depicting higher-dimensional data sets. The experiment was to depict all parameters simultaneously, to see if any global or local patterns emerged. This experiment proves that much more complex data can be presented for visual pattern extraction than standard methods allow.<<ETX>>","AuthorNamesDeduped":"Jeff Beddow","AuthorNames":"J. Beddow","AuthorAffiliation":"Microsimulations Res., Minneapolis, MN, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"","XPloreCitationCount022019":"32","PubsCited":"5","Award":""}},{"name":"Jeff Beddow","value":27,"numPapers":0,"cluster":"2","visible":1,"index":21,"weight":1,"x":858.6804815428579,"y":64.8792676506451,"px":854.0134674341912,"py":73.64505998920284,"node":{"Conference":"Vis","Year":"1990","Title":"Shape coding of multidimensional data on a microcomputer display","DOI":"10.1109/VISUAL.1990.146387","Link":"http://dx.doi.org/10.1109/VISUAL.1990.146387","FirstPage":"238","LastPage":"246, 478","PaperType":"C","Abstract":"The author presents a simple and flexible method of sharp coding for higher dimensional data sets that allows the database operator or the scientist quick access to promising patterns within and among records or samples. The example used is a 13-parameter set of solar wind, magnetosphere, and ground observation data collected hourly for 21 days in 1976. The software system is a prototype developed to demonstrate the glyph approach to depicting higher-dimensional data sets. The experiment was to depict all parameters simultaneously, to see if any global or local patterns emerged. This experiment proves that much more complex data can be presented for visual pattern extraction than standard methods allow.<<ETX>>","AuthorNamesDeduped":"Jeff Beddow","AuthorNames":"J. Beddow","AuthorAffiliation":"Microsimulations Res., Minneapolis, MN, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"","XPloreCitationCount022019":"32","PubsCited":"5","Award":""}},{"name":"Jeffrey LeBlanc","value":93,"numPapers":0,"cluster":"2","visible":1,"index":22,"weight":3,"x":399.81576454854724,"y":246.77140205900767,"px":404.33075336541395,"py":249.61160456618867,"node":{"Conference":"Vis","Year":"1990","Title":"Exploring N-dimensional databases","DOI":"10.1109/VISUAL.1990.146386","Link":"http://dx.doi.org/10.1109/VISUAL.1990.146386","FirstPage":"230","LastPage":"237","PaperType":"C","Abstract":"The authors present a tool for the display and analysis of N-dimensional data based on a technique called dimensional stacking. This technique is described. The primary goal is to create a tool that enables the user to project data of arbitrary dimensions onto a two-dimensional image. Of equal importance is the ability to control the viewing parameters, so that one can interactively adjust what ranges of values each dimension takes and the form in which the dimensions are displayed. This will allow an intuitive feel for the data to be developed as the database is explored. The system uses dimensional stacking, to collapse and N-dimension space down into a 2-D space and then render the values contained therein. Each value can then be represented as a pixel or rectangular region on a 2-D screen whose intensity corresponds to the data value at that point.<<ETX>>","AuthorNamesDeduped":"Jeffrey LeBlanc;Matthew O. Ward;Norman Wittels","AuthorNames":"J. LeBlanc;M.O. Ward;N. Wittels","AuthorAffiliation":"Worcester Polytech. Inst., MA, USA;Worcester Polytech. Inst., MA, USA;Worcester Polytech. Inst., MA, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"347","XPloreCitationCount022019":"89","PubsCited":"16","Award":""}},{"name":"Matthew O. Ward","value":899,"numPapers":96,"cluster":"2","visible":1,"index":23,"weight":60,"x":519.4770999315231,"y":361.8492980092134,"px":520.857681603188,"py":361.14895245436094,"node":{"Conference":"Vis","Year":"1990","Title":"Exploring N-dimensional databases","DOI":"10.1109/VISUAL.1990.146386","Link":"http://dx.doi.org/10.1109/VISUAL.1990.146386","FirstPage":"230","LastPage":"237","PaperType":"C","Abstract":"The authors present a tool for the display and analysis of N-dimensional data based on a technique called dimensional stacking. This technique is described. The primary goal is to create a tool that enables the user to project data of arbitrary dimensions onto a two-dimensional image. Of equal importance is the ability to control the viewing parameters, so that one can interactively adjust what ranges of values each dimension takes and the form in which the dimensions are displayed. This will allow an intuitive feel for the data to be developed as the database is explored. The system uses dimensional stacking, to collapse and N-dimension space down into a 2-D space and then render the values contained therein. Each value can then be represented as a pixel or rectangular region on a 2-D screen whose intensity corresponds to the data value at that point.<<ETX>>","AuthorNamesDeduped":"Jeffrey LeBlanc;Matthew O. Ward;Norman Wittels","AuthorNames":"J. LeBlanc;M.O. Ward;N. Wittels","AuthorAffiliation":"Worcester Polytech. Inst., MA, USA;Worcester Polytech. Inst., MA, USA;Worcester Polytech. Inst., MA, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"347","XPloreCitationCount022019":"89","PubsCited":"16","Award":""}},{"name":"Norman Wittels","value":93,"numPapers":0,"cluster":"2","visible":1,"index":24,"weight":3,"x":406.44062881777484,"y":233.22043834340565,"px":410.7284200112113,"py":236.81133320034394,"node":{"Conference":"Vis","Year":"1990","Title":"Exploring N-dimensional databases","DOI":"10.1109/VISUAL.1990.146386","Link":"http://dx.doi.org/10.1109/VISUAL.1990.146386","FirstPage":"230","LastPage":"237","PaperType":"C","Abstract":"The authors present a tool for the display and analysis of N-dimensional data based on a technique called dimensional stacking. This technique is described. The primary goal is to create a tool that enables the user to project data of arbitrary dimensions onto a two-dimensional image. Of equal importance is the ability to control the viewing parameters, so that one can interactively adjust what ranges of values each dimension takes and the form in which the dimensions are displayed. This will allow an intuitive feel for the data to be developed as the database is explored. The system uses dimensional stacking, to collapse and N-dimension space down into a 2-D space and then render the values contained therein. Each value can then be represented as a pixel or rectangular region on a 2-D screen whose intensity corresponds to the data value at that point.<<ETX>>","AuthorNamesDeduped":"Jeffrey LeBlanc;Matthew O. Ward;Norman Wittels","AuthorNames":"J. LeBlanc;M.O. Ward;N. Wittels","AuthorAffiliation":"Worcester Polytech. Inst., MA, USA;Worcester Polytech. Inst., MA, USA;Worcester Polytech. Inst., MA, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"347","XPloreCitationCount022019":"89","PubsCited":"16","Award":""}},{"name":"Alfred Inselberg","value":346,"numPapers":3,"cluster":"2","visible":1,"index":25,"weight":9,"x":534.9706253189823,"y":379.8762330972702,"px":536.2044512160425,"py":380.43079670696653,"node":{"Conference":"Vis","Year":"1990","Title":"Parallel coordinates: a tool for visualizing multi-dimensional geometry","DOI":"10.1109/VISUAL.1990.146402","Link":"http://dx.doi.org/10.1109/VISUAL.1990.146402","FirstPage":"361","LastPage":"378","PaperType":"C","Abstract":"A methodology for visualizing analytic and synthetic geometry in R/sup N/ is presented. It is based on a system of parallel coordinates which induces a nonprojective mapping between N-dimensional and two-dimensional sets. Hypersurfaces are represented by their planar images which have some geometrical properties analogous to the properties of the hypersurface that they represent. A point from to line duality when N=2 generalizes to lines and hyperplanes enabling the representation of polyhedra in R/sup N/. The representation of a class of convex and non-convex hypersurfaces is discussed, together with an algorithm for constructing and displaying any interior point. The display shows some local properties of the hypersurface and provides information on the point's proximity to the boundary. Applications are discussed.<<ETX>>","AuthorNamesDeduped":"Alfred Inselberg;Bernard Dimsdale","AuthorNames":"A. Inselberg;B. Dimsdale","AuthorAffiliation":"IBM Sci. Center, Los Angeles, CA, USA;IBM Sci. Center, Los Angeles, CA, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"920","XPloreCitationCount022019":"308","PubsCited":"47","Award":""}},{"name":"Bernard Dimsdale","value":279,"numPapers":0,"cluster":"2","visible":1,"index":26,"weight":7,"x":568.354833458013,"y":412.4927812854622,"px":567.833248712408,"py":410.98187640425556,"node":{"Conference":"Vis","Year":"1990","Title":"Parallel coordinates: a tool for visualizing multi-dimensional geometry","DOI":"10.1109/VISUAL.1990.146402","Link":"http://dx.doi.org/10.1109/VISUAL.1990.146402","FirstPage":"361","LastPage":"378","PaperType":"C","Abstract":"A methodology for visualizing analytic and synthetic geometry in R/sup N/ is presented. It is based on a system of parallel coordinates which induces a nonprojective mapping between N-dimensional and two-dimensional sets. Hypersurfaces are represented by their planar images which have some geometrical properties analogous to the properties of the hypersurface that they represent. A point from to line duality when N=2 generalizes to lines and hyperplanes enabling the representation of polyhedra in R/sup N/. The representation of a class of convex and non-convex hypersurfaces is discussed, together with an algorithm for constructing and displaying any interior point. The display shows some local properties of the hypersurface and provides information on the point's proximity to the boundary. Applications are discussed.<<ETX>>","AuthorNamesDeduped":"Alfred Inselberg;Bernard Dimsdale","AuthorNames":"A. Inselberg;B. Dimsdale","AuthorAffiliation":"IBM Sci. Center, Los Angeles, CA, USA;IBM Sci. Center, Los Angeles, CA, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"920","XPloreCitationCount022019":"308","PubsCited":"47","Award":""}},{"name":"Robert A. Cross","value":37,"numPapers":6,"cluster":"15","visible":1,"index":27,"weight":3,"x":66.4962153812551,"y":18.139122516880583,"px":71.7729093107423,"py":24.71354311218667,"node":{"Conference":"Vis","Year":"1991","Title":"Visualizing the fourth dimension using geometry and light","DOI":"10.1109/VISUAL.1991.175821","Link":"http://dx.doi.org/10.1109/VISUAL.1991.175821","FirstPage":"321","LastPage":"328, 432","PaperType":"C","Abstract":"Techniques for visualizing mathematical objects in four-dimensional (4D) space that exploit four-dimensional lighting effects are explored. The geometry of image production, stereography, and shadows in 4D is analyzed. Alternatives for smooth and specular shaded rendering of curves, surfaces, and solids in 4D are examined and a new approach that systematically converts curves or surfaces into uniquely renderable solids in 4D space by attaching spheres or circles to each point is proposed. Analogs of 3D shading methods are used to produce volume renderings that distinguish objects whose 3D projections from 4D are identical. Analyzing the procedures needed to justify and evaluate a system as this for teaching humans to 'see' in four dimensions leads to the proposal of a generally applicable four-step visualization paradigm.<<ETX>>","AuthorNamesDeduped":"Andrew J. Hanson;Pheng-Ann Heng","AuthorNames":"A.J. Hanson;P.A. Heng","AuthorAffiliation":"Dept. of Comput. Sci., Indiana Univ., Bloomington, IN, USA;Dept. of Comput. Sci., Indiana Univ., Bloomington, IN, USA","InternalReferences":"10.1109/VISUAL.1990.146370","AuthorKeywords":"","AminerCitationCount022019":"50","XPloreCitationCount022019":"12","PubsCited":"22","Award":""}},{"name":"Lloyd Treinish","value":199,"numPapers":26,"cluster":"11","visible":1,"index":28,"weight":9,"x":1417.3927803801773,"y":687.5136288364192,"px":1415.60765653545,"py":682.8348655538554,"node":{"Conference":"Vis","Year":"1992","Title":"Display of scientific data structures for algorithm visualization","DOI":"10.1109/VISUAL.1992.235215","Link":"http://dx.doi.org/10.1109/VISUAL.1992.235215","FirstPage":"139","LastPage":"146","PaperType":"C","Abstract":"A technique for defining graphical depictions for all the data types defined in an algorithm is presented. The ability to display arbitrary combinations of an algorithm's data objects in a common frame of reference, coupled with interactive control of algorithm execution, provides a powerful way to understand algorithm behavior. Type definitions are constrained so that all primitive values occurring in data objects are assigned scalar types. A graphical display, including user interaction with the display, is modeled by a special data type. Mappings from the scalar types into the display model type provide a simple user interface for controlling how all data types are depicted, without the need for type-specific graphics logic.<<ETX>>","AuthorNamesDeduped":"William L. Hibbard;Charles R. Dyer;Brian E. Paul","AuthorNames":"W. Hibbard;C.R. Dyer;B. Paul","AuthorAffiliation":"Wisconsin Univ., Madison, WI, USA;Wisconsin Univ., Madison, WI, USA;Wisconsin Univ., Madison, WI, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"68","XPloreCitationCount022019":"14","PubsCited":"9","Award":""}},{"name":"Bruce Lucas","value":102,"numPapers":6,"cluster":"11","visible":1,"index":29,"weight":1,"x":1475.5756315192189,"y":673.4377637497082,"px":1471.14570174135,"py":669.906149402093,"node":{"Conference":"Vis","Year":"1992","Title":"An architecture for a scientific visualization system","DOI":"10.1109/VISUAL.1992.235219","Link":"http://dx.doi.org/10.1109/VISUAL.1992.235219","FirstPage":"107","LastPage":"114","PaperType":"C","Abstract":"The architecture of the Data Explorer, a scientific visualization system, is described. Data Explorer supports the visualization of a wide variety of data by means of a flexible set of visualization modules. A single powerful data model common to all modules allows a wide range of data types to be imported and passed between modules. There is integral support for parallelism, affecting the data model and the execution model. The visualization modules are highly interoperable, due in part to the common data model, and exemplified by the renderer. An execution model facilitates parallelization of modules and incorporates optimizations such as caching. The two-process client-server system structure consists of a user interface that communicates with an executive via a dataflow language.<<ETX>>","AuthorNamesDeduped":"Bruce Lucas;G. D. Abrams;Nancy S. Collins;D. A. Epstien;Donna L. Gresh;Kevin P. McAuliffe","AuthorNames":"B. Lucas;G.D. Abram;N.S. Collins;D.A. Epstein;D.L. Gresh;K.P. McAuliffe","AuthorAffiliation":"IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA;IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA;IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA;IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA;IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA;IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA","InternalReferences":"10.1109/VISUAL.1990.146397;10.1109/VISUAL.1992.235204;10.1109/VISUAL.1991.175818;10.1109/VISUAL.1991.175833","AuthorKeywords":"","AminerCitationCount022019":"189","XPloreCitationCount022019":"51","PubsCited":"8","Award":""}},{"name":"G. D. Abrams","value":53,"numPapers":4,"cluster":"11","visible":1,"index":30,"weight":1,"x":1462.18730224679,"y":626.7350243381743,"px":1459.0301218792315,"py":620.1654345626007,"node":{"Conference":"Vis","Year":"1992","Title":"An architecture for a scientific visualization system","DOI":"10.1109/VISUAL.1992.235219","Link":"http://dx.doi.org/10.1109/VISUAL.1992.235219","FirstPage":"107","LastPage":"114","PaperType":"C","Abstract":"The architecture of the Data Explorer, a scientific visualization system, is described. Data Explorer supports the visualization of a wide variety of data by means of a flexible set of visualization modules. A single powerful data model common to all modules allows a wide range of data types to be imported and passed between modules. There is integral support for parallelism, affecting the data model and the execution model. The visualization modules are highly interoperable, due in part to the common data model, and exemplified by the renderer. An execution model facilitates parallelization of modules and incorporates optimizations such as caching. The two-process client-server system structure consists of a user interface that communicates with an executive via a dataflow language.<<ETX>>","AuthorNamesDeduped":"Bruce Lucas;G. D. Abrams;Nancy S. Collins;D. A. Epstien;Donna L. Gresh;Kevin P. McAuliffe","AuthorNames":"B. Lucas;G.D. Abram;N.S. Collins;D.A. Epstein;D.L. Gresh;K.P. McAuliffe","AuthorAffiliation":"IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA;IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA;IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA;IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA;IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA;IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA","InternalReferences":"10.1109/VISUAL.1990.146397;10.1109/VISUAL.1992.235204;10.1109/VISUAL.1991.175818;10.1109/VISUAL.1991.175833","AuthorKeywords":"","AminerCitationCount022019":"189","XPloreCitationCount022019":"51","PubsCited":"8","Award":""}},{"name":"Nancy S. Collins","value":89,"numPapers":4,"cluster":"11","visible":1,"index":31,"weight":1,"x":1465.8507189493969,"y":595.6188238095242,"px":1463.1736186633652,"py":591.892224508078,"node":{"Conference":"Vis","Year":"1992","Title":"An architecture for a scientific visualization system","DOI":"10.1109/VISUAL.1992.235219","Link":"http://dx.doi.org/10.1109/VISUAL.1992.235219","FirstPage":"107","LastPage":"114","PaperType":"C","Abstract":"The architecture of the Data Explorer, a scientific visualization system, is described. Data Explorer supports the visualization of a wide variety of data by means of a flexible set of visualization modules. A single powerful data model common to all modules allows a wide range of data types to be imported and passed between modules. There is integral support for parallelism, affecting the data model and the execution model. The visualization modules are highly interoperable, due in part to the common data model, and exemplified by the renderer. An execution model facilitates parallelization of modules and incorporates optimizations such as caching. The two-process client-server system structure consists of a user interface that communicates with an executive via a dataflow language.<<ETX>>","AuthorNamesDeduped":"Bruce Lucas;G. D. Abrams;Nancy S. Collins;D. A. Epstien;Donna L. Gresh;Kevin P. McAuliffe","AuthorNames":"B. Lucas;G.D. Abram;N.S. Collins;D.A. Epstein;D.L. Gresh;K.P. McAuliffe","AuthorAffiliation":"IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA;IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA;IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA;IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA;IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA;IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA","InternalReferences":"10.1109/VISUAL.1990.146397;10.1109/VISUAL.1992.235204;10.1109/VISUAL.1991.175818;10.1109/VISUAL.1991.175833","AuthorKeywords":"","AminerCitationCount022019":"189","XPloreCitationCount022019":"51","PubsCited":"8","Award":""}},{"name":"D. A. Epstien","value":53,"numPapers":4,"cluster":"11","visible":1,"index":32,"weight":1,"x":1476.7605370985393,"y":576.2588117349061,"px":1473.0173609671826,"py":570.664739743759,"node":{"Conference":"Vis","Year":"1992","Title":"An architecture for a scientific visualization system","DOI":"10.1109/VISUAL.1992.235219","Link":"http://dx.doi.org/10.1109/VISUAL.1992.235219","FirstPage":"107","LastPage":"114","PaperType":"C","Abstract":"The architecture of the Data Explorer, a scientific visualization system, is described. Data Explorer supports the visualization of a wide variety of data by means of a flexible set of visualization modules. A single powerful data model common to all modules allows a wide range of data types to be imported and passed between modules. There is integral support for parallelism, affecting the data model and the execution model. The visualization modules are highly interoperable, due in part to the common data model, and exemplified by the renderer. An execution model facilitates parallelization of modules and incorporates optimizations such as caching. The two-process client-server system structure consists of a user interface that communicates with an executive via a dataflow language.<<ETX>>","AuthorNamesDeduped":"Bruce Lucas;G. D. Abrams;Nancy S. Collins;D. A. Epstien;Donna L. Gresh;Kevin P. McAuliffe","AuthorNames":"B. Lucas;G.D. Abram;N.S. Collins;D.A. Epstein;D.L. Gresh;K.P. McAuliffe","AuthorAffiliation":"IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA;IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA;IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA;IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA;IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA;IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA","InternalReferences":"10.1109/VISUAL.1990.146397;10.1109/VISUAL.1992.235204;10.1109/VISUAL.1991.175818;10.1109/VISUAL.1991.175833","AuthorKeywords":"","AminerCitationCount022019":"189","XPloreCitationCount022019":"51","PubsCited":"8","Award":""}},{"name":"Donna L. Gresh","value":117,"numPapers":13,"cluster":"11","visible":1,"index":33,"weight":1,"x":1493.6587386032102,"y":622.7055311779121,"px":1491.2382781270012,"py":617.1905568064201,"node":{"Conference":"Vis","Year":"1992","Title":"An architecture for a scientific visualization system","DOI":"10.1109/VISUAL.1992.235219","Link":"http://dx.doi.org/10.1109/VISUAL.1992.235219","FirstPage":"107","LastPage":"114","PaperType":"C","Abstract":"The architecture of the Data Explorer, a scientific visualization system, is described. Data Explorer supports the visualization of a wide variety of data by means of a flexible set of visualization modules. A single powerful data model common to all modules allows a wide range of data types to be imported and passed between modules. There is integral support for parallelism, affecting the data model and the execution model. The visualization modules are highly interoperable, due in part to the common data model, and exemplified by the renderer. An execution model facilitates parallelization of modules and incorporates optimizations such as caching. The two-process client-server system structure consists of a user interface that communicates with an executive via a dataflow language.<<ETX>>","AuthorNamesDeduped":"Bruce Lucas;G. D. Abrams;Nancy S. Collins;D. A. Epstien;Donna L. Gresh;Kevin P. McAuliffe","AuthorNames":"B. Lucas;G.D. Abram;N.S. Collins;D.A. Epstein;D.L. Gresh;K.P. McAuliffe","AuthorAffiliation":"IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA;IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA;IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA;IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA;IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA;IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA","InternalReferences":"10.1109/VISUAL.1990.146397;10.1109/VISUAL.1992.235204;10.1109/VISUAL.1991.175818;10.1109/VISUAL.1991.175833","AuthorKeywords":"","AminerCitationCount022019":"189","XPloreCitationCount022019":"51","PubsCited":"8","Award":""}},{"name":"Kevin P. McAuliffe","value":53,"numPapers":4,"cluster":"11","visible":1,"index":34,"weight":1,"x":1444.1940037879494,"y":613.6709164772818,"px":1442.525410128479,"py":608.5545176363562,"node":{"Conference":"Vis","Year":"1992","Title":"An architecture for a scientific visualization system","DOI":"10.1109/VISUAL.1992.235219","Link":"http://dx.doi.org/10.1109/VISUAL.1992.235219","FirstPage":"107","LastPage":"114","PaperType":"C","Abstract":"The architecture of the Data Explorer, a scientific visualization system, is described. Data Explorer supports the visualization of a wide variety of data by means of a flexible set of visualization modules. A single powerful data model common to all modules allows a wide range of data types to be imported and passed between modules. There is integral support for parallelism, affecting the data model and the execution model. The visualization modules are highly interoperable, due in part to the common data model, and exemplified by the renderer. An execution model facilitates parallelization of modules and incorporates optimizations such as caching. The two-process client-server system structure consists of a user interface that communicates with an executive via a dataflow language.<<ETX>>","AuthorNamesDeduped":"Bruce Lucas;G. D. Abrams;Nancy S. Collins;D. A. Epstien;Donna L. Gresh;Kevin P. McAuliffe","AuthorNames":"B. Lucas;G.D. Abram;N.S. Collins;D.A. Epstein;D.L. Gresh;K.P. McAuliffe","AuthorAffiliation":"IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA;IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA;IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA;IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA;IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA;IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA","InternalReferences":"10.1109/VISUAL.1990.146397;10.1109/VISUAL.1992.235204;10.1109/VISUAL.1991.175818;10.1109/VISUAL.1991.175833","AuthorKeywords":"","AminerCitationCount022019":"189","XPloreCitationCount022019":"51","PubsCited":"8","Award":""}},{"name":"Alex T. Pang","value":306,"numPapers":93,"cluster":"6","visible":1,"index":35,"weight":28,"x":278.95861008137,"y":551.3501899462735,"px":283.26942138235177,"py":548.2645555803837,"node":{"Conference":"Vis","Year":"1992","Title":"Rendering surface-particles","DOI":"10.1109/VISUAL.1992.235226","Link":"http://dx.doi.org/10.1109/VISUAL.1992.235226","FirstPage":"54","LastPage":"61","PaperType":"C","Abstract":"Surface-particles are very small facets, modeled as points with a normal. They can be used to visualize flow in several ways by variation of the properties of the particle sources. A method is presented for the rendering of surface-particles. This method includes an improved shading model, the use of Gaussian filters for the prevention of spatial and temporal artifacts, an efficient scan-conversion algorithm, the handling of occlusion and the simultaneous rendering of geometric objects and surface-particles. The synthesis of images with limited depth of field is described, which literally allows the scientist to focus on areas of interest.<<ETX>>","AuthorNamesDeduped":"Jarke J. van Wijk","AuthorNames":"J.J. van Wijk","AuthorAffiliation":"Netherlands Energy Res. Found. ECN, Petten, Netherlands","InternalReferences":"10.1109/VISUAL.1990.146359","AuthorKeywords":"","AminerCitationCount022019":"66","XPloreCitationCount022019":"18","PubsCited":"23","Award":""}},{"name":"Jarke J. van Wijk","value":1174,"numPapers":146,"cluster":"6","visible":1,"index":36,"weight":65,"x":496.9350045233769,"y":408.1916983898167,"px":497.4072524051991,"py":405.8958437315608,"node":{"Conference":"Vis","Year":"1990","Title":"Surface representations of two- and three-dimensional fluid flow topology","DOI":"10.1109/VISUAL.1990.146359","Link":"http://dx.doi.org/10.1109/VISUAL.1990.146359","FirstPage":"6","LastPage":"13, 460","PaperType":"C","Abstract":"The use of critical point analysis to generate representations of the vector field topology of numerical flow data sets is discussed. Critical points are located and characterized in a two-dimensional domain, which may be either a two-dimensional flow field or the tangential velocity field near a three-dimensional body. Tangent curves are then integrated out along the principal directions of certain classes of critical points. The points and curves are linked to form a skeleton representing the two-dimensional vector field topology. When generated from the tangential velocity field near a body in a three-dimensional flow, the skeleton includes the critical points and curves which provide a basis for analyzing the three-dimensional structure of the flow separation.<<ETX>>","AuthorNamesDeduped":"James Helman;Lambertus Hesselink","AuthorNames":"J.L. Helman;L. Hesselink","AuthorAffiliation":"Stanford Univ., CA, USA;Stanford Univ., CA, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"102","XPloreCitationCount022019":"23","PubsCited":"11","Award":""}},{"name":"Robert J. Moorhead II","value":223,"numPapers":25,"cluster":"5","visible":1,"index":37,"weight":3,"x":126.5937129899934,"y":515.2322232780897,"px":134.69436830997324,"py":512.8508743541648,"node":{"Conference":"Vis","Year":"1994","Title":"Progressive transmission of scientific data using biorthogonal wavelet transform","DOI":"10.1109/VISUAL.1994.346332","Link":"http://dx.doi.org/10.1109/VISUAL.1994.346332","FirstPage":"93","LastPage":"99, C9","PaperType":"C","Abstract":"An important issue in scientific visualization systems is the management of data sets. Most data sets in scientific visualization, whether created by measurement or simulation, are usually voluminous. The goal of data management is to reduce the storage space and the access time of these data sets to speed up the visualization process. A new progressive transmission scheme using spline biorthogonal wavelet bases is proposed in this paper. By exploiting the properties of this set of wavelet bases, a fast algorithm involving only additions and subtractions is developed. Due to the multiresolutional nature of the wavelet transform, this scheme is compatible with hierarchical-structured rendering algorithms. The formula for reconstructing the functional values in a continuous volume space is given in a simple polynomial form. Lossless compression is possible, even when using floating-point numbers. This algorithm has been applied to data from a global ocean model. The lossless compression ratio is about 1.5:1. With a compression ratio of 50:1, the reconstructed data is still of good quality. Several other wavelet bases are compared with the spline biorthogonal wavelet bases. Finally the reconstructed data is visualized using various algorithms and the results are demonstrated.<<ETX>>","AuthorNamesDeduped":"Hai Tao;Robert J. Moorhead II","AuthorNames":"Hai Tao;R.J. Moorhead","AuthorAffiliation":"NSF Eng. Res. Center for Comput. Field Simulation, Mississippi Univ., MS, USA;NSF Eng. Res. Center for Comput. Field Simulation, Mississippi Univ., MS, USA","InternalReferences":"10.1109/VISUAL.1993.398845","AuthorKeywords":"","AminerCitationCount022019":"50","XPloreCitationCount022019":"14","PubsCited":"15","Award":""}},{"name":"Hai Tao","value":29,"numPapers":1,"cluster":"5","visible":1,"index":38,"weight":1,"x":-166.23538805185183,"y":592.3451464351904,"px":-159.35528627656015,"py":588.0614863801943,"node":{"Conference":"Vis","Year":"1994","Title":"Progressive transmission of scientific data using biorthogonal wavelet transform","DOI":"10.1109/VISUAL.1994.346332","Link":"http://dx.doi.org/10.1109/VISUAL.1994.346332","FirstPage":"93","LastPage":"99, C9","PaperType":"C","Abstract":"An important issue in scientific visualization systems is the management of data sets. Most data sets in scientific visualization, whether created by measurement or simulation, are usually voluminous. The goal of data management is to reduce the storage space and the access time of these data sets to speed up the visualization process. A new progressive transmission scheme using spline biorthogonal wavelet bases is proposed in this paper. By exploiting the properties of this set of wavelet bases, a fast algorithm involving only additions and subtractions is developed. Due to the multiresolutional nature of the wavelet transform, this scheme is compatible with hierarchical-structured rendering algorithms. The formula for reconstructing the functional values in a continuous volume space is given in a simple polynomial form. Lossless compression is possible, even when using floating-point numbers. This algorithm has been applied to data from a global ocean model. The lossless compression ratio is about 1.5:1. With a compression ratio of 50:1, the reconstructed data is still of good quality. Several other wavelet bases are compared with the spline biorthogonal wavelet bases. Finally the reconstructed data is visualized using various algorithms and the results are demonstrated.<<ETX>>","AuthorNamesDeduped":"Hai Tao;Robert J. Moorhead II","AuthorNames":"Hai Tao;R.J. Moorhead","AuthorAffiliation":"NSF Eng. Res. Center for Comput. Field Simulation, Mississippi Univ., MS, USA;NSF Eng. Res. Center for Comput. Field Simulation, Mississippi Univ., MS, USA","InternalReferences":"10.1109/VISUAL.1993.398845","AuthorKeywords":"","AminerCitationCount022019":"50","XPloreCitationCount022019":"14","PubsCited":"15","Award":""}},{"name":"Hans Hagen","value":445,"numPapers":107,"cluster":"6","visible":1,"index":39,"weight":38,"x":278.306400875514,"y":492.9542138280309,"px":284.02751441007405,"py":491.03591816008105,"node":{"Conference":"Vis","Year":"1992","Title":"Visualization of second order tensor fields and matrix data","DOI":"10.1109/VISUAL.1992.235193","Link":"http://dx.doi.org/10.1109/VISUAL.1992.235193","FirstPage":"316","LastPage":"323","PaperType":"C","Abstract":"The visualization of 3-D second-order tensor fields and matrix data is studied. The general problem of visualizing unsymmetric real or complex Hermitian second-order tensor fields can be reduced to the simultaneous visualization of a real and symmetric second-order tensor field and a real vector field. The emphasis is on exploiting the mathematical properties of tensor fields in order to facilitate their visualization and to produce a continuous representation of the data. The focus is on interactively sensing and exploring real and symmetric second-order tensor data by generalizing the vector notion of streamline to the tensor concept of hyperstreamline. The importance of a structural analysis of the data field analogous to the techniques of vector field topology extraction in order to obtain a unique and objective representation of second-order tensor fields is stressed.<<ETX>>","AuthorNamesDeduped":"Thierry Delmarcelle;Lambertus Hesselink","AuthorNames":"T. Delmarcelle;L. Hesselink","AuthorAffiliation":"Stanford Univ., CA, USA;Stanford Univ., CA, USA","InternalReferences":"10.1109/VISUAL.1990.146373;10.1109/VISUAL.1990.146359;10.1109/VISUAL.1991.175789;10.1109/VISUAL.1991.175773","AuthorKeywords":"","AminerCitationCount022019":"73","XPloreCitationCount022019":"27","PubsCited":"17","Award":"TT"}},{"name":"Jeff P. Hultquist","value":122,"numPapers":8,"cluster":"6","visible":1,"index":40,"weight":5,"x":186.2406007001965,"y":530.8846308146957,"px":193.50644548122796,"py":527.9828739760567,"node":{"Conference":"Vis","Year":"1991","Title":"The virtual windtunnel: An environment for the exploration of three-dimensional unsteady flows","DOI":"10.1109/VISUAL.1991.175771","Link":"http://dx.doi.org/10.1109/VISUAL.1991.175771","FirstPage":"17","LastPage":"24, 407","PaperType":"C","Abstract":"A recently completed implementation of a virtual environment for exploring numerically generated three-dimensional unsteady flowfields is described. A boom-mounted six-degree-of-freedom head-position-sensitive stereo CRT system is used for viewing. A hand-position-sensitive glove controller is used for injecting various tracers (e.g. smoke) into the virtual flowfield. A multiprocessor graphics workstation is used for computation and rendering. The techniques for visualizing unsteady flows are described, and the computer requirements for a variety of visualization techniques are discussed. These techniques generalize to visualization of other 3D vector fields.<<ETX>>","AuthorNamesDeduped":"Steve Bryson;Creon Levit","AuthorNames":"S. Bryson;C. Levit","AuthorAffiliation":"NASA Ames Res. Center, Moffett Field, CA, USA;NASA Ames Res. Center, Moffett Field, CA, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"244","XPloreCitationCount022019":"46","PubsCited":"11","Award":""}},{"name":"Cláudio T. Silva","value":790,"numPapers":234,"cluster":"5","visible":1,"index":41,"weight":73,"x":435.74257134054335,"y":429.07306078922375,"px":438.7346496414119,"py":428.30211800752,"node":{"Conference":"Vis","Year":"1992","Title":"Towards a comprehensive volume visualization system","DOI":"10.1109/VISUAL.1992.235231","Link":"http://dx.doi.org/10.1109/VISUAL.1992.235231","FirstPage":"13","LastPage":"20","PaperType":"C","Abstract":"The VolVis system has been developed to satisfy the diverse requirements of the volume visualization community by comfortably housing numerous visualization algorithms and methods within a consistent and well organized framework. The VolVis system is supported by a generalized abstract model which provides for both geometric and volumetric constructs. VolVis contains several rendering algorithms that span the speed versus accuracy continuum. A fast volume rendering algorithm has been developed, which is capable of exploiting existing graphics hardware without placing any viewing restrictions or compromising accuracy. In addition, VolVis includes a volumetric navigation facility, key-frame animation generator, quantitative analysis tools, and a generalized protocol for communicating with 3D input devices.<<ETX>>","AuthorNamesDeduped":"Ricardo S. Avila;Lisa M. Sobierajski;Arie E. Kaufman","AuthorNames":"R.S. Avila;L.M. Sobierajski;A.E. Kaufman","AuthorAffiliation":"State Univ. of New York, Stony Brook, NY, USA;State Univ. of New York, Stony Brook, NY, USA;State Univ. of New York, Stony Brook, NY, USA","InternalReferences":"10.1109/VISUAL.1990.146362;10.1109/VISUAL.1990.146413;10.1109/VISUAL.1991.175805","AuthorKeywords":"","AminerCitationCount022019":"156","XPloreCitationCount022019":"26","PubsCited":"16","Award":""}},{"name":"Hanspeter Pfister","value":843,"numPapers":283,"cluster":"4","visible":1,"index":42,"weight":86,"x":472.24878159941875,"y":390.7838659994787,"px":476.5722093821167,"py":389.21341825247396,"node":{"Conference":"Vis","Year":"1994","Title":"VolVis: a diversified volume visualization system","DOI":"10.1109/VISUAL.1994.346340","Link":"http://dx.doi.org/10.1109/VISUAL.1994.346340","FirstPage":"31","LastPage":"38, C3","PaperType":"C","Abstract":"VolVis is a diversified, easy to use, extensible, high performance, and portable volume visualization system for scientists and engineers as well as for visualization developers and researchers. VolVis accepts as input 3D scalar volumetric data as well as 3D volume-sampled and classical geometric models. Interaction with the data is controlled by a variety of 3D input devices in an input device-independent environment. VolVis output includes navigation preview, static images, and animation sequences. A variety of volume rendering algorithms are supported ranging from fast rough approximations, to compression-domain rendering, to accurate volumetric ray tracing and radiosity, and irregular grid rendering.<<ETX>>","AuthorNamesDeduped":"Ricardo S. Avila;Taosong He;Lichan Hong;Arie E. Kaufman;Hanspeter Pfister;Cláudio T. Silva;Lisa M. Sobierajski;Sidney W. Wang","AuthorNames":"R. Avila;Taosong He;Lichan Hong;A. Kaufman;H. Pfister;C. Silva;L. Sobierajski;S. Wang","AuthorAffiliation":"Howard Hughes Med. Inst., State Univ. of New York, Stony Brook, NY, USA","InternalReferences":"10.1109/VISUAL.1992.235231;10.1109/VISUAL.1993.398862;10.1109/VISUAL.1993.398854;10.1109/VISUAL.1990.146391","AuthorKeywords":"","AminerCitationCount022019":"139","XPloreCitationCount022019":"30","PubsCited":"15","Award":""}},{"name":"Lichan Hong","value":137,"numPapers":18,"cluster":"4","visible":1,"index":43,"weight":2,"x":440.0457174676233,"y":778.8360219566911,"px":441.22294172977155,"py":772.1404468410309,"node":{"Conference":"Vis","Year":"1994","Title":"VolVis: a diversified volume visualization system","DOI":"10.1109/VISUAL.1994.346340","Link":"http://dx.doi.org/10.1109/VISUAL.1994.346340","FirstPage":"31","LastPage":"38, C3","PaperType":"C","Abstract":"VolVis is a diversified, easy to use, extensible, high performance, and portable volume visualization system for scientists and engineers as well as for visualization developers and researchers. VolVis accepts as input 3D scalar volumetric data as well as 3D volume-sampled and classical geometric models. Interaction with the data is controlled by a variety of 3D input devices in an input device-independent environment. VolVis output includes navigation preview, static images, and animation sequences. A variety of volume rendering algorithms are supported ranging from fast rough approximations, to compression-domain rendering, to accurate volumetric ray tracing and radiosity, and irregular grid rendering.<<ETX>>","AuthorNamesDeduped":"Ricardo S. Avila;Taosong He;Lichan Hong;Arie E. Kaufman;Hanspeter Pfister;Cláudio T. Silva;Lisa M. Sobierajski;Sidney W. Wang","AuthorNames":"R. Avila;Taosong He;Lichan Hong;A. Kaufman;H. Pfister;C. Silva;L. Sobierajski;S. Wang","AuthorAffiliation":"Howard Hughes Med. Inst., State Univ. of New York, Stony Brook, NY, USA","InternalReferences":"10.1109/VISUAL.1992.235231;10.1109/VISUAL.1993.398862;10.1109/VISUAL.1993.398854;10.1109/VISUAL.1990.146391","AuthorKeywords":"","AminerCitationCount022019":"139","XPloreCitationCount022019":"30","PubsCited":"15","Award":""}},{"name":"Sidney W. Wang","value":70,"numPapers":7,"cluster":"4","visible":1,"index":44,"weight":3,"x":409.9092662989451,"y":767.7205515591852,"px":412.9193053901803,"py":760.6297723865646,"node":{"Conference":"Vis","Year":"1992","Title":"A voxel-based, forward projection algorithm for rendering surface and volumetric data","DOI":"10.1109/VISUAL.1992.235190","Link":"http://dx.doi.org/10.1109/VISUAL.1992.235190","FirstPage":"340","LastPage":"348","PaperType":"C","Abstract":"A voxel-based, forward projection algorithm with a pipeline architecture for real-time applications is presented. The multisensor capabilities (electrooptical, or visual, and infrared) currently implemented in software have also been applied to non-real-time imaging applications on workstations and minicomputers. Most suited for terrain-based applications, the system features haze, imbedded targets, moving objects, smooth shading, and specular reflections.<<ETX>>","AuthorNamesDeduped":"John R. Wright;Julia C. Hsieh","AuthorNames":"J.R. Wright;J.C.L. Hsieh","AuthorAffiliation":"Hughes Training Inc., West Covina, CA, USA;Hughes Training Inc., West Covina, CA, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"50","XPloreCitationCount022019":"9","PubsCited":"12","Award":""}},{"name":"Han-Wei Shen","value":683,"numPapers":262,"cluster":"4","visible":1,"index":45,"weight":92,"x":402.83956708731534,"y":434.11591761252606,"px":405.58951197381117,"py":432.3502261627738,"node":{"Conference":"Vis","Year":"1993","Title":"Texture splats for 3D scalar and vector field visualization","DOI":"10.1109/VISUAL.1993.398877","Link":"http://dx.doi.org/10.1109/VISUAL.1993.398877","FirstPage":"261","LastPage":"266","PaperType":"C","Abstract":"Volume visualization is becoming an important tool for understanding large 3D data sets. A popular technique for volume rendering is known as splatting. With new hardware architectures offering substantial improvements in the performance of rendering texture mapped objects, we present textured splats. An ideal reconstruction function for 3D signals is developed which can be used as a texture map for a splat. Extensions to the basic splatting technique are then developed to additionally represent vector fields.<<ETX>>","AuthorNamesDeduped":"Roger Crawfis;Nelson L. Max","AuthorNames":"R.A. Crawfis;N. Max","AuthorAffiliation":"Lawrence Livermore Nat. Lab., Livermore, CA, USA;Lawrence Livermore Nat. Lab., Livermore, CA, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"1","XPloreCitationCount022019":"73","PubsCited":"6","Award":"TT"}},{"name":"Christopher R. Johnson 0001","value":135,"numPapers":47,"cluster":"4","visible":1,"index":46,"weight":9,"x":357.46750476271836,"y":378.6344019516025,"px":361.56764447430317,"py":379.3613165577522,"node":{"Conference":"Vis","Year":"1993","Title":"Texture splats for 3D scalar and vector field visualization","DOI":"10.1109/VISUAL.1993.398877","Link":"http://dx.doi.org/10.1109/VISUAL.1993.398877","FirstPage":"261","LastPage":"266","PaperType":"C","Abstract":"Volume visualization is becoming an important tool for understanding large 3D data sets. A popular technique for volume rendering is known as splatting. With new hardware architectures offering substantial improvements in the performance of rendering texture mapped objects, we present textured splats. An ideal reconstruction function for 3D signals is developed which can be used as a texture map for a splat. Extensions to the basic splatting technique are then developed to additionally represent vector fields.<<ETX>>","AuthorNamesDeduped":"Roger Crawfis;Nelson L. Max","AuthorNames":"R.A. Crawfis;N. Max","AuthorAffiliation":"Lawrence Livermore Nat. Lab., Livermore, CA, USA;Lawrence Livermore Nat. Lab., Livermore, CA, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"1","XPloreCitationCount022019":"73","PubsCited":"6","Award":"TT"}},{"name":"Hui Ma","value":10,"numPapers":5,"cluster":"15","visible":1,"index":47,"weight":2,"x":111.85525261140371,"y":-4.950859460772782,"px":116.36102105443175,"py":2.1528949881869908,"node":{"Conference":"Vis","Year":"1994","Title":"Visualizing flow with quaternion frames","DOI":"10.1109/VISUAL.1994.346330","Link":"http://dx.doi.org/10.1109/VISUAL.1994.346330","FirstPage":"108","LastPage":"115, C11","PaperType":"C","Abstract":"Flow fields, geodesics, and deformed volumes are natural sources of families of space curves that can be characterized by intrinsic geometric properties such as curvature, torsion, and Frenet frames. By expressing a curve's moving Frenet coordinate frame as an equivalent unit quaternion, we reduce the number of components that must be displayed from nine with six constraints to four with one constraint. We can then assign a color to each curve point by dotting its quaternion frame with a 4D light vector, or we can plot the frame values separately as a curve in the three-sphere. As examples, we examine twisted volumes used in topology to construct knots and tangles, a spherical volume deformation known as the Dirac string trick, and streamlines of 3D vector flow fields.<<ETX>>","AuthorNamesDeduped":"Andrew J. Hanson;Hui Ma","AuthorNames":"A.J. Hanson;Hui Ma","AuthorAffiliation":"Dept. of Comput. Sci., Indiana Univ., Bloomington, IN, USA;Dept. of Comput. Sci., Indiana Univ., Bloomington, IN, USA","InternalReferences":"10.1109/VISUAL.1993.398869;10.1109/VISUAL.1994.346324;10.1109/VISUAL.1992.235211","AuthorKeywords":"","AminerCitationCount022019":"50","XPloreCitationCount022019":"9","PubsCited":"15","Award":""}},{"name":"Bernice E. Rogowitz","value":230,"numPapers":14,"cluster":"11","visible":1,"index":48,"weight":2,"x":1367.1149172049988,"y":757.4101837737189,"px":1365.7988554358906,"py":752.5992845659841,"node":{"Conference":"Vis","Year":"1992","Title":"Visualization of fuzzy data using generalized animation","DOI":"10.1109/VISUAL.1992.235199","Link":"http://dx.doi.org/10.1109/VISUAL.1992.235199","FirstPage":"268","LastPage":"273","PaperType":"C","Abstract":"Methods are presented for the visualization of fuzzy data based on the sensitivity of the human visual system to motion and dynamic changes, and the ease of which electronic display devices can change their display. The methods include taking an otherwise static image and displaying in an animation loop either its segmented components or a series of blurred versions of the whole image. This approach was applied to sea-surface temperature data and was found to be effective in showing fuzzy details embedded in the data, and in drawing the viewer's attention. This approach and these methods could play a significant role in the display of browse products for massive data and information systems.<<ETX>>","AuthorNamesDeduped":"Nahum D. Gershon","AuthorNames":"N.D. Gershon","AuthorAffiliation":"Mitre Corp., McLean, VA, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"59","XPloreCitationCount022019":"15","PubsCited":"6","Award":""}},{"name":"Greg Abram","value":64,"numPapers":13,"cluster":"11","visible":1,"index":49,"weight":1,"x":1447.2303160105203,"y":724.8231406284134,"px":1444.481384705675,"py":722.0344172171297,"node":{"Conference":"Vis","Year":"1995","Title":"An extended data-flow architecture for data analysis and visualization","DOI":"10.1109/VISUAL.1995.480821","Link":"http://dx.doi.org/10.1109/VISUAL.1995.480821","FirstPage":"263","LastPage":"270, 461","PaperType":"C","Abstract":"Modular visualization environments utilizing a data-flow execution model have become quite popular in recent years, especially those that incorporate visual programming tools. However, simplistic implementations of such an execution model are quite limited when applied to problems of realistic complexity, which negate the intuitive advantage of data-flow systems. This situation can be resolved by extending the execution model to incorporate a more complete and efficient programming infrastructure while still preserving the virtues of pure \"data-flow\". This approach has been used for the implementation of a general-purpose software package, IBM Visualization Data Explorer.","AuthorNamesDeduped":"Greg Abram;Lloyd Treinish","AuthorNames":"G. Abram;L. Treinish","AuthorAffiliation":"IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA;IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA","InternalReferences":"10.1109/VISUAL.1994.346305;10.1109/VISUAL.1993.398860;10.1109/VISUAL.1991.175818;10.1109/VISUAL.1992.235219","AuthorKeywords":"","AminerCitationCount022019":"167","XPloreCitationCount022019":"42","PubsCited":"15","Award":""}},{"name":"Richard S. Gallagher","value":27,"numPapers":1,"cluster":"4","visible":1,"index":50,"weight":1,"x":263.6853331115098,"y":833.184249178072,"px":268.7366793745074,"py":828.0836272679429,"node":{"Conference":"Vis","Year":"1990","Title":"Ray traced scalar fields with shaded polygonal output","DOI":"10.1109/VISUAL.1990.146390","Link":"http://dx.doi.org/10.1109/VISUAL.1990.146390","FirstPage":"263","LastPage":"272, 480-481","PaperType":"C","Abstract":"An algorithm for rendering scalar field data that reduces rendering times by as much as two orders of magnitude over traditional full resolution images is presented. Less than full-resolution sampling of the scalar field is performed using a fast ray tracing method. The sampling grid points are output as a set of screen-based Gouraud shaded polygons which are rendered in hardware by a graphics workstation. A gradient-based variable resolution algorithm that further improves rendering speed is presented. Several examples are presented.<<ETX>>","AuthorNamesDeduped":"Ray J. Meyers;Michael B. Stephenson","AuthorNames":"R.J. Meyers;M.B. Stephenson","AuthorAffiliation":"Sandia Nat. Lab., Albuquerque, NM, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"3","XPloreCitationCount022019":"2","PubsCited":"17","Award":""}},{"name":"Frits H. Post","value":219,"numPapers":31,"cluster":"6","visible":1,"index":51,"weight":1,"x":782.244582968486,"y":684.5570103011266,"px":783.9042852674872,"py":675.9678425965262,"node":{"Conference":"Vis","Year":"1993","Title":"Visualization of turbulent flow with particles","DOI":"10.1109/VISUAL.1993.398850","Link":"http://dx.doi.org/10.1109/VISUAL.1993.398850","FirstPage":"46","LastPage":"52","PaperType":"C","Abstract":"In this work a new method for visualization of three-dimensional turbulent flow using particle motion animation is presented. The method is based on Reynolds decomposition of a turbulent flow field into a convective and a turbulent motion. At each step of particle path generation a stochastic perturbation is added, resulting in random-walk motions of particles. A physical relation is established between the perturbations and the eddy-diffusivity, which is calculated in a turbulent flow simulation. The flow data used is a mean velocity field, and an eddy-diffusivity field. The erratic particle motions are more than just a visual effect, but represent a real physical phenomenon. An implementation of the method is described, and an example of a turbulent channel flow is given, which clearly shows the random particle motions in their context of general fluid motion patterns.<<ETX>>","AuthorNamesDeduped":"Andrea J. S. Hin;Frits H. Post","AuthorNames":"A.J.S. Hin;F.H. Post","AuthorAffiliation":"Fac. of Tech. Math. & Inf., Delft Univ. of Technol., Netherlands;Fac. of Tech. Math. & Inf., Delft Univ. of Technol., Netherlands","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"64","XPloreCitationCount022019":"15","PubsCited":"23","Award":""}},{"name":"David N. Kenwright","value":86,"numPapers":12,"cluster":"6","visible":1,"index":52,"weight":2,"x":5.549367797308842,"y":562.3741287931989,"px":11.198170956652575,"py":558.7130191444061,"node":{"Conference":"Vis","Year":"1992","Title":"A 3-D streamline tracking algorithm using dual stream functions","DOI":"10.1109/VISUAL.1992.235225","Link":"http://dx.doi.org/10.1109/VISUAL.1992.235225","FirstPage":"62","LastPage":"68","PaperType":"C","Abstract":"A methodology has been developed for constructing streamlines and particle paths in numerically generated fluid velocity fields. A graphical technique is used to convert the discretely defined flow within a cell into one represented by two three-dimensional stream functions. Streamlines are calculated by tracking constant values of each stream function, a process which corresponds to finding the intersection of two stream surfaces. The tracking process is mass conservative and does not use a time stepping method for integration, thus eliminating a computationally intensive part of traditional tracking algorithms. The method can be applied generally to any three-dimensional compressible or incompressible steady flow. Results presented compare the performance of the new method to the most commonly used scheme and show that calculation times can be reduced by an order of magnitude.<<ETX>>","AuthorNamesDeduped":"David N. Kenwright;Gordon D. Mallison","AuthorNames":"D.N. Kenwright;G.D. Mallinson","AuthorAffiliation":"Dept. of Mech. Eng., Auckland Univ., New Zealand;Dept. of Mech. Eng., Auckland Univ., New Zealand","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"69","XPloreCitationCount022019":"18","PubsCited":"14","Award":""}},{"name":"Creon Levit","value":149,"numPapers":2,"cluster":"6","visible":1,"index":53,"weight":4,"x":135.09094067584317,"y":548.1985833151623,"px":142.73989428885477,"py":543.680115470768,"node":{"Conference":"Vis","Year":"1990","Title":"FAST: a multi-processed environment for visualization of computational fluid dynamics","DOI":"10.1109/VISUAL.1990.146360","Link":"http://dx.doi.org/10.1109/VISUAL.1990.146360","FirstPage":"14","LastPage":"27, 461-2","PaperType":"C","Abstract":"The authors discuss FAST (flow analysis software toolkit), an implementation of a software system for fluid mechanics analysis. Visualization of computational aerodynamics requires flexible, extensible, and adaptable software tools for performing analysis tasks. An overview of FAST is given, and its architecture is discussed. Interactive visualization control is addressed. The advantages and disadvantages of FAST are discussed.<<ETX>>","AuthorNamesDeduped":"Gordon V. Bancroft;Fergus Merritt;Todd Plessel;Paul G. Kelaita;R. Kevin McCabe;Al Globus","AuthorNames":"G.V. Bancroft;F.J. Merritt;T.C. Plessel;P.G. Kelaita;R.K. McCabe;A. Globus","AuthorAffiliation":"Sterling Federal Syst. Inc., Palo Alto, CA, USA;Sterling Federal Syst. Inc., Palo Alto, CA, USA;Sterling Federal Syst. Inc., Palo Alto, CA, USA;Sterling Federal Syst. Inc., Palo Alto, CA, USA;Sterling Federal Syst. Inc., Palo Alto, CA, USA;Sterling Federal Syst. Inc., Palo Alto, CA, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"31","XPloreCitationCount022019":"29","PubsCited":"20","Award":""}},{"name":"Klaus Mueller","value":503,"numPapers":151,"cluster":"4","visible":1,"index":54,"weight":47,"x":459.5284669967733,"y":434.93291604656457,"px":462.9053259422507,"py":433.82189463329786,"node":{"Conference":"Vis","Year":"1995","Title":"A hardware acceleration method for volumetric ray tracing","DOI":"10.1109/VISUAL.1995.480792","Link":"http://dx.doi.org/10.1109/VISUAL.1995.480792","FirstPage":"27","LastPage":"34, 435","PaperType":"C","Abstract":"We present an acceleration method for volumetric ray tracing which utilizes standard graphics hardware without compromising image accuracy. The graphics hardware is employed to identify those segments of each ray that could possibly contribute to the final image. A volumetric ray tracing algorithm is then used to compute the final image, traversing only the identified segments of the rays. This technique can be used to render volumetric isosurfaces as well as translucent volumes. In addition, this method can accelerate the traversal of shadow rays when performing recursive ray tracing.","AuthorNamesDeduped":"Lisa M. Sobierajski;Ricardo S. Avila","AuthorNames":"L.M. Sobierajski;R.S. Avila","AuthorAffiliation":"Corp. Res. & Dev., Gen. Electr. Co., Schenectady, NY, USA;Corp. Res. & Dev., Gen. Electr. Co., Schenectady, NY, USA","InternalReferences":"10.1109/VISUAL.1994.346320;10.1109/VISUAL.1995.485154;10.1109/VISUAL.1990.146391;10.1109/VISUAL.1993.398854;10.1109/VISUAL.1994.346340;10.1109/VISUAL.1992.235231","AuthorKeywords":"","AminerCitationCount022019":"64","XPloreCitationCount022019":"17","PubsCited":"14","Award":""}},{"name":"Hans-Christian Hege","value":476,"numPapers":97,"cluster":"6","visible":1,"index":55,"weight":32,"x":339.33309769863627,"y":463.0047450539126,"px":344.02071407537534,"py":461.9321086807729,"node":{"Conference":"Vis","Year":"1993","Title":"Visualization of turbulent flow with particles","DOI":"10.1109/VISUAL.1993.398850","Link":"http://dx.doi.org/10.1109/VISUAL.1993.398850","FirstPage":"46","LastPage":"52","PaperType":"C","Abstract":"In this work a new method for visualization of three-dimensional turbulent flow using particle motion animation is presented. The method is based on Reynolds decomposition of a turbulent flow field into a convective and a turbulent motion. At each step of particle path generation a stochastic perturbation is added, resulting in random-walk motions of particles. A physical relation is established between the perturbations and the eddy-diffusivity, which is calculated in a turbulent flow simulation. The flow data used is a mean velocity field, and an eddy-diffusivity field. The erratic particle motions are more than just a visual effect, but represent a real physical phenomenon. An implementation of the method is described, and an example of a turbulent channel flow is given, which clearly shows the random particle motions in their context of general fluid motion patterns.<<ETX>>","AuthorNamesDeduped":"Andrea J. S. Hin;Frits H. Post","AuthorNames":"A.J.S. Hin;F.H. Post","AuthorAffiliation":"Fac. of Tech. Math. & Inf., Delft Univ. of Technol., Netherlands;Fac. of Tech. Math. & Inf., Delft Univ. of Technol., Netherlands","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"64","XPloreCitationCount022019":"15","PubsCited":"23","Award":""}},{"name":"Wim C. de Leeuw","value":210,"numPapers":27,"cluster":"6","visible":1,"index":56,"weight":8,"x":302.810463789463,"y":575.4023278948242,"px":307.61983713514735,"py":570.8757831378367,"node":{"Conference":"Vis","Year":"1992","Title":"Visualization of second order tensor fields and matrix data","DOI":"10.1109/VISUAL.1992.235193","Link":"http://dx.doi.org/10.1109/VISUAL.1992.235193","FirstPage":"316","LastPage":"323","PaperType":"C","Abstract":"The visualization of 3-D second-order tensor fields and matrix data is studied. The general problem of visualizing unsymmetric real or complex Hermitian second-order tensor fields can be reduced to the simultaneous visualization of a real and symmetric second-order tensor field and a real vector field. The emphasis is on exploiting the mathematical properties of tensor fields in order to facilitate their visualization and to produce a continuous representation of the data. The focus is on interactively sensing and exploring real and symmetric second-order tensor data by generalizing the vector notion of streamline to the tensor concept of hyperstreamline. The importance of a structural analysis of the data field analogous to the techniques of vector field topology extraction in order to obtain a unique and objective representation of second-order tensor fields is stressed.<<ETX>>","AuthorNamesDeduped":"Thierry Delmarcelle;Lambertus Hesselink","AuthorNames":"T. Delmarcelle;L. Hesselink","AuthorAffiliation":"Stanford Univ., CA, USA;Stanford Univ., CA, USA","InternalReferences":"10.1109/VISUAL.1990.146373;10.1109/VISUAL.1990.146359;10.1109/VISUAL.1991.175789;10.1109/VISUAL.1991.175773","AuthorKeywords":"","AminerCitationCount022019":"73","XPloreCitationCount022019":"27","PubsCited":"17","Award":"TT"}},{"name":"Ed Huai-hsin Chi","value":194,"numPapers":28,"cluster":"10","visible":1,"index":57,"weight":7,"x":1135.4183949927108,"y":50.995164383101844,"px":1128.6539420456804,"py":51.17095628787355,"node":{"Conference":"Vis","Year":"1993","Title":"Computer visualization of long genomic sequences","DOI":"10.1109/VISUAL.1993.398883","Link":"http://dx.doi.org/10.1109/VISUAL.1993.398883","FirstPage":"308","LastPage":"315","PaperType":"C","Abstract":"Human beings find it difficult to analyze local and global oligonucleotide patterns in the linear primary sequences of a genome. In this paper, we present a family of iterated function systems (IFS) that can be used to generate a set of visual models of a DNA sequence. A new visualization function, the W-curve, that is derived from this IFS family is introduced. Using W-curves, a user can readily compare subsequences within a long genomic sequence - or between genomic sequences - and can visually evaluate the effect of local variations (mutations) upon the global genomic information content.<<ETX>>","AuthorNamesDeduped":"Dachywan Wu;James Roberge;Douglas J. Cork;Bao Gia Nguyen;Thom Grace","AuthorNames":"D. Wu;J. Roberge;D.J. Cork;B.G. Nguyen;T. Grace","AuthorAffiliation":"Illinois Inst. of Technol., Chicago, IL, USA;Illinois Inst. of Technol., Chicago, IL, USA;Illinois Inst. of Technol., Chicago, IL, USA;Illinois Inst. of Technol., Chicago, IL, USA;Illinois Inst. of Technol., Chicago, IL, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"10","XPloreCitationCount022019":"7","PubsCited":"14","Award":""}},{"name":"Phillip Barry","value":51,"numPapers":9,"cluster":"10","visible":1,"index":58,"weight":2,"x":1285.6329085348127,"y":-69.46840009505733,"px":1279.2571040626513,"py":-69.84687319343435,"node":{"Conference":"Vis","Year":"1993","Title":"Computer visualization of long genomic sequences","DOI":"10.1109/VISUAL.1993.398883","Link":"http://dx.doi.org/10.1109/VISUAL.1993.398883","FirstPage":"308","LastPage":"315","PaperType":"C","Abstract":"Human beings find it difficult to analyze local and global oligonucleotide patterns in the linear primary sequences of a genome. In this paper, we present a family of iterated function systems (IFS) that can be used to generate a set of visual models of a DNA sequence. A new visualization function, the W-curve, that is derived from this IFS family is introduced. Using W-curves, a user can readily compare subsequences within a long genomic sequence - or between genomic sequences - and can visually evaluate the effect of local variations (mutations) upon the global genomic information content.<<ETX>>","AuthorNamesDeduped":"Dachywan Wu;James Roberge;Douglas J. Cork;Bao Gia Nguyen;Thom Grace","AuthorNames":"D. Wu;J. Roberge;D.J. Cork;B.G. Nguyen;T. Grace","AuthorAffiliation":"Illinois Inst. of Technol., Chicago, IL, USA;Illinois Inst. of Technol., Chicago, IL, USA;Illinois Inst. of Technol., Chicago, IL, USA;Illinois Inst. of Technol., Chicago, IL, USA;Illinois Inst. of Technol., Chicago, IL, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"10","XPloreCitationCount022019":"7","PubsCited":"14","Award":""}},{"name":"Elizabeth Shoop","value":24,"numPapers":4,"cluster":"10","visible":1,"index":59,"weight":2,"x":1318.9920251025758,"y":-10.323023188021567,"px":1312.1943117887408,"py":-12.467652778462009,"node":{"Conference":"Vis","Year":"1993","Title":"Computer visualization of long genomic sequences","DOI":"10.1109/VISUAL.1993.398883","Link":"http://dx.doi.org/10.1109/VISUAL.1993.398883","FirstPage":"308","LastPage":"315","PaperType":"C","Abstract":"Human beings find it difficult to analyze local and global oligonucleotide patterns in the linear primary sequences of a genome. In this paper, we present a family of iterated function systems (IFS) that can be used to generate a set of visual models of a DNA sequence. A new visualization function, the W-curve, that is derived from this IFS family is introduced. Using W-curves, a user can readily compare subsequences within a long genomic sequence - or between genomic sequences - and can visually evaluate the effect of local variations (mutations) upon the global genomic information content.<<ETX>>","AuthorNamesDeduped":"Dachywan Wu;James Roberge;Douglas J. Cork;Bao Gia Nguyen;Thom Grace","AuthorNames":"D. Wu;J. Roberge;D.J. Cork;B.G. Nguyen;T. Grace","AuthorAffiliation":"Illinois Inst. of Technol., Chicago, IL, USA;Illinois Inst. of Technol., Chicago, IL, USA;Illinois Inst. of Technol., Chicago, IL, USA;Illinois Inst. of Technol., Chicago, IL, USA;Illinois Inst. of Technol., Chicago, IL, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"10","XPloreCitationCount022019":"7","PubsCited":"14","Award":""}},{"name":"John V. Carlis","value":24,"numPapers":12,"cluster":"10","visible":1,"index":60,"weight":2,"x":1301.1438829405065,"y":-48.68328633018702,"px":1294.685047437329,"py":-50.12739432088697,"node":{"Conference":"Vis","Year":"1993","Title":"Computer visualization of long genomic sequences","DOI":"10.1109/VISUAL.1993.398883","Link":"http://dx.doi.org/10.1109/VISUAL.1993.398883","FirstPage":"308","LastPage":"315","PaperType":"C","Abstract":"Human beings find it difficult to analyze local and global oligonucleotide patterns in the linear primary sequences of a genome. In this paper, we present a family of iterated function systems (IFS) that can be used to generate a set of visual models of a DNA sequence. A new visualization function, the W-curve, that is derived from this IFS family is introduced. Using W-curves, a user can readily compare subsequences within a long genomic sequence - or between genomic sequences - and can visually evaluate the effect of local variations (mutations) upon the global genomic information content.<<ETX>>","AuthorNamesDeduped":"Dachywan Wu;James Roberge;Douglas J. Cork;Bao Gia Nguyen;Thom Grace","AuthorNames":"D. Wu;J. Roberge;D.J. Cork;B.G. Nguyen;T. Grace","AuthorAffiliation":"Illinois Inst. of Technol., Chicago, IL, USA;Illinois Inst. of Technol., Chicago, IL, USA;Illinois Inst. of Technol., Chicago, IL, USA;Illinois Inst. of Technol., Chicago, IL, USA;Illinois Inst. of Technol., Chicago, IL, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"10","XPloreCitationCount022019":"7","PubsCited":"14","Award":""}},{"name":"Ernest F. Retzel","value":24,"numPapers":4,"cluster":"10","visible":1,"index":61,"weight":2,"x":1256.8159592844993,"y":-70.64514968738031,"px":1250.656147425122,"py":-70.74079267245904,"node":{"Conference":"Vis","Year":"1993","Title":"Computer visualization of long genomic sequences","DOI":"10.1109/VISUAL.1993.398883","Link":"http://dx.doi.org/10.1109/VISUAL.1993.398883","FirstPage":"308","LastPage":"315","PaperType":"C","Abstract":"Human beings find it difficult to analyze local and global oligonucleotide patterns in the linear primary sequences of a genome. In this paper, we present a family of iterated function systems (IFS) that can be used to generate a set of visual models of a DNA sequence. A new visualization function, the W-curve, that is derived from this IFS family is introduced. Using W-curves, a user can readily compare subsequences within a long genomic sequence - or between genomic sequences - and can visually evaluate the effect of local variations (mutations) upon the global genomic information content.<<ETX>>","AuthorNamesDeduped":"Dachywan Wu;James Roberge;Douglas J. Cork;Bao Gia Nguyen;Thom Grace","AuthorNames":"D. Wu;J. Roberge;D.J. Cork;B.G. Nguyen;T. Grace","AuthorAffiliation":"Illinois Inst. of Technol., Chicago, IL, USA;Illinois Inst. of Technol., Chicago, IL, USA;Illinois Inst. of Technol., Chicago, IL, USA;Illinois Inst. of Technol., Chicago, IL, USA;Illinois Inst. of Technol., Chicago, IL, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"10","XPloreCitationCount022019":"7","PubsCited":"14","Award":""}},{"name":"John Riedl","value":111,"numPapers":17,"cluster":"10","visible":1,"index":62,"weight":6,"x":1274.792489462192,"y":-14.752255916374201,"px":1268.486087687013,"py":-15.361482805213045,"node":{"Conference":"Vis","Year":"1993","Title":"Computer visualization of long genomic sequences","DOI":"10.1109/VISUAL.1993.398883","Link":"http://dx.doi.org/10.1109/VISUAL.1993.398883","FirstPage":"308","LastPage":"315","PaperType":"C","Abstract":"Human beings find it difficult to analyze local and global oligonucleotide patterns in the linear primary sequences of a genome. In this paper, we present a family of iterated function systems (IFS) that can be used to generate a set of visual models of a DNA sequence. A new visualization function, the W-curve, that is derived from this IFS family is introduced. Using W-curves, a user can readily compare subsequences within a long genomic sequence - or between genomic sequences - and can visually evaluate the effect of local variations (mutations) upon the global genomic information content.<<ETX>>","AuthorNamesDeduped":"Dachywan Wu;James Roberge;Douglas J. Cork;Bao Gia Nguyen;Thom Grace","AuthorNames":"D. Wu;J. Roberge;D.J. Cork;B.G. Nguyen;T. Grace","AuthorAffiliation":"Illinois Inst. of Technol., Chicago, IL, USA;Illinois Inst. of Technol., Chicago, IL, USA;Illinois Inst. of Technol., Chicago, IL, USA;Illinois Inst. of Technol., Chicago, IL, USA;Illinois Inst. of Technol., Chicago, IL, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"10","XPloreCitationCount022019":"7","PubsCited":"14","Award":""}},{"name":"Pak Chung Wong","value":325,"numPapers":56,"cluster":"2","visible":1,"index":63,"weight":20,"x":627.1682457103952,"y":291.93020522407255,"px":625.5323627976584,"py":293.36694160936645,"node":{"Conference":"Vis","Year":"1994","Title":"Wavelet-based volume morphing","DOI":"10.1109/VISUAL.1994.346333","Link":"http://dx.doi.org/10.1109/VISUAL.1994.346333","FirstPage":"85","LastPage":"92, C8","PaperType":"C","Abstract":"This paper presents a technique for performing volume morphing between two volumetric datasets in the wavelet domain. The idea is to decompose the volumetric datasets into a set of frequency bands, apply smooth interpolation to each band, and reconstruct to form the morphed model. In addition, a technique for establishing a suitable correspondence among object voxels is presented. The combination of these two techniques results in a smooth transition between the two datasets and produces morphed volume with fewer high frequency distortions than those obtained from spatial domain volume morphing.<<ETX>>","AuthorNamesDeduped":"Taosong He;Sidney W. Wang;Arie E. Kaufman","AuthorNames":"Taosong He;S. Wang;A. Kaufman","AuthorAffiliation":"Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA;Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA;Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA","InternalReferences":"10.1109/VISUAL.1993.398854","AuthorKeywords":"","AminerCitationCount022019":"182","XPloreCitationCount022019":"22","PubsCited":"9","Award":""}},{"name":"R. Daniel Bergeron","value":117,"numPapers":20,"cluster":"2","visible":1,"index":64,"weight":4,"x":717.0112324493541,"y":367.48863152977947,"px":713.4850353560579,"py":367.8503686715288,"node":{"Conference":"Vis","Year":"1991","Title":"Interactive data exploration with a supercomputer","DOI":"10.1109/VISUAL.1991.175809","Link":"http://dx.doi.org/10.1109/VISUAL.1991.175809","FirstPage":"248","LastPage":"254","PaperType":"C","Abstract":"An experiment in exploratory data visualization using a massively parallel processor is described. In exploratory data visualization, it is typically not known what is being looked for: instead, the data are explored with a variety of visualization techniques that can illuminate its nature by demonstrating patterns in it. With this approach, the authors were able to find new features in some of their oldest datasets and to create more vivid presentations of familiar features in these datasets. Their experience has also led to a better understanding of the nature of the exploratory visualization and has resulted in some formal representations of the interaction process in this environment.<<ETX>>","AuthorNamesDeduped":"Stuart Smith;Georges G. Grinstein;R. Daniel Bergeron","AuthorNames":"S. Smith;G. Grinstein;R.D. Bergeron","AuthorAffiliation":"Dept. of Comput. Sci., Lowell Univ., MA, USA;Dept. of Comput. Sci., Lowell Univ., MA, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"50","XPloreCitationCount022019":"8","PubsCited":"7","Award":""}},{"name":"Suresh K. Lodha","value":86,"numPapers":19,"cluster":"6","visible":1,"index":65,"weight":2,"x":114.68704247892693,"y":762.3996953576328,"px":120.81446114644393,"py":762.0958980520087,"node":{"Conference":"Vis","Year":"1992","Title":"Visualization of fuzzy data using generalized animation","DOI":"10.1109/VISUAL.1992.235199","Link":"http://dx.doi.org/10.1109/VISUAL.1992.235199","FirstPage":"268","LastPage":"273","PaperType":"C","Abstract":"Methods are presented for the visualization of fuzzy data based on the sensitivity of the human visual system to motion and dynamic changes, and the ease of which electronic display devices can change their display. The methods include taking an otherwise static image and displaying in an animation loop either its segmented components or a series of blurred versions of the whole image. This approach was applied to sea-surface temperature data and was found to be effective in showing fuzzy details embedded in the data, and in drawing the viewer's attention. This approach and these methods could play a significant role in the display of browse products for massive data and information systems.<<ETX>>","AuthorNamesDeduped":"Nahum D. Gershon","AuthorNames":"N.D. Gershon","AuthorAffiliation":"Mitre Corp., McLean, VA, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"59","XPloreCitationCount022019":"15","PubsCited":"6","Award":""}},{"name":"David S. Ebert","value":688,"numPapers":196,"cluster":"2","visible":1,"index":66,"weight":52,"x":490.8324866156576,"y":385.819409156083,"px":491.60547523372446,"py":387.80806490695545,"node":{"Conference":"Vis","Year":"1995","Title":"Iconic techniques for feature visualization","DOI":"10.1109/VISUAL.1995.485141","Link":"http://dx.doi.org/10.1109/VISUAL.1995.485141","FirstPage":"288","LastPage":"295, 464","PaperType":"C","Abstract":"Presents a conceptual framework and a process model for feature extraction and iconic visualization. Feature extraction is viewed as a process of data abstraction, which can proceed in multiple stages, and corresponding data abstraction levels. The features are represented by attribute sets, which play a key role in the visualization process. Icons are symbolic parametric objects, designed as visual representations of features. The attributes are mapped to the parameters (or degrees of freedom) of an icon. We describe some generic techniques to generate attribute sets, such as volume integrals and medial axis transforms. A simple but powerful modeling language was developed to create icons, and to link the attributes to the icon parameters. We present illustrative examples of iconic visualization created with the techniques described, showing the effectiveness of this approach.","AuthorNamesDeduped":"Frank J. Post;Theo van Walsum;Frits H. Post;Deborah Silver","AuthorNames":"F.J. Post;T. van Walsum;F.H. Post;D. Silver","AuthorAffiliation":"Fac. of Tech. Math. & Inf., Delft Univ. of Technol., Netherlands;Fac. of Tech. Math. & Inf., Delft Univ. of Technol., Netherlands;Fac. of Tech. Math. & Inf., Delft Univ. of Technol., Netherlands","InternalReferences":"10.1109/VISUAL.1993.398849;10.1109/VISUAL.1991.175809;10.1109/VISUAL.1992.235174","AuthorKeywords":"scientific visualization, feature extraction, iconic visualization, attribute calculation","AminerCitationCount022019":"168","XPloreCitationCount022019":"49","PubsCited":"25","Award":""}},{"name":"Penny Rheingans","value":390,"numPapers":66,"cluster":"4","visible":1,"index":67,"weight":16,"x":446.8355348497931,"y":493.03460904878006,"px":449.09645955803285,"py":490.50285417950977,"node":{"Conference":"Vis","Year":"1992","Title":"Display of scientific data structures for algorithm visualization","DOI":"10.1109/VISUAL.1992.235215","Link":"http://dx.doi.org/10.1109/VISUAL.1992.235215","FirstPage":"139","LastPage":"146","PaperType":"C","Abstract":"A technique for defining graphical depictions for all the data types defined in an algorithm is presented. The ability to display arbitrary combinations of an algorithm's data objects in a common frame of reference, coupled with interactive control of algorithm execution, provides a powerful way to understand algorithm behavior. Type definitions are constrained so that all primitive values occurring in data objects are assigned scalar types. A graphical display, including user interaction with the display, is modeled by a special data type. Mappings from the scalar types into the display model type provide a simple user interface for controlling how all data types are depicted, without the need for type-specific graphics logic.<<ETX>>","AuthorNamesDeduped":"William L. Hibbard;Charles R. Dyer;Brian E. Paul","AuthorNames":"W. Hibbard;C.R. Dyer;B. Paul","AuthorAffiliation":"Wisconsin Univ., Madison, WI, USA;Wisconsin Univ., Madison, WI, USA;Wisconsin Univ., Madison, WI, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"68","XPloreCitationCount022019":"14","PubsCited":"9","Award":""}},{"name":"Victoria Interrante","value":210,"numPapers":20,"cluster":"6","visible":1,"index":68,"weight":6,"x":555.0043318223545,"y":629.2947402525771,"px":555.8292601788258,"py":623.56239468451,"node":{"Conference":"Vis","Year":"1995","Title":"Enhancing transparent skin surfaces with ridge and valley lines","DOI":"10.1109/VISUAL.1995.480795","Link":"http://dx.doi.org/10.1109/VISUAL.1995.480795","FirstPage":"52","LastPage":"59, 438","PaperType":"C","Abstract":"There are many applications that can benefit from the simultaneous display of multiple layers of data. The objective in these cases is to render the layered surfaces in a such way that the outer structures can be seen and seen through at the same time. The paper focuses on the particular application of radiation therapy treatment planning, in which physicians need to understand the three dimensional distribution of radiation dose in the context of patient anatomy. We describe a promising technique for communicating the shape and position of the transparent skin surface while at the same time minimally occluding underlying isointensity dose surfaces and anatomical objects: adding a sparse, opaque texture comprised of a small set of carefully chosen lines. We explain the perceptual motivation for explicitly drawing ridge and valley curves on a transparent surface, describe straightforward mathematical techniques for detecting and rendering these lines, and propose a small number of reasonably effective methods for selectively emphasizing the most perceptually relevant lines in the display.","AuthorNamesDeduped":"Victoria Interrante;Henry Fuchs;Stephen M. Pizer","AuthorNames":"V. Interrante;H. Fuchs;S. Pizer","AuthorAffiliation":"Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA;Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA;Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"169","XPloreCitationCount022019":"49","PubsCited":"19","Award":""}},{"name":"Robert E. Sheehan","value":73,"numPapers":10,"cluster":"6","visible":1,"index":69,"weight":1,"x":42.75901581074184,"y":809.3617190245066,"px":46.16056726244768,"py":804.4982542147787,"node":{"Conference":"Vis","Year":"1992","Title":"Visualization of fuzzy data using generalized animation","DOI":"10.1109/VISUAL.1992.235199","Link":"http://dx.doi.org/10.1109/VISUAL.1992.235199","FirstPage":"268","LastPage":"273","PaperType":"C","Abstract":"Methods are presented for the visualization of fuzzy data based on the sensitivity of the human visual system to motion and dynamic changes, and the ease of which electronic display devices can change their display. The methods include taking an otherwise static image and displaying in an animation loop either its segmented components or a series of blurred versions of the whole image. This approach was applied to sea-surface temperature data and was found to be effective in showing fuzzy details embedded in the data, and in drawing the viewer's attention. This approach and these methods could play a significant role in the display of browse products for massive data and information systems.<<ETX>>","AuthorNamesDeduped":"Nahum D. Gershon","AuthorNames":"N.D. Gershon","AuthorAffiliation":"Mitre Corp., McLean, VA, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"59","XPloreCitationCount022019":"15","PubsCited":"6","Award":""}},{"name":"Christopher G. Healey","value":182,"numPapers":23,"cluster":"6","visible":1,"index":70,"weight":4,"x":1206.4672890999866,"y":769.392196336887,"px":1204.3273979180703,"py":763.9475297277604,"node":{"Conference":"Vis","Year":"1995","Title":"A rule-based tool for assisting colormap selection","DOI":"10.1109/VISUAL.1995.480803","Link":"http://dx.doi.org/10.1109/VISUAL.1995.480803","FirstPage":"118","LastPage":"125, 444","PaperType":"C","Abstract":"The paper presents an interactive approach for guiding the user's select of colormaps in visualization. PRAVDAColor, implemented as a module in the IBM Visualization Data Explorer, provides the user a selection of appropriate colormaps given the data type and spatial frequency, the user's task, and properties of the human perceptual system.","AuthorNamesDeduped":"Lawrence D. Bergman;Bernice E. Rogowitz;Lloyd Treinish","AuthorNames":"L.D. Bergman;B.E. Rogowitz;L.A. Treinish","AuthorAffiliation":"IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA;IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA;IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA","InternalReferences":"10.1109/VISUAL.1995.480821;10.1109/VISUAL.1993.398874","AuthorKeywords":"","AminerCitationCount022019":"238","XPloreCitationCount022019":"62","PubsCited":"24","Award":""}},{"name":"Charles D. Hansen","value":766,"numPapers":104,"cluster":"4","visible":1,"index":71,"weight":51,"x":366.8245857477277,"y":423.53118295251545,"px":371.75218058586313,"py":423.7736018648532,"node":{"Conference":"Vis","Year":"1991","Title":"The asymptotic decider: resolving the ambiguity in marching cubes","DOI":"10.1109/VISUAL.1991.175782","Link":"http://dx.doi.org/10.1109/VISUAL.1991.175782","FirstPage":"83","LastPage":"91, 413","PaperType":"C","Abstract":"A method for computing isovalue or contour surfaces of a trivariate function is discussed. The input data are values of the trivariate function, F/sub ijk/, at the cuberille grid points (x/sub i/, y/sub j/, z/sub k/), and the output of a collection of triangles representing the surface consisting of all points where F(x,y,z) is a constant value. The method is a modification that is intended to correct a problem with a previous method.<<ETX>>","AuthorNamesDeduped":"Gregory M. Nielson;Bernd Hamann","AuthorNames":"G.M. Nielson;B. Hamann","AuthorAffiliation":"Dept. of Comput. Sci., Arizona State Univ., Tempe, AZ, USA;Dept. of Comput. Sci., Arizona State Univ., Tempe, AZ, USA","InternalReferences":"10.1109/VISUAL.1990.146363","AuthorKeywords":"","AminerCitationCount022019":"697","XPloreCitationCount022019":"146","PubsCited":"16","Award":""}},{"name":"Yarden Livnat","value":248,"numPapers":31,"cluster":"4","visible":1,"index":72,"weight":20,"x":319.97598614480574,"y":439.10414898416144,"px":324.96582888016906,"py":439.7377714931907,"node":{"Conference":"Vis","Year":"1991","Title":"Span filtering: an optimization scheme for volume visualization of large finite element models","DOI":"10.1109/VISUAL.1991.175780","Link":"http://dx.doi.org/10.1109/VISUAL.1991.175780","FirstPage":"68","LastPage":"75, 411","PaperType":"C","Abstract":"Techniques for displaying 3D isovalues of scalar fields such as stress within a solid finite-element model generally involve examining each element for values of interest. An inexpensive, straightforward method is discussed for reducing the number of elements searched for such isovalues. It takes advantage of one traversal of the element data to yield a compact classification of the model by result values and ranges, with no sorting required. This data structure can then relate any scalar isovalue to a set of element groups which are closely inclusive of the isovalue. This method is intended for applications requiring repeated access to the analysis data, such as animation and interactive rendering of isosurfaces and scalar fields. While applicable to general volume visualization problems, it is particularly well suited to optimizing real-valued continuum field results such as those found in finite-element data.<<ETX>>","AuthorNamesDeduped":"Richard S. Gallagher","AuthorNames":"R.S. Gallagher","AuthorAffiliation":"Swanson Analysis Systems Inc., Houston, PA, USA","InternalReferences":"10.1109/VISUAL.1990.146390","AuthorKeywords":"","AminerCitationCount022019":"","XPloreCitationCount022019":"22","PubsCited":"21","Award":""}},{"name":"Takayuki Itoh","value":26,"numPapers":3,"cluster":"4","visible":1,"index":73,"weight":2,"x":135.91111866833137,"y":488.4380174875567,"px":142.6303243268863,"py":486.9059419745653,"node":{"Conference":"Vis","Year":"1992","Title":"Visualization of simulated airflow in a clean room","DOI":"10.1109/VISUAL.1992.235213","Link":"http://dx.doi.org/10.1109/VISUAL.1992.235213","FirstPage":"156","LastPage":"163","PaperType":"C","Abstract":"Techniques for visualizing a simulated air flow in a clean room are developed by using an efficient cell traverse of tetrahedral cells generated from irregular volumes. The proposed techniques, probing and stream line display, are related to the measurement techniques used in actual clean rooms. The efficient traverse makes it possible to move freely around a given irregular volume and to spawn off stream lines. A successful application of these techniques to a problem in a clean room is also described.<<ETX>>","AuthorNamesDeduped":"K. Koyamada","AuthorNames":"K. Koyamada","AuthorAffiliation":"Tokyo Res. Lab., Japan","InternalReferences":"10.1109/VISUAL.1991.175771","AuthorKeywords":"","AminerCitationCount022019":"12","XPloreCitationCount022019":"6","PubsCited":"9","Award":""}},{"name":"Koji Koyamada","value":26,"numPapers":3,"cluster":"4","visible":1,"index":74,"weight":2,"x":160.28085531521415,"y":363.497312613487,"px":166.6419297744743,"py":365.76895007186573,"node":{"Conference":"Vis","Year":"1992","Title":"Visualization of simulated airflow in a clean room","DOI":"10.1109/VISUAL.1992.235213","Link":"http://dx.doi.org/10.1109/VISUAL.1992.235213","FirstPage":"156","LastPage":"163","PaperType":"C","Abstract":"Techniques for visualizing a simulated air flow in a clean room are developed by using an efficient cell traverse of tetrahedral cells generated from irregular volumes. The proposed techniques, probing and stream line display, are related to the measurement techniques used in actual clean rooms. The efficient traverse makes it possible to move freely around a given irregular volume and to spawn off stream lines. A successful application of these techniques to a problem in a clean room is also described.<<ETX>>","AuthorNamesDeduped":"K. Koyamada","AuthorNames":"K. Koyamada","AuthorAffiliation":"Tokyo Res. Lab., Japan","InternalReferences":"10.1109/VISUAL.1991.175771","AuthorKeywords":"","AminerCitationCount022019":"12","XPloreCitationCount022019":"6","PubsCited":"9","Award":""}},{"name":"Alan Keahey","value":100,"numPapers":12,"cluster":"4","visible":1,"index":75,"weight":3,"x":341.5996461965116,"y":931.4493116828361,"px":343.00581177132244,"py":920.0880122391926,"node":{"Conference":"InfoVis","Year":"1996","Title":"Techniques for non-linear magnification transformations","DOI":"10.1109/INFVIS.1996.559214","Link":"http://dx.doi.org/10.1109/INFVIS.1996.559214","FirstPage":"38","LastPage":"45","PaperType":"C","Abstract":"This paper presents efficient methods for implementing general non-linear magnification transformations. Techniques are provided for: combining linear and non-linear magnifications, constraining the domain of magnifications, combining multiple transformations, and smoothly interpolating between magnified and normal views. In addition, piecewise linear methods are introduced which allow greater efficiency and expressiveness than their continuous counterparts.","AuthorNamesDeduped":"Alan Keahey;Edward L. Robertson","AuthorNames":"T.A. Keahey;E.L. Robertson","AuthorAffiliation":"Dept. of Comput. Sci., Indiana Univ., Bloomington, IN, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"","XPloreCitationCount022019":"38","PubsCited":"17","Award":""}},{"name":"Edward L. Robertson","value":69,"numPapers":1,"cluster":"4","visible":1,"index":76,"weight":3,"x":317.2565384042592,"y":933.4433272243299,"px":316.91296745616336,"py":924.7911709095267,"node":{"Conference":"InfoVis","Year":"1996","Title":"Techniques for non-linear magnification transformations","DOI":"10.1109/INFVIS.1996.559214","Link":"http://dx.doi.org/10.1109/INFVIS.1996.559214","FirstPage":"38","LastPage":"45","PaperType":"C","Abstract":"This paper presents efficient methods for implementing general non-linear magnification transformations. Techniques are provided for: combining linear and non-linear magnifications, constraining the domain of magnifications, combining multiple transformations, and smoothly interpolating between magnified and normal views. In addition, piecewise linear methods are introduced which allow greater efficiency and expressiveness than their continuous counterparts.","AuthorNamesDeduped":"Alan Keahey;Edward L. Robertson","AuthorNames":"T.A. Keahey;E.L. Robertson","AuthorAffiliation":"Dept. of Comput. Sci., Indiana Univ., Bloomington, IN, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"","XPloreCitationCount022019":"38","PubsCited":"17","Award":""}},{"name":"Torsten Möller","value":835,"numPapers":181,"cluster":"3","visible":1,"index":77,"weight":65,"x":450.302067219554,"y":385.5410376603121,"px":453.3723247631675,"py":385.2248439748487,"node":{"Conference":"Vis","Year":"1994","Title":"An evaluation of reconstruction filters for volume rendering","DOI":"10.1109/VISUAL.1994.346331","Link":"http://dx.doi.org/10.1109/VISUAL.1994.346331","FirstPage":"100","LastPage":"107, C10","PaperType":"C","Abstract":"To render images from a three-dimensional array of sample values, it is necessary to interpolate between the samples. This paper is concerned with interpolation methods that are equivalent to convolving the samples with a reconstruction filter; this covers all commonly used schemes, including trilinear and cubic interpolation. We first outline the formal basis of interpolation in three-dimensional signal processing theory. We then propose numerical metrics that can be used to measure filter characteristics that are relevant to the appearance of images generated using that filter. We apply those metrics to several previously used filters and relate the results to isosurface images of the interpolations. We show that the choice of interpolation scheme can have a dramatic effect on image quality, and we discuss the cost/benefit tradeoff inherent in choosing a filter.<<ETX>>","AuthorNamesDeduped":"Steve Marschner;Richard Lobb","AuthorNames":"S.R. Marschner;R.J. Lobb","AuthorAffiliation":"Program of Comput. Graphics, Cornell Univ., Ithaca, NY, USA;Program of Comput. Graphics, Cornell Univ., Ithaca, NY, USA","InternalReferences":"10.1109/VISUAL.1993.398851","AuthorKeywords":"","AminerCitationCount022019":"372","XPloreCitationCount022019":"113","PubsCited":"19","Award":""}},{"name":"Steve Marschner","value":90,"numPapers":1,"cluster":"3","visible":1,"index":78,"weight":3,"x":450.31770583887334,"y":630.7619912332898,"px":452.8236164999186,"py":625.7609612230935,"node":{"Conference":"Vis","Year":"1993","Title":"Optimal filter design for volume reconstruction and visualization","DOI":"10.1109/VISUAL.1993.398851","Link":"http://dx.doi.org/10.1109/VISUAL.1993.398851","FirstPage":"54","LastPage":"61","PaperType":"C","Abstract":"Digital filtering is a crucial operation in volume reconstruction and visualization. Lowpass filters are needed for subsampling and minification. Interpolation filters are needed for registration and magnification, and to compensate for geometric distortions introduced by scanners. Interpolation filters are also needed in volume rendering for ray-casting and slicing. In this paper, we describe a method for digital filter design of interpolation filters based on weighted Chebyshev minimization. The accuracy of the resulting filters are compared with some commonly used filters defined by piecewise cubic polynomials. A significant finding of this paper is that although piecewise cubic interpolation has some computational advantages and may yield visually satisfactory results for some data, other data result in artifacts such as blurring. Furthermore, piecewise cubic filters are inferior for operations such as registration. Better results are obtained by the filters derived in this papers at only small increases in computation.<<ETX>>","AuthorNamesDeduped":"Ingrid Carlbom","AuthorNames":"I. Carlbom","AuthorAffiliation":"Digital Equipment Corp., Cambridge, MA, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"43","XPloreCitationCount022019":"20","PubsCited":"26","Award":""}},{"name":"Richard Lobb","value":90,"numPapers":1,"cluster":"3","visible":1,"index":79,"weight":3,"x":455.6832368219298,"y":641.7372044871587,"px":458.40401519218113,"py":636.5656544067733,"node":{"Conference":"Vis","Year":"1993","Title":"Optimal filter design for volume reconstruction and visualization","DOI":"10.1109/VISUAL.1993.398851","Link":"http://dx.doi.org/10.1109/VISUAL.1993.398851","FirstPage":"54","LastPage":"61","PaperType":"C","Abstract":"Digital filtering is a crucial operation in volume reconstruction and visualization. Lowpass filters are needed for subsampling and minification. Interpolation filters are needed for registration and magnification, and to compensate for geometric distortions introduced by scanners. Interpolation filters are also needed in volume rendering for ray-casting and slicing. In this paper, we describe a method for digital filter design of interpolation filters based on weighted Chebyshev minimization. The accuracy of the resulting filters are compared with some commonly used filters defined by piecewise cubic polynomials. A significant finding of this paper is that although piecewise cubic interpolation has some computational advantages and may yield visually satisfactory results for some data, other data result in artifacts such as blurring. Furthermore, piecewise cubic filters are inferior for operations such as registration. Better results are obtained by the filters derived in this papers at only small increases in computation.<<ETX>>","AuthorNamesDeduped":"Ingrid Carlbom","AuthorNames":"I. Carlbom","AuthorAffiliation":"Digital Equipment Corp., Cambridge, MA, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"43","XPloreCitationCount022019":"20","PubsCited":"26","Award":""}},{"name":"Thomas Ertl","value":786,"numPapers":257,"cluster":"4","visible":1,"index":80,"weight":92,"x":483.6840292679018,"y":353.5265158552818,"px":487.0223708729265,"py":354.46354764653546,"node":{"Conference":"Vis","Year":"1996","Title":"Hierarchical and parallelizable direct volume rendering for irregular and multiple grids","DOI":"10.1109/VISUAL.1996.567606","Link":"http://dx.doi.org/10.1109/VISUAL.1996.567606","FirstPage":"57","LastPage":"63","PaperType":"C","Abstract":"A general volume rendering technique is described that efficiently produces images of excellent quality from data defined over irregular grids having a wide variety of formats. Rendering is done in software, eliminating the need for special graphics hardware, as well as any artifacts associated with graphics hardware. Images of volumes with about 1,000,000 cells can be produced in one to several minutes on a workstation with a 150-MHz processor. A significant advantage of this method for applications such as computational fluid dynamics is that it can process multiple intersecting grids. Such grids present problems for most current volume rendering techniques. Also, the wide range of cell sizes does not present difficulties, as it does for many techniques. A spatial hierarchical organization makes it possible to access data from a restricted region efficiently. The tree has greater depth in regions of greater detail, determined by the number of cells in the region. It also makes it possible to render useful \"preview\" images very quickly by displaying each region associated with a tree node as one cell. Previews show enough detail to navigate effectively in very large data sets. The algorithmic techniques include use of a k-d tree, with prefix-order partitioning of triangles, to reduce the number of primitives that must be processed for one rendering, coarse-grain parallelism for a shared-memory MIMD architecture, a new perspective transformation that achieves greater numerical accuracy, and a scanline algorithm with depth sorting and a new clipping technique.","AuthorNamesDeduped":"Jane Wilhelms;Allen Van Gelder;Paul Tarantino;Jonathan Gibbs","AuthorNames":"J. Wilhelms;A. Van Gelder;P. Tarantino;J. Gibbs","AuthorAffiliation":"California Univ., Santa Cruz, CA, USA","InternalReferences":"10.1109/VISUAL.1992.235204;10.1109/VISUAL.1993.398853;10.1109/VISUAL.1995.480796;10.1109/VISUAL.1992.235228","AuthorKeywords":"Computer Graphics, Scientific Visualization, Scanline, Direct Volume Rendering, Curvilinear Grid, Irregular Grid, k-D Tree","AminerCitationCount022019":"67","XPloreCitationCount022019":"26","PubsCited":"31","Award":""}},{"name":"Jane Wilhelms","value":32,"numPapers":6,"cluster":"4","visible":1,"index":81,"weight":1,"x":149.94923342956636,"y":442.2921372926204,"px":157.87136516924863,"py":442.51873132586877,"node":{"Conference":"Vis","Year":"1992","Title":"A scientific visualization renderer","DOI":"10.1109/VISUAL.1992.235204","Link":"http://dx.doi.org/10.1109/VISUAL.1992.235204","FirstPage":"227","LastPage":"234","PaperType":"C","Abstract":"While scientific visualization systems share many requirements with other graphical applications, they also have special requirements that make solutions based on standard rendering hardware or software not entirely satisfactory. Those requirements are illustrated by describing the renderer used in a production scientific visualization system, Data Explorer. The requirements for a visualization renderer are discussed. Implementation techniques used to meet the requirements of parallelism, volume rendering of irregular data, clipping, and integration of rendering modalities are described. The renderer described is a software renderer, but it is hoped that the requirements and implementation presented might influence the design of future generations of rendering hardware.<<ETX>>","AuthorNamesDeduped":"Bruce Lucas","AuthorNames":"B. Lucas","AuthorAffiliation":"IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA","InternalReferences":"10.1109/VISUAL.1992.235219;10.1109/VISUAL.1991.175818","AuthorKeywords":"","AminerCitationCount022019":"50","XPloreCitationCount022019":"9","PubsCited":"10","Award":""}},{"name":"Allen Van Gelder","value":32,"numPapers":6,"cluster":"4","visible":1,"index":82,"weight":1,"x":788.8130700366542,"y":699.6959040269686,"px":788.915429439922,"py":693.7857221658079,"node":{"Conference":"Vis","Year":"1992","Title":"A scientific visualization renderer","DOI":"10.1109/VISUAL.1992.235204","Link":"http://dx.doi.org/10.1109/VISUAL.1992.235204","FirstPage":"227","LastPage":"234","PaperType":"C","Abstract":"While scientific visualization systems share many requirements with other graphical applications, they also have special requirements that make solutions based on standard rendering hardware or software not entirely satisfactory. Those requirements are illustrated by describing the renderer used in a production scientific visualization system, Data Explorer. The requirements for a visualization renderer are discussed. Implementation techniques used to meet the requirements of parallelism, volume rendering of irregular data, clipping, and integration of rendering modalities are described. The renderer described is a software renderer, but it is hoped that the requirements and implementation presented might influence the design of future generations of rendering hardware.<<ETX>>","AuthorNamesDeduped":"Bruce Lucas","AuthorNames":"B. Lucas","AuthorAffiliation":"IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA","InternalReferences":"10.1109/VISUAL.1992.235219;10.1109/VISUAL.1991.175818","AuthorKeywords":"","AminerCitationCount022019":"50","XPloreCitationCount022019":"9","PubsCited":"10","Award":""}},{"name":"Mark A. Duchaineau","value":148,"numPapers":39,"cluster":"6","visible":1,"index":83,"weight":8,"x":209.70083636056398,"y":510.55423650523636,"px":217.06699343427132,"py":508.163838803307,"node":{"Conference":"Vis","Year":"1996","Title":"Temporal continuity of levels of detail in Delaunay triangulated terrain","DOI":"10.1109/VISUAL.1996.567600","Link":"http://dx.doi.org/10.1109/VISUAL.1996.567600","FirstPage":"37","LastPage":"42","PaperType":"C","Abstract":"The representation of a scene at different levels of detail is necessary to achieve real-time rendering. In aerial views, only the part of the scene that is close to the viewing point needs to be displayed with a high level of detail, while more distant parts can be displayed with a low level of detail. However, when a sequence of images is generated and displayed in real-time, the transition between different levels of detail causes noticeable temporal aliasing. In this paper, we propose a method, based on object blending, that visually softens the transition between two levels of Delaunay triangulation. We present an algorithm that establishes, in an off-line process, a correspondence between two given polygonal objects. The correspondence enables on-line blending between two representations of an object, so that one representation (level of detail) progressively evolves into the other.","AuthorNamesDeduped":"Daniel Cohen-Or;Yishay Levanoni","AuthorNames":"D. Cohen-Or;Y. Levanoni","AuthorAffiliation":"Sch. of Math. Sci., Tel Aviv Univ., Israel","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"","XPloreCitationCount022019":"23","PubsCited":"18","Award":""}},{"name":"M. Eduard Gröller","value":1378,"numPapers":326,"cluster":"3","visible":1,"index":84,"weight":164,"x":476.1687875023498,"y":482.8702893214116,"px":477.8941570120724,"py":481.58416287651215,"node":{"Conference":"Vis","Year":"1990","Title":"Moving iconic objects in scientific visualization","DOI":"10.1109/VISUAL.1990.146373","Link":"http://dx.doi.org/10.1109/VISUAL.1990.146373","FirstPage":"124","LastPage":"130, 468","PaperType":"C","Abstract":"The idea of independently moving, interacting graphical objects is introduced as a method for the visualization of continuous fields. Bird-oid objects or boids are discussed. These boids derive from: (1) icons which are geometric objects whose shape and appearance are related to the field variables, (2) three-dimensional cursors by which a user interactively picks a point in space, (3) particle traces, which are numerically integrated trajectories in space, (4) moving frames of vectors along space curves, and (5) actors, which are programming objects that can create and destroy instances of themselves, act according to internal logic, and communicate with each other and with a user. A software prototype in the C++ language has been developed which demonstrates some of the capabilities of these objects for the visualization of scalar, vector, and tensor fields defined over finite elements or finite volumes.<<ETX>>","AuthorNamesDeduped":"G. David Kerlick","AuthorNames":"D.G. Kerlick","AuthorAffiliation":"Tektronix Labs., Beaverton, OR, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"47","XPloreCitationCount022019":"12","PubsCited":"22","Award":""}},{"name":"Eric A. Wernert","value":21,"numPapers":4,"cluster":"15","visible":1,"index":85,"weight":1,"x":57.998741447354334,"y":-68.22795507764188,"px":60.70078663779253,"py":-62.397603731092985,"node":{"Conference":"Vis","Year":"1995","Title":"Space walking","DOI":"10.1109/VISUAL.1995.480804","Link":"http://dx.doi.org/10.1109/VISUAL.1995.480804","FirstPage":"126","LastPage":"133, 445","PaperType":"C","Abstract":"Proposes an interactive method for exploring topological spaces based on the natural local geometry of the space. Examples of spaces appropriate for this visualization approach occur in abundance in mathematical visualization, surface and volume visualization problems, and scientific applications such as general relativity. Our approach is based on using a controller to choose a direction in which to \"walk\" a manifold along a local geodesic path. The method automatically generates orientation changes that produce a maximal viewable region with each step of the walk. The proposed interaction framework has many natural properties to help the user develop a useful cognitive map of a space and is well-suited to haptic interfaces that may be incorporated into desktop virtual reality systems.","AuthorNamesDeduped":"Andrew J. Hanson;Hui Ma","AuthorNames":"A.J. Hanson;Hui Ma","AuthorAffiliation":"Dept. of Comput. Sci., Indiana Univ., Bloomington, IN, USA;Dept. of Comput. Sci., Indiana Univ., Bloomington, IN, USA","InternalReferences":"10.1109/VISUAL.1994.346324;10.1109/VISUAL.1992.235222","AuthorKeywords":"","AminerCitationCount022019":"50","XPloreCitationCount022019":"5","PubsCited":"19","Award":""}},{"name":"Yi-Jen Chiang","value":79,"numPapers":17,"cluster":"4","visible":1,"index":86,"weight":10,"x":298.382113033325,"y":463.2740453347704,"px":303.3063323796518,"py":462.4073990976454,"node":{"Conference":"Vis","Year":"1995","Title":"Sweeping simplices: a fast iso-surface extraction algorithm for unstructured grids","DOI":"10.1109/VISUAL.1995.480806","Link":"http://dx.doi.org/10.1109/VISUAL.1995.480806","FirstPage":"143","LastPage":"150, 447","PaperType":"C","Abstract":"Presents an algorithm that accelerates the extraction of iso-surfaces from unstructured grids by avoiding the traversal of the entire set of cells in the volume. The algorithm consists of a sweep algorithm and a data decomposition scheme. The sweep algorithm incrementally locates intersected elements, and the data decomposition scheme restricts the algorithm's worst-case performance. For data sets consisting of hundreds of thousands of elements, our algorithm can reduce the cell traversal time by more than 90% over the naive iso-surface extraction algorithm, thus facilitating interactive probing of scalar fields for large-scale problems on unstructured three-dimensional grids.","AuthorNamesDeduped":"Han-Wei Shen;Christopher R. Johnson 0001","AuthorNames":"Han-Wei Shen;C.R. Johnson","AuthorAffiliation":"Dept. of Comput. Sci., Utah Univ., Salt Lake City, UT, USA;Dept. of Comput. Sci., Utah Univ., Salt Lake City, UT, USA","InternalReferences":"10.1109/VISUAL.1991.175780","AuthorKeywords":"","AminerCitationCount022019":"129","XPloreCitationCount022019":"30","PubsCited":"6","Award":""}},{"name":"Mihael Ankerst","value":183,"numPapers":9,"cluster":"2","visible":1,"index":87,"weight":4,"x":434.57659753118054,"y":247.0962356210695,"px":439.193932153008,"py":249.95087570755763,"node":{"Conference":"Vis","Year":"1990","Title":"Parallel coordinates: a tool for visualizing multi-dimensional geometry","DOI":"10.1109/VISUAL.1990.146402","Link":"http://dx.doi.org/10.1109/VISUAL.1990.146402","FirstPage":"361","LastPage":"378","PaperType":"C","Abstract":"A methodology for visualizing analytic and synthetic geometry in R/sup N/ is presented. It is based on a system of parallel coordinates which induces a nonprojective mapping between N-dimensional and two-dimensional sets. Hypersurfaces are represented by their planar images which have some geometrical properties analogous to the properties of the hypersurface that they represent. A point from to line duality when N=2 generalizes to lines and hyperplanes enabling the representation of polyhedra in R/sup N/. The representation of a class of convex and non-convex hypersurfaces is discussed, together with an algorithm for constructing and displaying any interior point. The display shows some local properties of the hypersurface and provides information on the point's proximity to the boundary. Applications are discussed.<<ETX>>","AuthorNamesDeduped":"Alfred Inselberg;Bernard Dimsdale","AuthorNames":"A. Inselberg;B. Dimsdale","AuthorAffiliation":"IBM Sci. Center, Los Angeles, CA, USA;IBM Sci. Center, Los Angeles, CA, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"920","XPloreCitationCount022019":"308","PubsCited":"47","Award":""}},{"name":"Hans-Peter Kriegel","value":66,"numPapers":10,"cluster":"2","visible":1,"index":88,"weight":3,"x":458.4343022352444,"y":185.93900768558717,"px":460.80614575579983,"py":191.33748560209003,"node":{"Conference":"Vis","Year":"1990","Title":"Shape coding of multidimensional data on a microcomputer display","DOI":"10.1109/VISUAL.1990.146387","Link":"http://dx.doi.org/10.1109/VISUAL.1990.146387","FirstPage":"238","LastPage":"246, 478","PaperType":"C","Abstract":"The author presents a simple and flexible method of sharp coding for higher dimensional data sets that allows the database operator or the scientist quick access to promising patterns within and among records or samples. The example used is a 13-parameter set of solar wind, magnetosphere, and ground observation data collected hourly for 21 days in 1976. The software system is a prototype developed to demonstrate the glyph approach to depicting higher-dimensional data sets. The experiment was to depict all parameters simultaneously, to see if any global or local patterns emerged. This experiment proves that much more complex data can be presented for visual pattern extraction than standard methods allow.<<ETX>>","AuthorNamesDeduped":"Jeff Beddow","AuthorNames":"J. Beddow","AuthorAffiliation":"Microsimulations Res., Minneapolis, MN, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"","XPloreCitationCount022019":"32","PubsCited":"5","Award":""}},{"name":"James J. Thomas","value":351,"numPapers":27,"cluster":"2","visible":1,"index":89,"weight":25,"x":616.7081702076557,"y":214.59421782449698,"px":616.3674929423688,"py":219.87553452714835,"node":{"Conference":"Vis","Year":"1993","Title":"InfoCrystal: A visual tool for information retrieval","DOI":"10.1109/VISUAL.1993.398863","Link":"http://dx.doi.org/10.1109/VISUAL.1993.398863","FirstPage":"150","LastPage":"157","PaperType":"C","Abstract":"This paper introduces a novel representation, called the InfoCrystal, that can be used as a visualization tool as well as a visual query language to help users search for information. The InfoCrystal visualizes all the possible relationships among N concepts. Users can assign relevance weights to the concepts and use thresholding to select relationships of interest. The InfoCrystal allows users to specify Boolean as well as vector-space queries graphically. Arbitrarily complex queries can be created by using the InfoCrystals as building blocks and organizing them in a hierarchical structure. The InfoCrystal enables users to explore and filter information in a flexible, dynamic and interactive way.<<ETX>>","AuthorNamesDeduped":"Anselm Spoerri","AuthorNames":"A. Spoerri","AuthorAffiliation":"Center for Educational Comput. Initiatives, MIT, Cambridge, MA, USA","InternalReferences":"","AuthorKeywords":"information visualization, visual query language, information retrieval, graphical user interface, human factors","AminerCitationCount022019":"198","XPloreCitationCount022019":"16","PubsCited":"12","Award":""}},{"name":"Elizabeth G. Hetzler","value":222,"numPapers":20,"cluster":"2","visible":1,"index":90,"weight":4,"x":763.6095452623852,"y":244.1897823430648,"px":759.9016453885074,"py":247.64301307207472,"node":{"Conference":"InfoVis","Year":"1997","Title":"Domesticating Bead: adapting an information visualization system to a financial institution","DOI":"10.1109/INFVIS.1997.636789","Link":"http://dx.doi.org/10.1109/INFVIS.1997.636789","FirstPage":"73","LastPage":"80","PaperType":"C","Abstract":"The Bead visualization system employs a fast algorithm for laying out high-dimensional data in a low-dimensional space, and a number of features added to 3D visualizations to improve imageability. We describe recent work on both aspects of the system, in particular a generalization of the data types laid out and the implementation of imageability features in a 2D visualization tool. The variety of data analyzed in a financial institution such as UBS, and the ubiquity of spreadsheets as a medium for analysis, led us to extend our layout tools to handle data in a generic spreadsheet format. We describe the metrics of similarity used for this data type, and give examples of layouts of sets of records of financial trades. Conservatism and scepticism with regard to 3D visualization, along with the lack of functionality of widely available 3D web browsers, led to the development of a 2D visualization tool with refinements of a number of our imageability features.","AuthorNamesDeduped":"Dominique Brodbeck;Matthew Chalmers;Aran Lunzer;Pamela Cotture","AuthorNames":"D. Brodbeck;M. Chalmers;A. Lunzer;P. Cotture","AuthorAffiliation":"Ubilab, UBS, Zurich, Switzerland","InternalReferences":"10.1109/VISUAL.1990.146402;10.1109/INFVIS.1995.528686;10.1109/VISUAL.1996.568118;10.1109/INFVIS.1995.528688;10.1109/VISUAL.1994.346302;10.1109/VISUAL.1991.175794;10.1109/VISUAL.1996.567787","AuthorKeywords":"","AminerCitationCount022019":"53","XPloreCitationCount022019":"16","PubsCited":"23","Award":""}},{"name":"James A. Wise","value":192,"numPapers":1,"cluster":"2","visible":1,"index":91,"weight":6,"x":651.6573163748089,"y":196.19737024864284,"px":650.4884797939277,"py":202.02632493391593,"node":{"Conference":"Vis","Year":"1993","Title":"InfoCrystal: A visual tool for information retrieval","DOI":"10.1109/VISUAL.1993.398863","Link":"http://dx.doi.org/10.1109/VISUAL.1993.398863","FirstPage":"150","LastPage":"157","PaperType":"C","Abstract":"This paper introduces a novel representation, called the InfoCrystal, that can be used as a visualization tool as well as a visual query language to help users search for information. The InfoCrystal visualizes all the possible relationships among N concepts. Users can assign relevance weights to the concepts and use thresholding to select relationships of interest. The InfoCrystal allows users to specify Boolean as well as vector-space queries graphically. Arbitrarily complex queries can be created by using the InfoCrystals as building blocks and organizing them in a hierarchical structure. The InfoCrystal enables users to explore and filter information in a flexible, dynamic and interactive way.<<ETX>>","AuthorNamesDeduped":"Anselm Spoerri","AuthorNames":"A. Spoerri","AuthorAffiliation":"Center for Educational Comput. Initiatives, MIT, Cambridge, MA, USA","InternalReferences":"","AuthorKeywords":"information visualization, visual query language, information retrieval, graphical user interface, human factors","AminerCitationCount022019":"198","XPloreCitationCount022019":"16","PubsCited":"12","Award":""}},{"name":"Kelly Pennock","value":192,"numPapers":1,"cluster":"2","visible":1,"index":92,"weight":6,"x":660.1172508400384,"y":215.47276798604526,"px":658.3093473485094,"py":219.70576030994496,"node":{"Conference":"Vis","Year":"1993","Title":"InfoCrystal: A visual tool for information retrieval","DOI":"10.1109/VISUAL.1993.398863","Link":"http://dx.doi.org/10.1109/VISUAL.1993.398863","FirstPage":"150","LastPage":"157","PaperType":"C","Abstract":"This paper introduces a novel representation, called the InfoCrystal, that can be used as a visualization tool as well as a visual query language to help users search for information. The InfoCrystal visualizes all the possible relationships among N concepts. Users can assign relevance weights to the concepts and use thresholding to select relationships of interest. The InfoCrystal allows users to specify Boolean as well as vector-space queries graphically. Arbitrarily complex queries can be created by using the InfoCrystals as building blocks and organizing them in a hierarchical structure. The InfoCrystal enables users to explore and filter information in a flexible, dynamic and interactive way.<<ETX>>","AuthorNamesDeduped":"Anselm Spoerri","AuthorNames":"A. Spoerri","AuthorAffiliation":"Center for Educational Comput. Initiatives, MIT, Cambridge, MA, USA","InternalReferences":"","AuthorKeywords":"information visualization, visual query language, information retrieval, graphical user interface, human factors","AminerCitationCount022019":"198","XPloreCitationCount022019":"16","PubsCited":"12","Award":""}},{"name":"D. Lantrip","value":192,"numPapers":1,"cluster":"2","visible":1,"index":93,"weight":6,"x":672.5524170052211,"y":226.019315765397,"px":670.9995664776975,"py":229.93312183072808,"node":{"Conference":"Vis","Year":"1993","Title":"InfoCrystal: A visual tool for information retrieval","DOI":"10.1109/VISUAL.1993.398863","Link":"http://dx.doi.org/10.1109/VISUAL.1993.398863","FirstPage":"150","LastPage":"157","PaperType":"C","Abstract":"This paper introduces a novel representation, called the InfoCrystal, that can be used as a visualization tool as well as a visual query language to help users search for information. The InfoCrystal visualizes all the possible relationships among N concepts. Users can assign relevance weights to the concepts and use thresholding to select relationships of interest. The InfoCrystal allows users to specify Boolean as well as vector-space queries graphically. Arbitrarily complex queries can be created by using the InfoCrystals as building blocks and organizing them in a hierarchical structure. The InfoCrystal enables users to explore and filter information in a flexible, dynamic and interactive way.<<ETX>>","AuthorNamesDeduped":"Anselm Spoerri","AuthorNames":"A. Spoerri","AuthorAffiliation":"Center for Educational Comput. Initiatives, MIT, Cambridge, MA, USA","InternalReferences":"","AuthorKeywords":"information visualization, visual query language, information retrieval, graphical user interface, human factors","AminerCitationCount022019":"198","XPloreCitationCount022019":"16","PubsCited":"12","Award":""}},{"name":"M. Pottier","value":192,"numPapers":1,"cluster":"2","visible":1,"index":94,"weight":6,"x":685.4172186089004,"y":217.3529999646846,"px":682.6138936274527,"py":221.86408136535667,"node":{"Conference":"Vis","Year":"1993","Title":"InfoCrystal: A visual tool for information retrieval","DOI":"10.1109/VISUAL.1993.398863","Link":"http://dx.doi.org/10.1109/VISUAL.1993.398863","FirstPage":"150","LastPage":"157","PaperType":"C","Abstract":"This paper introduces a novel representation, called the InfoCrystal, that can be used as a visualization tool as well as a visual query language to help users search for information. The InfoCrystal visualizes all the possible relationships among N concepts. Users can assign relevance weights to the concepts and use thresholding to select relationships of interest. The InfoCrystal allows users to specify Boolean as well as vector-space queries graphically. Arbitrarily complex queries can be created by using the InfoCrystals as building blocks and organizing them in a hierarchical structure. The InfoCrystal enables users to explore and filter information in a flexible, dynamic and interactive way.<<ETX>>","AuthorNamesDeduped":"Anselm Spoerri","AuthorNames":"A. Spoerri","AuthorAffiliation":"Center for Educational Comput. Initiatives, MIT, Cambridge, MA, USA","InternalReferences":"","AuthorKeywords":"information visualization, visual query language, information retrieval, graphical user interface, human factors","AminerCitationCount022019":"198","XPloreCitationCount022019":"16","PubsCited":"12","Award":""}},{"name":"Anne Schur","value":192,"numPapers":1,"cluster":"2","visible":1,"index":95,"weight":6,"x":663.4528073124636,"y":308.90787781381385,"px":657.8684790191143,"py":313.977829713238,"node":{"Conference":"Vis","Year":"1993","Title":"InfoCrystal: A visual tool for information retrieval","DOI":"10.1109/VISUAL.1993.398863","Link":"http://dx.doi.org/10.1109/VISUAL.1993.398863","FirstPage":"150","LastPage":"157","PaperType":"C","Abstract":"This paper introduces a novel representation, called the InfoCrystal, that can be used as a visualization tool as well as a visual query language to help users search for information. The InfoCrystal visualizes all the possible relationships among N concepts. Users can assign relevance weights to the concepts and use thresholding to select relationships of interest. The InfoCrystal allows users to specify Boolean as well as vector-space queries graphically. Arbitrarily complex queries can be created by using the InfoCrystals as building blocks and organizing them in a hierarchical structure. The InfoCrystal enables users to explore and filter information in a flexible, dynamic and interactive way.<<ETX>>","AuthorNamesDeduped":"Anselm Spoerri","AuthorNames":"A. Spoerri","AuthorAffiliation":"Center for Educational Comput. Initiatives, MIT, Cambridge, MA, USA","InternalReferences":"","AuthorKeywords":"information visualization, visual query language, information retrieval, graphical user interface, human factors","AminerCitationCount022019":"198","XPloreCitationCount022019":"16","PubsCited":"12","Award":""}},{"name":"V. Crow","value":192,"numPapers":1,"cluster":"2","visible":1,"index":96,"weight":6,"x":668.6569238746388,"y":204.93506041596504,"px":666.1889986449414,"py":210.3964916490548,"node":{"Conference":"Vis","Year":"1993","Title":"InfoCrystal: A visual tool for information retrieval","DOI":"10.1109/VISUAL.1993.398863","Link":"http://dx.doi.org/10.1109/VISUAL.1993.398863","FirstPage":"150","LastPage":"157","PaperType":"C","Abstract":"This paper introduces a novel representation, called the InfoCrystal, that can be used as a visualization tool as well as a visual query language to help users search for information. The InfoCrystal visualizes all the possible relationships among N concepts. Users can assign relevance weights to the concepts and use thresholding to select relationships of interest. The InfoCrystal allows users to specify Boolean as well as vector-space queries graphically. Arbitrarily complex queries can be created by using the InfoCrystals as building blocks and organizing them in a hierarchical structure. The InfoCrystal enables users to explore and filter information in a flexible, dynamic and interactive way.<<ETX>>","AuthorNamesDeduped":"Anselm Spoerri","AuthorNames":"A. Spoerri","AuthorAffiliation":"Center for Educational Comput. Initiatives, MIT, Cambridge, MA, USA","InternalReferences":"","AuthorKeywords":"information visualization, visual query language, information retrieval, graphical user interface, human factors","AminerCitationCount022019":"198","XPloreCitationCount022019":"16","PubsCited":"12","Award":""}},{"name":"Renato Pajarola","value":118,"numPapers":36,"cluster":"6","visible":1,"index":97,"weight":4,"x":124.16575616673163,"y":396.93258603442337,"px":133.1786166312636,"py":397.67466544857945,"node":{"Conference":"Vis","Year":"1997","Title":"ROAMing terrain: Real-time Optimally Adapting Meshes","DOI":"10.1109/VISUAL.1997.663860","Link":"http://dx.doi.org/10.1109/VISUAL.1997.663860","FirstPage":"81","LastPage":"88","PaperType":"C","Abstract":"Terrain visualization is a difficult problem for applications requiring accurate images of large datasets at high frame rates, such as flight simulation and ground-based aircraft testing using synthetic sensor simulation. On current graphics hardware, the problem is to maintain dynamic, view-dependent triangle meshes and texture maps that produce good images at the required frame rate. We present an algorithm for constructing triangle meshes that optimizes flexible view-dependent error metrics, produces guaranteed error bounds, achieves specified triangle counts directly and uses frame-to-frame coherence to operate at high frame rates for thousands of triangles per frame. Our method, dubbed Real-time Optimally Adapting Meshes (ROAM), uses two priority queues to drive split and merge operations that maintain continuous triangulations built from pre-processed bintree triangles. We introduce two additional performance optimizations: incremental triangle stripping and priority-computation deferral lists. ROAM's execution time is proportional to the number of triangle changes per frame, which is typically a few percent of the output mesh size; hence ROAM's performance is insensitive to the resolution and extent of the input terrain. Dynamic terrain and simple vertex morphing are supported.","AuthorNamesDeduped":"Mark A. Duchaineau;Murray Wolinsky;David E. Sigeti;Mark C. Miller;Charles Aldrich;Mark B. Mineev-Weinstein","AuthorNames":"M. Duchaineau;M. Wolinsky;D.E. Sigeti;M.C. Miller;C. Aldrich;M.B. Mineev-Weinstein","AuthorAffiliation":"Los Alamos Nat. Lab., NM, USA","InternalReferences":"10.1109/VISUAL.1996.567600;10.1109/VISUAL.1996.568126;10.1109/VISUAL.1996.568125;10.1109/VISUAL.1995.480813;10.1109/VISUAL.1995.480805","AuthorKeywords":"triangle bintree, view-dependent mesh, frame-to-frame coherence, greedy algorithms","AminerCitationCount022019":"1260","XPloreCitationCount022019":"170","PubsCited":"19","Award":""}},{"name":"Peter Lindstrom","value":166,"numPapers":98,"cluster":"6","visible":1,"index":98,"weight":18,"x":227.3663062737887,"y":388.83719248984374,"px":233.8716090345532,"py":389.5183110535426,"node":{"Conference":"Vis","Year":"1995","Title":"Virtual GIS: a real-time 3D geographic information system","DOI":"10.1109/VISUAL.1995.480800","Link":"http://dx.doi.org/10.1109/VISUAL.1995.480800","FirstPage":"94","LastPage":"100, 443","PaperType":"C","Abstract":"Advances in computer graphics hardware and algorithms, visualization, and interactive techniques for analysis offer the components for a highly integrated, efficient real-time 3D Geographic Information System. We have developed \"Virtual GIS\", a system with truly immersive capability for navigating and understanding complex and dynamic terrain-based databases. The system provides the means for visualizing terrain models consisting of elevation and imagery data, along with GIS raster layers, protruding features, buildings, vehicles, and other objects. We have implemented window-based and virtual reality versions and in both cases provide a direct manipulation, visual interface for accessing the GIS data. Unique terrain data structures and algorithms allow rendering of large, high resolution datasets at interactive rates.","AuthorNamesDeduped":"David Koller;Peter Lindstrom;William Ribarsky;Larry F. Hodges;Nickolas Faust;Gregory A. Turner","AuthorNames":"D. Koller;P. Lindstrom;W. Ribarsky;L.F. Hodges;N. Faust;G. Turner","AuthorAffiliation":"Coll. of Comput., Georgia Inst. of Technol., Atlanta, GA, USA;Coll. of Comput., Georgia Inst. of Technol., Atlanta, GA, USA;Coll. of Comput., Georgia Inst. of Technol., Atlanta, GA, USA;Coll. of Comput., Georgia Inst. of Technol., Atlanta, GA, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"269","XPloreCitationCount022019":"31","PubsCited":"19","Award":""}},{"name":"Valerio Pascucci","value":735,"numPapers":192,"cluster":"6","visible":1,"index":99,"weight":77,"x":286.89386960860014,"y":414.52881343798725,"px":291.6893177830344,"py":414.5878608184591,"node":{"Conference":"Vis","Year":"1996","Title":"Volume Thinning for Automatic Isosurface Propagation","DOI":"10.1109/VISUAL.1996.568123","Link":"http://doi.ieeecomputersociety.org/10.1109/VISUAL.1996.568123","FirstPage":"303","LastPage":"310","PaperType":"C","Abstract":"An isosurface can be efficiently generated by visiting adjacent intersected cells in order, as if the isosurface were propagating itself. We previously proposed an extrema graph method (T. Itoh and K. Koyamada, 1995), which generates a graph connecting extremum points. The isosurface propagation starts from some of the intersected cells that are found both by visiting the cells through which arcs of the graph pass and by visiting the cells on the boundary of a volume. We propose an efficient method of searching for cells intersected by an isosurface. This method generates a volumetric skeleton. consisting of cells, like an extrema graph, by applying a thinning algorithm used in the image recognition area. Since it preserves the topological features of the volume and the connectivity of the extremum points, it necessarily intersects every isosurface. The method is more efficient than the extrema graph method, since it does not require that cells on the boundary be visited.","AuthorNamesDeduped":"Takayuki Itoh;Yasushi Yamaguchi;Koji Koyamada","AuthorNames":"T. Itoh;Y. Yamaguchi;K. Koyamada","AuthorAffiliation":"Res. Lab., IBM Japan Ltd., Tokyo, Japan","InternalReferences":"10.1109/VISUAL.1991.175780","AuthorKeywords":"","AminerCitationCount022019":"65","XPloreCitationCount022019":"15","PubsCited":"0","Award":""}},{"name":"Chandrajit L. Bajaj","value":198,"numPapers":24,"cluster":"6","visible":1,"index":100,"weight":3,"x":138.38136507250525,"y":363.0457072311072,"px":146.2725684050658,"py":367.13518470889557,"node":{"Conference":"Vis","Year":"1996","Title":"Volume Thinning for Automatic Isosurface Propagation","DOI":"10.1109/VISUAL.1996.568123","Link":"http://doi.ieeecomputersociety.org/10.1109/VISUAL.1996.568123","FirstPage":"303","LastPage":"310","PaperType":"C","Abstract":"An isosurface can be efficiently generated by visiting adjacent intersected cells in order, as if the isosurface were propagating itself. We previously proposed an extrema graph method (T. Itoh and K. Koyamada, 1995), which generates a graph connecting extremum points. The isosurface propagation starts from some of the intersected cells that are found both by visiting the cells through which arcs of the graph pass and by visiting the cells on the boundary of a volume. We propose an efficient method of searching for cells intersected by an isosurface. This method generates a volumetric skeleton. consisting of cells, like an extrema graph, by applying a thinning algorithm used in the image recognition area. Since it preserves the topological features of the volume and the connectivity of the extremum points, it necessarily intersects every isosurface. The method is more efficient than the extrema graph method, since it does not require that cells on the boundary be visited.","AuthorNamesDeduped":"Takayuki Itoh;Yasushi Yamaguchi;Koji Koyamada","AuthorNames":"T. Itoh;Y. Yamaguchi;K. Koyamada","AuthorAffiliation":"Res. Lab., IBM Japan Ltd., Tokyo, Japan","InternalReferences":"10.1109/VISUAL.1991.175780","AuthorKeywords":"","AminerCitationCount022019":"65","XPloreCitationCount022019":"15","PubsCited":"0","Award":""}},{"name":"Daniel Schikore","value":132,"numPapers":14,"cluster":"6","visible":1,"index":101,"weight":3,"x":136.75158188944425,"y":426.258845095005,"px":145.32602295639057,"py":425.88939208644763,"node":{"Conference":"Vis","Year":"1996","Title":"Volume Thinning for Automatic Isosurface Propagation","DOI":"10.1109/VISUAL.1996.568123","Link":"http://doi.ieeecomputersociety.org/10.1109/VISUAL.1996.568123","FirstPage":"303","LastPage":"310","PaperType":"C","Abstract":"An isosurface can be efficiently generated by visiting adjacent intersected cells in order, as if the isosurface were propagating itself. We previously proposed an extrema graph method (T. Itoh and K. Koyamada, 1995), which generates a graph connecting extremum points. The isosurface propagation starts from some of the intersected cells that are found both by visiting the cells through which arcs of the graph pass and by visiting the cells on the boundary of a volume. We propose an efficient method of searching for cells intersected by an isosurface. This method generates a volumetric skeleton. consisting of cells, like an extrema graph, by applying a thinning algorithm used in the image recognition area. Since it preserves the topological features of the volume and the connectivity of the extremum points, it necessarily intersects every isosurface. The method is more efficient than the extrema graph method, since it does not require that cells on the boundary be visited.","AuthorNamesDeduped":"Takayuki Itoh;Yasushi Yamaguchi;Koji Koyamada","AuthorNames":"T. Itoh;Y. Yamaguchi;K. Koyamada","AuthorAffiliation":"Res. Lab., IBM Japan Ltd., Tokyo, Japan","InternalReferences":"10.1109/VISUAL.1991.175780","AuthorKeywords":"","AminerCitationCount022019":"65","XPloreCitationCount022019":"15","PubsCited":"0","Award":""}},{"name":"Ronald Peikert","value":311,"numPapers":62,"cluster":"6","visible":1,"index":102,"weight":24,"x":320.91972033327033,"y":551.2521035332575,"px":325.1639839941345,"py":547.887034704367,"node":{"Conference":"Vis","Year":"1991","Title":"A tool for visualizing the topology of three-dimensional vector fields","DOI":"10.1109/VISUAL.1991.175773","Link":"http://dx.doi.org/10.1109/VISUAL.1991.175773","FirstPage":"33","LastPage":"40, 408","PaperType":"C","Abstract":"A description is given of a software system, TOPO, that numerically analyzes and graphically displays topological aspects of a three-dimensional vector field, v, to produce a single, relatively simple picture that characterizes v. The topology of v considered consists of its critical points (where v=0), their invariant manifolds, and the integral curves connecting these invariant manifolds. The field in the neighborhood of each critical point is approximated by the Taylor expansion. The coefficients of the first nonzero term of the Taylor expansion around a critical point are the 3*3 matrix Delta v. Critical points are classified by examining Delta v's eigenvalues. The eigenvectors of Delta v span the invariant manifolds of the linearized field around a critical point. Curves integrated from initial points on the eigenvectors a small distance from a critical point connect with other critical points (or the boundary) to complete the topology. One class of critical surfaces that is important in computational fluid dynamics is analyzed.<<ETX>>","AuthorNamesDeduped":"Al Globus;Creon Levit;T. Lasinski","AuthorNames":"A. Globus;C. Levit;T. Lasinski","AuthorAffiliation":"","InternalReferences":"10.1109/VISUAL.1990.146360;10.1109/VISUAL.1990.146359","AuthorKeywords":"","AminerCitationCount022019":"296","XPloreCitationCount022019":"93","PubsCited":"44","Award":""}},{"name":"Martin Roth","value":185,"numPapers":19,"cluster":"6","visible":1,"index":103,"weight":12,"x":249.79926081203362,"y":582.2967725159943,"px":255.4137677226975,"py":578.2974461771438,"node":{"Conference":"Vis","Year":"1991","Title":"A tool for visualizing the topology of three-dimensional vector fields","DOI":"10.1109/VISUAL.1991.175773","Link":"http://dx.doi.org/10.1109/VISUAL.1991.175773","FirstPage":"33","LastPage":"40, 408","PaperType":"C","Abstract":"A description is given of a software system, TOPO, that numerically analyzes and graphically displays topological aspects of a three-dimensional vector field, v, to produce a single, relatively simple picture that characterizes v. The topology of v considered consists of its critical points (where v=0), their invariant manifolds, and the integral curves connecting these invariant manifolds. The field in the neighborhood of each critical point is approximated by the Taylor expansion. The coefficients of the first nonzero term of the Taylor expansion around a critical point are the 3*3 matrix Delta v. Critical points are classified by examining Delta v's eigenvalues. The eigenvectors of Delta v span the invariant manifolds of the linearized field around a critical point. Curves integrated from initial points on the eigenvectors a small distance from a critical point connect with other critical points (or the boundary) to complete the topology. One class of critical surfaces that is important in computational fluid dynamics is analyzed.<<ETX>>","AuthorNamesDeduped":"Al Globus;Creon Levit;T. Lasinski","AuthorNames":"A. Globus;C. Levit;T. Lasinski","AuthorAffiliation":"","InternalReferences":"10.1109/VISUAL.1990.146360;10.1109/VISUAL.1990.146359","AuthorKeywords":"","AminerCitationCount022019":"296","XPloreCitationCount022019":"93","PubsCited":"44","Award":""}},{"name":"David C. Banks","value":148,"numPapers":22,"cluster":"6","visible":1,"index":104,"weight":1,"x":136.90013060134135,"y":866.6277936642823,"px":138.1914158737828,"py":859.0880982768803,"node":{"Conference":"Vis","Year":"1991","Title":"A tool for visualizing the topology of three-dimensional vector fields","DOI":"10.1109/VISUAL.1991.175773","Link":"http://dx.doi.org/10.1109/VISUAL.1991.175773","FirstPage":"33","LastPage":"40, 408","PaperType":"C","Abstract":"A description is given of a software system, TOPO, that numerically analyzes and graphically displays topological aspects of a three-dimensional vector field, v, to produce a single, relatively simple picture that characterizes v. The topology of v considered consists of its critical points (where v=0), their invariant manifolds, and the integral curves connecting these invariant manifolds. The field in the neighborhood of each critical point is approximated by the Taylor expansion. The coefficients of the first nonzero term of the Taylor expansion around a critical point are the 3*3 matrix Delta v. Critical points are classified by examining Delta v's eigenvalues. The eigenvectors of Delta v span the invariant manifolds of the linearized field around a critical point. Curves integrated from initial points on the eigenvectors a small distance from a critical point connect with other critical points (or the boundary) to complete the topology. One class of critical surfaces that is important in computational fluid dynamics is analyzed.<<ETX>>","AuthorNamesDeduped":"Al Globus;Creon Levit;T. Lasinski","AuthorNames":"A. Globus;C. Levit;T. Lasinski","AuthorAffiliation":"","InternalReferences":"10.1109/VISUAL.1990.146360;10.1109/VISUAL.1990.146359","AuthorKeywords":"","AminerCitationCount022019":"296","XPloreCitationCount022019":"93","PubsCited":"44","Award":""}},{"name":"Bart A. Singer","value":50,"numPapers":1,"cluster":"6","visible":1,"index":105,"weight":1,"x":158.40277597642793,"y":880.3325376374685,"px":159.75939393264116,"py":873.3645610802083,"node":{"Conference":"Vis","Year":"1991","Title":"A tool for visualizing the topology of three-dimensional vector fields","DOI":"10.1109/VISUAL.1991.175773","Link":"http://dx.doi.org/10.1109/VISUAL.1991.175773","FirstPage":"33","LastPage":"40, 408","PaperType":"C","Abstract":"A description is given of a software system, TOPO, that numerically analyzes and graphically displays topological aspects of a three-dimensional vector field, v, to produce a single, relatively simple picture that characterizes v. The topology of v considered consists of its critical points (where v=0), their invariant manifolds, and the integral curves connecting these invariant manifolds. The field in the neighborhood of each critical point is approximated by the Taylor expansion. The coefficients of the first nonzero term of the Taylor expansion around a critical point are the 3*3 matrix Delta v. Critical points are classified by examining Delta v's eigenvalues. The eigenvectors of Delta v span the invariant manifolds of the linearized field around a critical point. Curves integrated from initial points on the eigenvectors a small distance from a critical point connect with other critical points (or the boundary) to complete the topology. One class of critical surfaces that is important in computational fluid dynamics is analyzed.<<ETX>>","AuthorNamesDeduped":"Al Globus;Creon Levit;T. Lasinski","AuthorNames":"A. Globus;C. Levit;T. Lasinski","AuthorAffiliation":"","InternalReferences":"10.1109/VISUAL.1990.146360;10.1109/VISUAL.1990.146359","AuthorKeywords":"","AminerCitationCount022019":"296","XPloreCitationCount022019":"93","PubsCited":"44","Award":""}},{"name":"Xin Wang","value":65,"numPapers":6,"cluster":"4","visible":1,"index":106,"weight":2,"x":270.7821439061435,"y":695.0447477480153,"px":273.56068884417795,"py":688.9303976415189,"node":{"Conference":"Vis","Year":"1995","Title":"Iconic techniques for feature visualization","DOI":"10.1109/VISUAL.1995.485141","Link":"http://dx.doi.org/10.1109/VISUAL.1995.485141","FirstPage":"288","LastPage":"295, 464","PaperType":"C","Abstract":"Presents a conceptual framework and a process model for feature extraction and iconic visualization. Feature extraction is viewed as a process of data abstraction, which can proceed in multiple stages, and corresponding data abstraction levels. The features are represented by attribute sets, which play a key role in the visualization process. Icons are symbolic parametric objects, designed as visual representations of features. The attributes are mapped to the parameters (or degrees of freedom) of an icon. We describe some generic techniques to generate attribute sets, such as volume integrals and medial axis transforms. A simple but powerful modeling language was developed to create icons, and to link the attributes to the icon parameters. We present illustrative examples of iconic visualization created with the techniques described, showing the effectiveness of this approach.","AuthorNamesDeduped":"Frank J. Post;Theo van Walsum;Frits H. Post;Deborah Silver","AuthorNames":"F.J. Post;T. van Walsum;F.H. Post;D. Silver","AuthorAffiliation":"Fac. of Tech. Math. & Inf., Delft Univ. of Technol., Netherlands;Fac. of Tech. Math. & Inf., Delft Univ. of Technol., Netherlands;Fac. of Tech. Math. & Inf., Delft Univ. of Technol., Netherlands","InternalReferences":"10.1109/VISUAL.1993.398849;10.1109/VISUAL.1991.175809;10.1109/VISUAL.1992.235174","AuthorKeywords":"scientific visualization, feature extraction, iconic visualization, attribute calculation","AminerCitationCount022019":"168","XPloreCitationCount022019":"49","PubsCited":"25","Award":""}},{"name":"Peter Shirley","value":97,"numPapers":14,"cluster":"4","visible":1,"index":107,"weight":3,"x":292.351487372847,"y":642.2770837625457,"px":295.77841836721416,"py":636.8269817466676,"node":{"Conference":"Vis","Year":"1998","Title":"Interactive ray tracing for isosurface rendering","DOI":"10.1109/VISUAL.1998.745713","Link":"http://dx.doi.org/10.1109/VISUAL.1998.745713","FirstPage":"233","LastPage":"238","PaperType":"C","Abstract":"We show that it is feasible to perform interactive isosurfacing of very large rectilinear datasets with brute-force ray tracing on a conventional (distributed) shared-memory multiprocessor machine. Rather than generate geometry representing the isosurface and render with a z-buffer, for each pixel we trace a ray through a volume and do an analytic isosurface intersection computation. Although this method has a high intrinsic computational cost, its simplicity and scalability make it ideal for large datasets on current high-end systems. Incorporating simple optimizations, such as volume bricking and a shallow hierarchy, enables interactive rendering (i.e. 10 frames per second) of the 1 GByte full resolution Visible Woman dataset on an SGI Reality Monster. The graphics capabilities of the Reality Monster are used only for display of the final color image.","AuthorNamesDeduped":"Steven G. Parker;Peter Shirley;Yarden Livnat;Charles D. Hansen;Peter-Pike J. Sloan","AuthorNames":"S. Parker;P. Shirley;Y. Livnat;C. Hansen;P.-P. Sloan","AuthorAffiliation":"Dept. of Comput. Sci., Utah Univ., Salt Lake City, UT, USA","InternalReferences":"10.1109/VISUAL.1997.663888;10.1109/VISUAL.1994.346331;10.1109/VISUAL.1994.346320;10.1109/VISUAL.1995.485154;10.1109/VISUAL.1998.745300","AuthorKeywords":"","AminerCitationCount022019":"391","XPloreCitationCount022019":"94","PubsCited":"17","Award":"BP"}},{"name":"Harlan Foote","value":127,"numPapers":27,"cluster":"2","visible":1,"index":108,"weight":5,"x":738.5131408270322,"y":167.3048334231299,"px":738.3277039587792,"py":174.07482294010012,"node":{"Conference":"Vis","Year":"1997","Title":"Wavelet-based multiresolutional representation of computational field simulation datasets","DOI":"10.1109/VISUAL.1997.663872","Link":"http://dx.doi.org/10.1109/VISUAL.1997.663872","FirstPage":"151","LastPage":"158","PaperType":"C","Abstract":"The paper addresses multiresolutional representation of datasets arising from a computational field simulation. The approach determines the regions of interest, breaks the volume into variable size blocks to localize the information, and then codes each block using a wavelet transform. The blocks are then ranked by visual information content so that the most informative wavelet coefficients can be embedded in a bit stream for progressive transmission or access. The technique is demonstrated on a widely-used computational field simulation dataset.","AuthorNamesDeduped":"Zhifan Zhu;Raghu Machiraju;Bryan Fry;Robert J. Moorhead II","AuthorNames":"Zhifan Zhu;R. Machiraju;B. Fry;R. Moorhead","AuthorAffiliation":"NSF Eng. Res. Center for Comput. Field Simulation, Mississippi State Univ., MS, USA","InternalReferences":"10.1109/VISUAL.1994.346332;10.1109/VISUAL.1995.480810;10.1109/VISUAL.1996.568138;10.1109/VISUAL.1995.480812","AuthorKeywords":"wavelet transform, structure detection, human visual system, progressive transmission","AminerCitationCount022019":"24","XPloreCitationCount022019":"3","PubsCited":"37","Award":""}},{"name":"Dinesh Manocha","value":43,"numPapers":27,"cluster":"6","visible":1,"index":109,"weight":7,"x":59.30367834153912,"y":598.4138974883042,"px":67.21919474729357,"py":594.6680888676472,"node":{"Conference":"Vis","Year":"1993","Title":"Geometric clipping using Boolean textures","DOI":"10.1109/VISUAL.1993.398878","Link":"http://dx.doi.org/10.1109/VISUAL.1993.398878","FirstPage":"268","LastPage":"274","PaperType":"C","Abstract":"Texture mapping is normally used to convey geometric detail without adding geometric complexity. This paper introduces Boolean textures, a texture mapping technique that uses implicit functions to generate texture maps and texture coordinates. These Boolean textures perform clipping during a renderer's scan conversion step. Any implicit function is a candidate Boolean texture clipper. The paper describes how to use quadrics as clippers. Applications from engineering and medicine illustrate the effectiveness of texture as a clipping tool.<<ETX>>","AuthorNamesDeduped":"W. E. Lorenson","AuthorNames":"W.E. Lorensen","AuthorAffiliation":"General Electric Corp., Schenectady, NY, USA","InternalReferences":"10.1109/VISUAL.1992.235205;10.1109/VISUAL.1992.235204","AuthorKeywords":"","AminerCitationCount022019":"","XPloreCitationCount022019":"5","PubsCited":"20","Award":""}},{"name":"Jihad El-Sana","value":41,"numPapers":19,"cluster":"6","visible":1,"index":110,"weight":7,"x":-108.053066642567,"y":470.5211301072603,"px":-99.61348109971229,"py":467.6288649512791,"node":{"Conference":"Vis","Year":"1997","Title":"Controlled simplification of genus for polygonal models ","DOI":"10.1109/VISUAL.1997.663909","Link":"http://dx.doi.org/10.1109/VISUAL.1997.663909","FirstPage":"403","LastPage":"410","PaperType":"C","Abstract":"Genus-reducing simplifications are important in constructing multiresolution hierarchies for level-of-detail-based rendering, especially for datasets that have several relatively small holes, tunnels, and cavities. We present a genus-reducing simplification approach that is complementary to the existing work on genus-preserving simplifications. We propose a simplification framework in which genus-reducing and genus-preserving simplifications alternate to yield much better multiresolution hierarchies than would have been possible by using either one of them. In our approach we first identify the holes and the concavities by extending the concept of /spl alpha/-hulls to polygonal meshes under the L/sub /spl infin// distance metric and then generate valid triangulations to fill them.","AuthorNamesDeduped":"Jihad El-Sana;Amitabh Varshney","AuthorNames":"J. El-Sana;A. Varshney","AuthorAffiliation":"State Univ. of New York, Stony Brook, NY, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"88","XPloreCitationCount022019":"12","PubsCited":"40","Award":""}},{"name":"Amitabh Varshney","value":174,"numPapers":51,"cluster":"6","visible":1,"index":111,"weight":6,"x":208.4131663769877,"y":427.08291683810387,"px":214.9350001313764,"py":426.9544000145415,"node":{"Conference":"Vis","Year":"1993","Title":"Geometric clipping using Boolean textures","DOI":"10.1109/VISUAL.1993.398878","Link":"http://dx.doi.org/10.1109/VISUAL.1993.398878","FirstPage":"268","LastPage":"274","PaperType":"C","Abstract":"Texture mapping is normally used to convey geometric detail without adding geometric complexity. This paper introduces Boolean textures, a texture mapping technique that uses implicit functions to generate texture maps and texture coordinates. These Boolean textures perform clipping during a renderer's scan conversion step. Any implicit function is a candidate Boolean texture clipper. The paper describes how to use quadrics as clippers. Applications from engineering and medicine illustrate the effectiveness of texture as a clipping tool.<<ETX>>","AuthorNamesDeduped":"W. E. Lorenson","AuthorNames":"W.E. Lorensen","AuthorAffiliation":"General Electric Corp., Schenectady, NY, USA","InternalReferences":"10.1109/VISUAL.1992.235205;10.1109/VISUAL.1992.235204","AuthorKeywords":"","AminerCitationCount022019":"","XPloreCitationCount022019":"5","PubsCited":"20","Award":""}},{"name":"Kenneth I. Joy","value":427,"numPapers":123,"cluster":"6","visible":1,"index":112,"weight":34,"x":266.0195189105582,"y":476.9446348497701,"px":271.1346133199902,"py":475.48792012860395,"node":{"Conference":"Vis","Year":"1996","Title":"Dynamic view-dependent simplification for polygonal models","DOI":"10.1109/VISUAL.1996.568126","Link":"http://dx.doi.org/10.1109/VISUAL.1996.568126","FirstPage":"327","LastPage":"334","PaperType":"C","Abstract":"Presents an algorithm for performing view-dependent simplifications of a triangulated polygonal model in real-time. The simplifications are dependent on viewing direction, lighting and visibility, and are performed by taking advantage of image-space, object-space and frame-to-frame coherences. A continuous level-of-detail representation for an object is first constructed off-line. This representation is then used at run-time to guide the selection of appropriate triangles for display. The list of displayed triangles is updated incrementally from one frame to the next. Our approach is more effective than the current level-of-detail-based rendering approaches for most scientific visualization applications where there are a limited number of highly complex objects that stay relatively close to the viewer.","AuthorNamesDeduped":"Julie C. Xia;Amitabh Varshney","AuthorNames":"J.C. Xia;A. Varshney","AuthorAffiliation":"State Univ. of New York, Stony Brook, NY, USA","InternalReferences":"10.1109/VISUAL.1993.398868;10.1109/VISUAL.1995.480805","AuthorKeywords":"","AminerCitationCount022019":"50","XPloreCitationCount022019":"98","PubsCited":"23","Award":""}},{"name":"Thierry Delmarcelle","value":112,"numPapers":5,"cluster":"6","visible":1,"index":113,"weight":5,"x":152.76450435323466,"y":595.9583520582529,"px":159.0420595051161,"py":591.197015389077,"node":{"Conference":"Vis","Year":"1990","Title":"Moving iconic objects in scientific visualization","DOI":"10.1109/VISUAL.1990.146373","Link":"http://dx.doi.org/10.1109/VISUAL.1990.146373","FirstPage":"124","LastPage":"130, 468","PaperType":"C","Abstract":"The idea of independently moving, interacting graphical objects is introduced as a method for the visualization of continuous fields. Bird-oid objects or boids are discussed. These boids derive from: (1) icons which are geometric objects whose shape and appearance are related to the field variables, (2) three-dimensional cursors by which a user interactively picks a point in space, (3) particle traces, which are numerically integrated trajectories in space, (4) moving frames of vectors along space curves, and (5) actors, which are programming objects that can create and destroy instances of themselves, act according to internal logic, and communicate with each other and with a user. A software prototype in the C++ language has been developed which demonstrates some of the capabilities of these objects for the visualization of scalar, vector, and tensor fields defined over finite elements or finite volumes.<<ETX>>","AuthorNamesDeduped":"G. David Kerlick","AuthorNames":"D.G. Kerlick","AuthorAffiliation":"Tektronix Labs., Beaverton, OR, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"47","XPloreCitationCount022019":"12","PubsCited":"22","Award":""}},{"name":"Lambertus Hesselink","value":189,"numPapers":12,"cluster":"6","visible":1,"index":114,"weight":8,"x":209.7138344235357,"y":546.1139390253486,"px":214.47083879375646,"py":541.9707259518096,"node":{"Conference":"Vis","Year":"1990","Title":"Surface representations of two- and three-dimensional fluid flow topology","DOI":"10.1109/VISUAL.1990.146359","Link":"http://dx.doi.org/10.1109/VISUAL.1990.146359","FirstPage":"6","LastPage":"13, 460","PaperType":"C","Abstract":"The use of critical point analysis to generate representations of the vector field topology of numerical flow data sets is discussed. Critical points are located and characterized in a two-dimensional domain, which may be either a two-dimensional flow field or the tangential velocity field near a three-dimensional body. Tangent curves are then integrated out along the principal directions of certain classes of critical points. The points and curves are linked to form a skeleton representing the two-dimensional vector field topology. When generated from the tangential velocity field near a body in a three-dimensional flow, the skeleton includes the critical points and curves which provide a basis for analyzing the three-dimensional structure of the flow separation.<<ETX>>","AuthorNamesDeduped":"James Helman;Lambertus Hesselink","AuthorNames":"J.L. Helman;L. Hesselink","AuthorAffiliation":"Stanford Univ., CA, USA;Stanford Univ., CA, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"102","XPloreCitationCount022019":"23","PubsCited":"11","Award":""}},{"name":"Rainer Wegenkittl","value":298,"numPapers":31,"cluster":"3","visible":1,"index":115,"weight":20,"x":476.4882422257498,"y":616.0172051525269,"px":477.81756879325,"py":610.8800397154611,"node":{"Conference":"Vis","Year":"1990","Title":"Moving iconic objects in scientific visualization","DOI":"10.1109/VISUAL.1990.146373","Link":"http://dx.doi.org/10.1109/VISUAL.1990.146373","FirstPage":"124","LastPage":"130, 468","PaperType":"C","Abstract":"The idea of independently moving, interacting graphical objects is introduced as a method for the visualization of continuous fields. Bird-oid objects or boids are discussed. These boids derive from: (1) icons which are geometric objects whose shape and appearance are related to the field variables, (2) three-dimensional cursors by which a user interactively picks a point in space, (3) particle traces, which are numerically integrated trajectories in space, (4) moving frames of vectors along space curves, and (5) actors, which are programming objects that can create and destroy instances of themselves, act according to internal logic, and communicate with each other and with a user. A software prototype in the C++ language has been developed which demonstrates some of the capabilities of these objects for the visualization of scalar, vector, and tensor fields defined over finite elements or finite volumes.<<ETX>>","AuthorNamesDeduped":"G. David Kerlick","AuthorNames":"D.G. Kerlick","AuthorAffiliation":"Tektronix Labs., Beaverton, OR, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"47","XPloreCitationCount022019":"12","PubsCited":"22","Award":""}},{"name":"Dieter Schmalstieg","value":223,"numPapers":45,"cluster":"1","visible":1,"index":116,"weight":14,"x":429.85527393820956,"y":274.5036803286942,"px":434.0091833256816,"py":277.30174798209697,"node":{"Conference":"Vis","Year":"1996","Title":"Virtual Workbench-a non-immersive virtual environment for visualizing and interacting with 3D objects for scientific visualization","DOI":"10.1109/VISUAL.1996.568128","Link":"http://dx.doi.org/10.1109/VISUAL.1996.568128","FirstPage":"345","LastPage":"349","PaperType":"C","Abstract":"The Virtual Workbench (VW) is a non-immersive virtual environment that allows users to view and interact with stereoscopic objects displayed on a workspace similar to a tabletop workspace used in day-to-day life. A VW is an ideal environment for collaborative work where several colleagues can gather around the table to study 3D virtual objects. The Virtual Reality laboratory at the Naval Research Laboratory has implemented the VW using a concept similar to (Froehlich et al., 1994). This paper investigates how the VW can be used as a non-immersive display device for understanding and interpreting complex objects encountered in the scientific visualization field. Different techniques for interacting with 3D visualization objects on the table and using VW as a display device for visualization are evaluated using several cases.","AuthorNamesDeduped":"Upul Obeysekare;Chas Williams;Jim Durbin;Lawrence J. Rosenblum;Robert Rosenberg;Fernando Grinstein;Ravi Ramamurthi;Alexandra Landsberg;William Sandberg","AuthorNames":"U. Obeysekare;C. Williams;J. Durbin;L. Rosenblum;R. Rosenberg;F. Grinstein;R. Ramamurti;A. Landsberg;W. Sandberg","AuthorAffiliation":"Naval Res. Lab., Washington, DC, USA","InternalReferences":"10.1109/VISUAL.1991.175771","AuthorKeywords":"","AminerCitationCount022019":"50","XPloreCitationCount022019":"10","PubsCited":"12","Award":""}},{"name":"Robert van Liere","value":155,"numPapers":27,"cluster":"3","visible":1,"index":117,"weight":4,"x":367.84573490432456,"y":573.8916666379882,"px":374.70473790704995,"py":571.5449341647992,"node":{"Conference":"Vis","Year":"1990","Title":"Shape coding of multidimensional data on a microcomputer display","DOI":"10.1109/VISUAL.1990.146387","Link":"http://dx.doi.org/10.1109/VISUAL.1990.146387","FirstPage":"238","LastPage":"246, 478","PaperType":"C","Abstract":"The author presents a simple and flexible method of sharp coding for higher dimensional data sets that allows the database operator or the scientist quick access to promising patterns within and among records or samples. The example used is a 13-parameter set of solar wind, magnetosphere, and ground observation data collected hourly for 21 days in 1976. The software system is a prototype developed to demonstrate the glyph approach to depicting higher-dimensional data sets. The experiment was to depict all parameters simultaneously, to see if any global or local patterns emerged. This experiment proves that much more complex data can be presented for visual pattern extraction than standard methods allow.<<ETX>>","AuthorNamesDeduped":"Jeff Beddow","AuthorNames":"J. Beddow","AuthorAffiliation":"Microsimulations Res., Minneapolis, MN, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"","XPloreCitationCount022019":"32","PubsCited":"5","Award":""}},{"name":"Peter A. Rona","value":17,"numPapers":9,"cluster":"4","visible":1,"index":118,"weight":2,"x":432.26051780711,"y":795.5220482328104,"px":435.1865079899559,"py":788.683117458076,"node":{"Conference":"Vis","Year":"1995","Title":"Iconic techniques for feature visualization","DOI":"10.1109/VISUAL.1995.485141","Link":"http://dx.doi.org/10.1109/VISUAL.1995.485141","FirstPage":"288","LastPage":"295, 464","PaperType":"C","Abstract":"Presents a conceptual framework and a process model for feature extraction and iconic visualization. Feature extraction is viewed as a process of data abstraction, which can proceed in multiple stages, and corresponding data abstraction levels. The features are represented by attribute sets, which play a key role in the visualization process. Icons are symbolic parametric objects, designed as visual representations of features. The attributes are mapped to the parameters (or degrees of freedom) of an icon. We describe some generic techniques to generate attribute sets, such as volume integrals and medial axis transforms. A simple but powerful modeling language was developed to create icons, and to link the attributes to the icon parameters. We present illustrative examples of iconic visualization created with the techniques described, showing the effectiveness of this approach.","AuthorNamesDeduped":"Frank J. Post;Theo van Walsum;Frits H. Post;Deborah Silver","AuthorNames":"F.J. Post;T. van Walsum;F.H. Post;D. Silver","AuthorAffiliation":"Fac. of Tech. Math. & Inf., Delft Univ. of Technol., Netherlands;Fac. of Tech. Math. & Inf., Delft Univ. of Technol., Netherlands;Fac. of Tech. Math. & Inf., Delft Univ. of Technol., Netherlands","InternalReferences":"10.1109/VISUAL.1993.398849;10.1109/VISUAL.1991.175809;10.1109/VISUAL.1992.235174","AuthorKeywords":"scientific visualization, feature extraction, iconic visualization, attribute calculation","AminerCitationCount022019":"168","XPloreCitationCount022019":"49","PubsCited":"25","Award":""}},{"name":"Karen G. Bemis","value":17,"numPapers":9,"cluster":"4","visible":1,"index":119,"weight":2,"x":396.71999202720184,"y":791.9995425609453,"px":400.43673145247215,"py":785.0132327778,"node":{"Conference":"Vis","Year":"1995","Title":"Iconic techniques for feature visualization","DOI":"10.1109/VISUAL.1995.485141","Link":"http://dx.doi.org/10.1109/VISUAL.1995.485141","FirstPage":"288","LastPage":"295, 464","PaperType":"C","Abstract":"Presents a conceptual framework and a process model for feature extraction and iconic visualization. Feature extraction is viewed as a process of data abstraction, which can proceed in multiple stages, and corresponding data abstraction levels. The features are represented by attribute sets, which play a key role in the visualization process. Icons are symbolic parametric objects, designed as visual representations of features. The attributes are mapped to the parameters (or degrees of freedom) of an icon. We describe some generic techniques to generate attribute sets, such as volume integrals and medial axis transforms. A simple but powerful modeling language was developed to create icons, and to link the attributes to the icon parameters. We present illustrative examples of iconic visualization created with the techniques described, showing the effectiveness of this approach.","AuthorNamesDeduped":"Frank J. Post;Theo van Walsum;Frits H. Post;Deborah Silver","AuthorNames":"F.J. Post;T. van Walsum;F.H. Post;D. Silver","AuthorAffiliation":"Fac. of Tech. Math. & Inf., Delft Univ. of Technol., Netherlands;Fac. of Tech. Math. & Inf., Delft Univ. of Technol., Netherlands;Fac. of Tech. Math. & Inf., Delft Univ. of Technol., Netherlands","InternalReferences":"10.1109/VISUAL.1993.398849;10.1109/VISUAL.1991.175809;10.1109/VISUAL.1992.235174","AuthorKeywords":"scientific visualization, feature extraction, iconic visualization, attribute calculation","AminerCitationCount022019":"168","XPloreCitationCount022019":"49","PubsCited":"25","Award":""}},{"name":"Elke A. Rundensteiner","value":512,"numPapers":80,"cluster":"2","visible":1,"index":120,"weight":37,"x":496.9963352736907,"y":339.2767679091747,"px":499.46094275778063,"py":340.08534271339147,"node":{"Conference":"Vis","Year":"1990","Title":"Parallel coordinates: a tool for visualizing multi-dimensional geometry","DOI":"10.1109/VISUAL.1990.146402","Link":"http://dx.doi.org/10.1109/VISUAL.1990.146402","FirstPage":"361","LastPage":"378","PaperType":"C","Abstract":"A methodology for visualizing analytic and synthetic geometry in R/sup N/ is presented. It is based on a system of parallel coordinates which induces a nonprojective mapping between N-dimensional and two-dimensional sets. Hypersurfaces are represented by their planar images which have some geometrical properties analogous to the properties of the hypersurface that they represent. A point from to line duality when N=2 generalizes to lines and hyperplanes enabling the representation of polyhedra in R/sup N/. The representation of a class of convex and non-convex hypersurfaces is discussed, together with an algorithm for constructing and displaying any interior point. The display shows some local properties of the hypersurface and provides information on the point's proximity to the boundary. Applications are discussed.<<ETX>>","AuthorNamesDeduped":"Alfred Inselberg;Bernard Dimsdale","AuthorNames":"A. Inselberg;B. Dimsdale","AuthorAffiliation":"IBM Sci. Center, Los Angeles, CA, USA;IBM Sci. Center, Los Angeles, CA, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"920","XPloreCitationCount022019":"308","PubsCited":"47","Award":""}},{"name":"Ying-Huey Fua","value":154,"numPapers":16,"cluster":"2","visible":1,"index":121,"weight":3,"x":564.1087646332026,"y":449.60842401729684,"px":563.5623913857684,"py":447.98973321059634,"node":{"Conference":"Vis","Year":"1990","Title":"Parallel coordinates: a tool for visualizing multi-dimensional geometry","DOI":"10.1109/VISUAL.1990.146402","Link":"http://dx.doi.org/10.1109/VISUAL.1990.146402","FirstPage":"361","LastPage":"378","PaperType":"C","Abstract":"A methodology for visualizing analytic and synthetic geometry in R/sup N/ is presented. It is based on a system of parallel coordinates which induces a nonprojective mapping between N-dimensional and two-dimensional sets. Hypersurfaces are represented by their planar images which have some geometrical properties analogous to the properties of the hypersurface that they represent. A point from to line duality when N=2 generalizes to lines and hyperplanes enabling the representation of polyhedra in R/sup N/. The representation of a class of convex and non-convex hypersurfaces is discussed, together with an algorithm for constructing and displaying any interior point. The display shows some local properties of the hypersurface and provides information on the point's proximity to the boundary. Applications are discussed.<<ETX>>","AuthorNamesDeduped":"Alfred Inselberg;Bernard Dimsdale","AuthorNames":"A. Inselberg;B. Dimsdale","AuthorAffiliation":"IBM Sci. Center, Los Angeles, CA, USA;IBM Sci. Center, Los Angeles, CA, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"920","XPloreCitationCount022019":"308","PubsCited":"47","Award":""}},{"name":"Allen R. Martin","value":127,"numPapers":3,"cluster":"2","visible":1,"index":122,"weight":2,"x":752.5904789895039,"y":284.445877074758,"px":747.1995160581031,"py":288.65186556568045,"node":{"Conference":"Vis","Year":"1990","Title":"Exploring N-dimensional databases","DOI":"10.1109/VISUAL.1990.146386","Link":"http://dx.doi.org/10.1109/VISUAL.1990.146386","FirstPage":"230","LastPage":"237","PaperType":"C","Abstract":"The authors present a tool for the display and analysis of N-dimensional data based on a technique called dimensional stacking. This technique is described. The primary goal is to create a tool that enables the user to project data of arbitrary dimensions onto a two-dimensional image. Of equal importance is the ability to control the viewing parameters, so that one can interactively adjust what ranges of values each dimension takes and the form in which the dimensions are displayed. This will allow an intuitive feel for the data to be developed as the database is explored. The system uses dimensional stacking, to collapse and N-dimension space down into a 2-D space and then render the values contained therein. Each value can then be represented as a pixel or rectangular region on a 2-D screen whose intensity corresponds to the data value at that point.<<ETX>>","AuthorNamesDeduped":"Jeffrey LeBlanc;Matthew O. Ward;Norman Wittels","AuthorNames":"J. LeBlanc;M.O. Ward;N. Wittels","AuthorAffiliation":"Worcester Polytech. Inst., MA, USA;Worcester Polytech. Inst., MA, USA;Worcester Polytech. Inst., MA, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"347","XPloreCitationCount022019":"89","PubsCited":"16","Award":""}},{"name":"Brian Johnson","value":206,"numPapers":0,"cluster":"6","visible":1,"index":123,"weight":1,"x":196.9847035575075,"y":272.3584964782294,"px":204.4607140817065,"py":282.8726718592598,"node":{"Conference":"Vis","Year":"1991","Title":"Tree-maps: a space-filling approach to the visualization of hierarchical information structures","DOI":"10.1109/VISUAL.1991.175815","Link":"http://dx.doi.org/10.1109/VISUAL.1991.175815","FirstPage":"284","LastPage":"291","PaperType":"C","Abstract":"A method for visualizing hierarchically structured information is described. The tree-map visualization technique makes 100% use of the available display space, mapping the full hierarchy onto a rectangular region in a space-filling manner. This efficient use of space allows very large hierarchies to be displayed in their entirety and facilitates the presentation of semantic information. Tree-maps can depict both the structure and content of the hierarchy. However, the approach is best suited to hierarchies in which the content of the leaf nodes and the structure of the hierarchy are of primary importance, and the content information associated with internal nodes is largely derived from their children.<<ETX>>","AuthorNamesDeduped":"Brian Johnson;Ben Shneiderman","AuthorNames":"B. Johnson;B. Shneiderman","AuthorAffiliation":"Dept. of Comput. Sci., Maryland Univ., College Park, MD, USA;Dept. of Comput. Sci., Maryland Univ., College Park, MD, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"1791","XPloreCitationCount022019":"351","PubsCited":"23","Award":""}},{"name":"Ben Shneiderman","value":717,"numPapers":36,"cluster":"0","visible":1,"index":124,"weight":31,"x":591.1878160819433,"y":325.72705009360016,"px":589.9571766184464,"py":326.5636082311416,"node":{"Conference":"Vis","Year":"1991","Title":"Tree-maps: a space-filling approach to the visualization of hierarchical information structures","DOI":"10.1109/VISUAL.1991.175815","Link":"http://dx.doi.org/10.1109/VISUAL.1991.175815","FirstPage":"284","LastPage":"291","PaperType":"C","Abstract":"A method for visualizing hierarchically structured information is described. The tree-map visualization technique makes 100% use of the available display space, mapping the full hierarchy onto a rectangular region in a space-filling manner. This efficient use of space allows very large hierarchies to be displayed in their entirety and facilitates the presentation of semantic information. Tree-maps can depict both the structure and content of the hierarchy. However, the approach is best suited to hierarchies in which the content of the leaf nodes and the structure of the hierarchy are of primary importance, and the content information associated with internal nodes is largely derived from their children.<<ETX>>","AuthorNamesDeduped":"Brian Johnson;Ben Shneiderman","AuthorNames":"B. Johnson;B. Shneiderman","AuthorAffiliation":"Dept. of Comput. Sci., Maryland Univ., College Park, MD, USA;Dept. of Comput. Sci., Maryland Univ., College Park, MD, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"1791","XPloreCitationCount022019":"351","PubsCited":"23","Award":""}},{"name":"Ming C. Hao","value":105,"numPapers":20,"cluster":"2","visible":1,"index":125,"weight":1,"x":841.8192699613605,"y":616.7883653809143,"px":834.8322099961871,"py":616.7373165924377,"node":{"Conference":"Vis","Year":"1998","Title":"The Gridfit algorithm: an efficient and effective approach to visualizing large amounts of spatial data","DOI":"10.1109/VISUAL.1998.745301","Link":"http://dx.doi.org/10.1109/VISUAL.1998.745301","FirstPage":"181","LastPage":"188","PaperType":"C","Abstract":"In a large number of applications, data is collected and referenced by their spatial locations. Visualizing large amounts of spatially referenced data on a limited-size screen display often results in poor visualizations due to the high degree of overplotting of neighboring datapoints. We introduce a new approach to visualizing large amounts of spatially referenced data. The basic idea is to intelligently use the unoccupied pixels of the display instead of overplotting data points. After formally describing the problem, we present two solutions which are based on: placing overlapping data points on the nearest unoccupied pixel; and shifting data points along a screen-filling curve (e.g., Hilbert-curve). We then develop a more sophisticated approach called Gridfit, which is based on a hierarchical partitioning of the data space. We evaluate all three approaches with respect to their efficiency and effectiveness and show the superiority of the Gridfit approach. For measuring the effectiveness, we not only present the resulting visualizations but also introduce mathematical effectiveness criteria measuring properties of the generated visualizations with respect to the original data such as distance- and position-preservation.","AuthorNamesDeduped":"Daniel A. Keim;Annemarie Herrmann","AuthorNames":"D.A. Keim;A. Herrmann","AuthorAffiliation":"Inst. of Comput. Sci., Halle-Wittenberg Univ., Halle, Germany","InternalReferences":"10.1109/VISUAL.1995.485139;10.1109/INFVIS.1995.528688;10.1109/VISUAL.1991.175794;10.1109/VISUAL.1990.146387;10.1109/VISUAL.1990.146402;10.1109/VISUAL.1993.398870;10.1109/VISUAL.1995.485140;10.1109/VISUAL.1994.346302;10.1109/INFVIS.1995.528690;10.1109/VISUAL.1990.146386","AuthorKeywords":"visualizing large data sets, visualizing spatially referenced data, visualizing geographical data, interfaces to databases","AminerCitationCount022019":"66","XPloreCitationCount022019":"13","PubsCited":"34","Award":""}},{"name":"Umeshwar Dayal","value":105,"numPapers":20,"cluster":"2","visible":1,"index":126,"weight":1,"x":794.164606094605,"y":25.01167378850575,"px":789.7261383612524,"py":33.60977081312371,"node":{"Conference":"Vis","Year":"1998","Title":"The Gridfit algorithm: an efficient and effective approach to visualizing large amounts of spatial data","DOI":"10.1109/VISUAL.1998.745301","Link":"http://dx.doi.org/10.1109/VISUAL.1998.745301","FirstPage":"181","LastPage":"188","PaperType":"C","Abstract":"In a large number of applications, data is collected and referenced by their spatial locations. Visualizing large amounts of spatially referenced data on a limited-size screen display often results in poor visualizations due to the high degree of overplotting of neighboring datapoints. We introduce a new approach to visualizing large amounts of spatially referenced data. The basic idea is to intelligently use the unoccupied pixels of the display instead of overplotting data points. After formally describing the problem, we present two solutions which are based on: placing overlapping data points on the nearest unoccupied pixel; and shifting data points along a screen-filling curve (e.g., Hilbert-curve). We then develop a more sophisticated approach called Gridfit, which is based on a hierarchical partitioning of the data space. We evaluate all three approaches with respect to their efficiency and effectiveness and show the superiority of the Gridfit approach. For measuring the effectiveness, we not only present the resulting visualizations but also introduce mathematical effectiveness criteria measuring properties of the generated visualizations with respect to the original data such as distance- and position-preservation.","AuthorNamesDeduped":"Daniel A. Keim;Annemarie Herrmann","AuthorNames":"D.A. Keim;A. Herrmann","AuthorAffiliation":"Inst. of Comput. Sci., Halle-Wittenberg Univ., Halle, Germany","InternalReferences":"10.1109/VISUAL.1995.485139;10.1109/INFVIS.1995.528688;10.1109/VISUAL.1991.175794;10.1109/VISUAL.1990.146387;10.1109/VISUAL.1990.146402;10.1109/VISUAL.1993.398870;10.1109/VISUAL.1995.485140;10.1109/VISUAL.1994.346302;10.1109/INFVIS.1995.528690;10.1109/VISUAL.1990.146386","AuthorKeywords":"visualizing large data sets, visualizing spatially referenced data, visualizing geographical data, interfaces to databases","AminerCitationCount022019":"66","XPloreCitationCount022019":"13","PubsCited":"34","Award":""}},{"name":"Patrick J. Moran","value":69,"numPapers":31,"cluster":"4","visible":1,"index":127,"weight":2,"x":11.393961955383983,"y":638.1551942017327,"px":13.437399599088952,"py":634.5677715673278,"node":{"Conference":"Vis","Year":"1992","Title":"An architecture for a scientific visualization system","DOI":"10.1109/VISUAL.1992.235219","Link":"http://dx.doi.org/10.1109/VISUAL.1992.235219","FirstPage":"107","LastPage":"114","PaperType":"C","Abstract":"The architecture of the Data Explorer, a scientific visualization system, is described. Data Explorer supports the visualization of a wide variety of data by means of a flexible set of visualization modules. A single powerful data model common to all modules allows a wide range of data types to be imported and passed between modules. There is integral support for parallelism, affecting the data model and the execution model. The visualization modules are highly interoperable, due in part to the common data model, and exemplified by the renderer. An execution model facilitates parallelization of modules and incorporates optimizations such as caching. The two-process client-server system structure consists of a user interface that communicates with an executive via a dataflow language.<<ETX>>","AuthorNamesDeduped":"Bruce Lucas;G. D. Abrams;Nancy S. Collins;D. A. Epstien;Donna L. Gresh;Kevin P. McAuliffe","AuthorNames":"B. Lucas;G.D. Abram;N.S. Collins;D.A. Epstein;D.L. Gresh;K.P. McAuliffe","AuthorAffiliation":"IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA;IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA;IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA;IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA;IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA;IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA","InternalReferences":"10.1109/VISUAL.1990.146397;10.1109/VISUAL.1992.235204;10.1109/VISUAL.1991.175818;10.1109/VISUAL.1991.175833","AuthorKeywords":"","AminerCitationCount022019":"189","XPloreCitationCount022019":"51","PubsCited":"8","Award":""}},{"name":"David Ellsworth","value":106,"numPapers":26,"cluster":"4","visible":1,"index":128,"weight":3,"x":144.8077966380608,"y":612.6128699660028,"px":153.01613248432733,"py":611.7509509707227,"node":{"Conference":"Vis","Year":"1994","Title":"UFAT-a particle tracer for time-dependent flow fields","DOI":"10.1109/VISUAL.1994.346311","Link":"http://dx.doi.org/10.1109/VISUAL.1994.346311","FirstPage":"257","LastPage":"264, C29","PaperType":"C","Abstract":"Time-dependent (unsteady) flow fields are commonly generated in computational fluid dynamics (CFD) simulations; however, there are very few flow visualization systems that generate particle traces in unsteady flow fields. Most existing systems generate particle traces in time-independent flow fields. A particle tracing system has been developed to generate particle traces in unsteady flow fields. The system was used to visualize several 3D unsteady flow fields from real-world problems, and it has provided useful insights into the time-varying phenomena in the flow fields. The design requirements and the architecture of the system are described. Some examples of particle traces computed by the system are also shown.<<ETX>>","AuthorNamesDeduped":"David A. Lane","AuthorNames":"D.A. Lane","AuthorAffiliation":"NASA Ames Res. Center, Moffett Field, CA, USA","InternalReferences":"10.1109/VISUAL.1990.146360;10.1109/VISUAL.1993.398848;10.1109/VISUAL.1993.398850;10.1109/VISUAL.1993.398849;10.1109/VISUAL.1993.398846","AuthorKeywords":"","AminerCitationCount022019":"120","XPloreCitationCount022019":"31","PubsCited":"15","Award":""}},{"name":"Alexandru Telea","value":271,"numPapers":82,"cluster":"6","visible":1,"index":129,"weight":8,"x":728.6941255945203,"y":450.29617015567464,"px":725.3893723822878,"py":448.47889953969076,"node":{"Conference":"Vis","Year":"1995","Title":"Enhanced spot noise for vector field visualization","DOI":"10.1109/VISUAL.1995.480817","Link":"http://dx.doi.org/10.1109/VISUAL.1995.480817","FirstPage":"233","LastPage":"239, 457","PaperType":"C","Abstract":"Spot noise is a technique for texture synthesis, which is very useful for vector field visualization. This paper describes improvements and extensions of the basic principle of spot noise. First, better visualization of highly curved vector fields with spot noise is achieved, by adapting the shape of the spots to the local velocity field. Second, filtering of spots is proposed to eliminate undesired low frequency components from the spot noise texture. Third, methods are described to utilize graphics hardware to generate the texture, and to produce variable viewpoint animations of spot noise on surfaces. Fourth, the synthesis of spot noise on grids with highly irregular cell sizes is described.","AuthorNamesDeduped":"Wim C. de Leeuw;Jarke J. van Wijk","AuthorNames":"W.C. de Leeuw;J.J. van Wijk","AuthorAffiliation":"Fac. of Tech. Math. & Inf., Delft Univ. of Technol., Netherlands","InternalReferences":"10.1109/VISUAL.1994.346312;10.1109/VISUAL.1994.346313;10.1109/VISUAL.1993.398877","AuthorKeywords":"","AminerCitationCount022019":"125","XPloreCitationCount022019":"33","PubsCited":"7","Award":""}},{"name":"Markus H. Gross","value":154,"numPapers":42,"cluster":"4","visible":1,"index":130,"weight":5,"x":189.14151477732713,"y":415.5656368574058,"px":196.52551064782364,"py":416.09653855792146,"node":{"Conference":"Vis","Year":"1994","Title":"Wavelet-based volume morphing","DOI":"10.1109/VISUAL.1994.346333","Link":"http://dx.doi.org/10.1109/VISUAL.1994.346333","FirstPage":"85","LastPage":"92, C8","PaperType":"C","Abstract":"This paper presents a technique for performing volume morphing between two volumetric datasets in the wavelet domain. The idea is to decompose the volumetric datasets into a set of frequency bands, apply smooth interpolation to each band, and reconstruct to form the morphed model. In addition, a technique for establishing a suitable correspondence among object voxels is presented. The combination of these two techniques results in a smooth transition between the two datasets and produces morphed volume with fewer high frequency distortions than those obtained from spatial domain volume morphing.<<ETX>>","AuthorNamesDeduped":"Taosong He;Sidney W. Wang;Arie E. Kaufman","AuthorNames":"Taosong He;S. Wang;A. Kaufman","AuthorAffiliation":"Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA;Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA;Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA","InternalReferences":"10.1109/VISUAL.1993.398854","AuthorKeywords":"","AminerCitationCount022019":"182","XPloreCitationCount022019":"22","PubsCited":"9","Award":""}},{"name":"Roger Gatti","value":25,"numPapers":1,"cluster":"6","visible":1,"index":131,"weight":1,"x":-282.2913022142399,"y":341.89293541948604,"px":-277.00716209057197,"py":332.22709295445,"node":{"Conference":"Vis","Year":"1994","Title":"Wavelet-based volume morphing","DOI":"10.1109/VISUAL.1994.346333","Link":"http://dx.doi.org/10.1109/VISUAL.1994.346333","FirstPage":"85","LastPage":"92, C8","PaperType":"C","Abstract":"This paper presents a technique for performing volume morphing between two volumetric datasets in the wavelet domain. The idea is to decompose the volumetric datasets into a set of frequency bands, apply smooth interpolation to each band, and reconstruct to form the morphed model. In addition, a technique for establishing a suitable correspondence among object voxels is presented. The combination of these two techniques results in a smooth transition between the two datasets and produces morphed volume with fewer high frequency distortions than those obtained from spatial domain volume morphing.<<ETX>>","AuthorNamesDeduped":"Taosong He;Sidney W. Wang;Arie E. Kaufman","AuthorNames":"Taosong He;S. Wang;A. Kaufman","AuthorAffiliation":"Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA;Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA;Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA","InternalReferences":"10.1109/VISUAL.1993.398854","AuthorKeywords":"","AminerCitationCount022019":"182","XPloreCitationCount022019":"22","PubsCited":"9","Award":""}},{"name":"Oliver G. Staadt","value":65,"numPapers":4,"cluster":"6","visible":1,"index":132,"weight":2,"x":-58.29280003565013,"y":405.9361612883503,"px":-51.06529247161708,"py":403.9113572099016,"node":{"Conference":"Vis","Year":"1994","Title":"Wavelet-based volume morphing","DOI":"10.1109/VISUAL.1994.346333","Link":"http://dx.doi.org/10.1109/VISUAL.1994.346333","FirstPage":"85","LastPage":"92, C8","PaperType":"C","Abstract":"This paper presents a technique for performing volume morphing between two volumetric datasets in the wavelet domain. The idea is to decompose the volumetric datasets into a set of frequency bands, apply smooth interpolation to each band, and reconstruct to form the morphed model. In addition, a technique for establishing a suitable correspondence among object voxels is presented. The combination of these two techniques results in a smooth transition between the two datasets and produces morphed volume with fewer high frequency distortions than those obtained from spatial domain volume morphing.<<ETX>>","AuthorNamesDeduped":"Taosong He;Sidney W. Wang;Arie E. Kaufman","AuthorNames":"Taosong He;S. Wang;A. Kaufman","AuthorAffiliation":"Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA;Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA;Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA","InternalReferences":"10.1109/VISUAL.1993.398854","AuthorKeywords":"","AminerCitationCount022019":"182","XPloreCitationCount022019":"22","PubsCited":"9","Award":""}},{"name":"Rüdiger Westermann","value":625,"numPapers":199,"cluster":"4","visible":1,"index":133,"weight":64,"x":386.64233306293727,"y":458.24584467371994,"px":388.69667524882215,"py":456.3532193810281,"node":{"Conference":"Vis","Year":"1990","Title":"The application of transport theory to visualization of 3D scalar data fields","DOI":"10.1109/VISUAL.1990.146391","Link":"http://dx.doi.org/10.1109/VISUAL.1990.146391","FirstPage":"273","LastPage":"280, 481-2","PaperType":"C","Abstract":"The author describes a visualization model for three-dimensional scalar data fields based on linear transport theory. The concept of virtual particles for the extraction of information from data fields in introduced. The role of different types of interaction of the data field with those particles such as absorption, scattering, source and color shift are discussed and demonstrated. Special attention is given to possible tools for the enhancement of interesting data features. Random texturing can provide visual insights as to the magnitude and distribution of deviations of related data fields, e.g., originating from analytic models, and measurements, or in the noise content of a given data field. Hidden symmetries of a data set can often be identified visually by allowing it to interact with a preselected beam of physical particles with the attendant appearance of characteristic structural effects such as channeling.<<ETX>>","AuthorNamesDeduped":"Wolfgang Krüger","AuthorNames":"W. Krueger","AuthorAffiliation":"ART+COM e.V., Berlin, Germany","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"","XPloreCitationCount022019":"11","PubsCited":"24","Award":""}},{"name":"Gordon L. Kindlmann","value":661,"numPapers":129,"cluster":"6","visible":1,"index":134,"weight":47,"x":370.7264150447102,"y":452.35686518253067,"px":373.2161063540171,"py":456.19269823908036,"node":{"Conference":"Vis","Year":"1990","Title":"Moving iconic objects in scientific visualization","DOI":"10.1109/VISUAL.1990.146373","Link":"http://dx.doi.org/10.1109/VISUAL.1990.146373","FirstPage":"124","LastPage":"130, 468","PaperType":"C","Abstract":"The idea of independently moving, interacting graphical objects is introduced as a method for the visualization of continuous fields. Bird-oid objects or boids are discussed. These boids derive from: (1) icons which are geometric objects whose shape and appearance are related to the field variables, (2) three-dimensional cursors by which a user interactively picks a point in space, (3) particle traces, which are numerically integrated trajectories in space, (4) moving frames of vectors along space curves, and (5) actors, which are programming objects that can create and destroy instances of themselves, act according to internal logic, and communicate with each other and with a user. A software prototype in the C++ language has been developed which demonstrates some of the capabilities of these objects for the visualization of scalar, vector, and tensor fields defined over finite elements or finite volumes.<<ETX>>","AuthorNamesDeduped":"G. David Kerlick","AuthorNames":"D.G. Kerlick","AuthorAffiliation":"Tektronix Labs., Beaverton, OR, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"47","XPloreCitationCount022019":"12","PubsCited":"22","Award":""}},{"name":"David H. Laidlaw","value":348,"numPapers":83,"cluster":"6","visible":1,"index":135,"weight":14,"x":451.9133729922564,"y":455.3569893048894,"px":453.83698751324795,"py":453.4484501450762,"node":{"Conference":"Vis","Year":"1992","Title":"Color, change, and control of quantitative data display","DOI":"10.1109/VISUAL.1992.235201","Link":"http://dx.doi.org/10.1109/VISUAL.1992.235201","FirstPage":"252","LastPage":"259","PaperType":"C","Abstract":"Calico, a dynamic tool for the creation and manipulation of color mappings for the exploration of multivariate, quantitative data, was used to study the effects of user control and smooth change on user preference, accuracy, and confidence. The results of the study, as well as other user experiences with Calico, support the hypothesis that dynamic manipulation of color mappings is a useful feature of systems for the exploration of quantitative data using color. The main effect observed is a clear user preference for representations providing control over the mapping, a small but significant increase in accuracy, and greater confidence in information gleaned from manipulable displays. A smaller and less consistent effect showed greater user preference for an confidence in representations which provided smooth change between images.<<ETX>>","AuthorNamesDeduped":"Penny Rheingans","AuthorNames":"P. Rheingans","AuthorAffiliation":"Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA","InternalReferences":"10.1109/VISUAL.1990.146383","AuthorKeywords":"","AminerCitationCount022019":"50","XPloreCitationCount022019":"9","PubsCited":"13","Award":""}},{"name":"Eric T. Ahrens","value":87,"numPapers":1,"cluster":"6","visible":1,"index":136,"weight":2,"x":150.8858573955515,"y":647.7035940117896,"px":157.05654586405763,"py":641.8763760615658,"node":{"Conference":"Vis","Year":"1992","Title":"Color, change, and control of quantitative data display","DOI":"10.1109/VISUAL.1992.235201","Link":"http://dx.doi.org/10.1109/VISUAL.1992.235201","FirstPage":"252","LastPage":"259","PaperType":"C","Abstract":"Calico, a dynamic tool for the creation and manipulation of color mappings for the exploration of multivariate, quantitative data, was used to study the effects of user control and smooth change on user preference, accuracy, and confidence. The results of the study, as well as other user experiences with Calico, support the hypothesis that dynamic manipulation of color mappings is a useful feature of systems for the exploration of quantitative data using color. The main effect observed is a clear user preference for representations providing control over the mapping, a small but significant increase in accuracy, and greater confidence in information gleaned from manipulable displays. A smaller and less consistent effect showed greater user preference for an confidence in representations which provided smooth change between images.<<ETX>>","AuthorNamesDeduped":"Penny Rheingans","AuthorNames":"P. Rheingans","AuthorAffiliation":"Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA","InternalReferences":"10.1109/VISUAL.1990.146383","AuthorKeywords":"","AminerCitationCount022019":"50","XPloreCitationCount022019":"9","PubsCited":"13","Award":""}},{"name":"David Kremers","value":87,"numPapers":1,"cluster":"6","visible":1,"index":137,"weight":2,"x":129.97976199324341,"y":645.841609628586,"px":134.86842963443067,"py":638.2912513573999,"node":{"Conference":"Vis","Year":"1992","Title":"Color, change, and control of quantitative data display","DOI":"10.1109/VISUAL.1992.235201","Link":"http://dx.doi.org/10.1109/VISUAL.1992.235201","FirstPage":"252","LastPage":"259","PaperType":"C","Abstract":"Calico, a dynamic tool for the creation and manipulation of color mappings for the exploration of multivariate, quantitative data, was used to study the effects of user control and smooth change on user preference, accuracy, and confidence. The results of the study, as well as other user experiences with Calico, support the hypothesis that dynamic manipulation of color mappings is a useful feature of systems for the exploration of quantitative data using color. The main effect observed is a clear user preference for representations providing control over the mapping, a small but significant increase in accuracy, and greater confidence in information gleaned from manipulable displays. A smaller and less consistent effect showed greater user preference for an confidence in representations which provided smooth change between images.<<ETX>>","AuthorNamesDeduped":"Penny Rheingans","AuthorNames":"P. Rheingans","AuthorAffiliation":"Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA","InternalReferences":"10.1109/VISUAL.1990.146383","AuthorKeywords":"","AminerCitationCount022019":"50","XPloreCitationCount022019":"9","PubsCited":"13","Award":""}},{"name":"Matthew J. Avalos","value":87,"numPapers":1,"cluster":"6","visible":1,"index":138,"weight":2,"x":232.01028809319337,"y":702.4701255164468,"px":235.82416104729515,"py":696.6080227986333,"node":{"Conference":"Vis","Year":"1992","Title":"Color, change, and control of quantitative data display","DOI":"10.1109/VISUAL.1992.235201","Link":"http://dx.doi.org/10.1109/VISUAL.1992.235201","FirstPage":"252","LastPage":"259","PaperType":"C","Abstract":"Calico, a dynamic tool for the creation and manipulation of color mappings for the exploration of multivariate, quantitative data, was used to study the effects of user control and smooth change on user preference, accuracy, and confidence. The results of the study, as well as other user experiences with Calico, support the hypothesis that dynamic manipulation of color mappings is a useful feature of systems for the exploration of quantitative data using color. The main effect observed is a clear user preference for representations providing control over the mapping, a small but significant increase in accuracy, and greater confidence in information gleaned from manipulable displays. A smaller and less consistent effect showed greater user preference for an confidence in representations which provided smooth change between images.<<ETX>>","AuthorNamesDeduped":"Penny Rheingans","AuthorNames":"P. Rheingans","AuthorAffiliation":"Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA","InternalReferences":"10.1109/VISUAL.1990.146383","AuthorKeywords":"","AminerCitationCount022019":"50","XPloreCitationCount022019":"9","PubsCited":"13","Award":""}},{"name":"Russell E. Jacobs","value":87,"numPapers":1,"cluster":"6","visible":1,"index":139,"weight":2,"x":215.71940106673648,"y":687.0880110816835,"px":220.44399424131575,"py":682.1197272638933,"node":{"Conference":"Vis","Year":"1992","Title":"Color, change, and control of quantitative data display","DOI":"10.1109/VISUAL.1992.235201","Link":"http://dx.doi.org/10.1109/VISUAL.1992.235201","FirstPage":"252","LastPage":"259","PaperType":"C","Abstract":"Calico, a dynamic tool for the creation and manipulation of color mappings for the exploration of multivariate, quantitative data, was used to study the effects of user control and smooth change on user preference, accuracy, and confidence. The results of the study, as well as other user experiences with Calico, support the hypothesis that dynamic manipulation of color mappings is a useful feature of systems for the exploration of quantitative data using color. The main effect observed is a clear user preference for representations providing control over the mapping, a small but significant increase in accuracy, and greater confidence in information gleaned from manipulable displays. A smaller and less consistent effect showed greater user preference for an confidence in representations which provided smooth change between images.<<ETX>>","AuthorNamesDeduped":"Penny Rheingans","AuthorNames":"P. Rheingans","AuthorAffiliation":"Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA","InternalReferences":"10.1109/VISUAL.1990.146383","AuthorKeywords":"","AminerCitationCount022019":"50","XPloreCitationCount022019":"9","PubsCited":"13","Award":""}},{"name":"Carol Readhead","value":87,"numPapers":1,"cluster":"6","visible":1,"index":140,"weight":2,"x":189.0562917450313,"y":671.9146643258637,"px":193.75066173792533,"py":665.9615447818265,"node":{"Conference":"Vis","Year":"1992","Title":"Color, change, and control of quantitative data display","DOI":"10.1109/VISUAL.1992.235201","Link":"http://dx.doi.org/10.1109/VISUAL.1992.235201","FirstPage":"252","LastPage":"259","PaperType":"C","Abstract":"Calico, a dynamic tool for the creation and manipulation of color mappings for the exploration of multivariate, quantitative data, was used to study the effects of user control and smooth change on user preference, accuracy, and confidence. The results of the study, as well as other user experiences with Calico, support the hypothesis that dynamic manipulation of color mappings is a useful feature of systems for the exploration of quantitative data using color. The main effect observed is a clear user preference for representations providing control over the mapping, a small but significant increase in accuracy, and greater confidence in information gleaned from manipulable displays. A smaller and less consistent effect showed greater user preference for an confidence in representations which provided smooth change between images.<<ETX>>","AuthorNamesDeduped":"Penny Rheingans","AuthorNames":"P. Rheingans","AuthorAffiliation":"Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA","InternalReferences":"10.1109/VISUAL.1990.146383","AuthorKeywords":"","AminerCitationCount022019":"50","XPloreCitationCount022019":"9","PubsCited":"13","Award":""}},{"name":"Peter Hastreiter","value":84,"numPapers":36,"cluster":"4","visible":1,"index":141,"weight":3,"x":293.8698422144062,"y":388.67264278297785,"px":299.8431008006398,"py":389.3696722883776,"node":{"Conference":"Vis","Year":"1993","Title":"Texture splats for 3D scalar and vector field visualization","DOI":"10.1109/VISUAL.1993.398877","Link":"http://dx.doi.org/10.1109/VISUAL.1993.398877","FirstPage":"261","LastPage":"266","PaperType":"C","Abstract":"Volume visualization is becoming an important tool for understanding large 3D data sets. A popular technique for volume rendering is known as splatting. With new hardware architectures offering substantial improvements in the performance of rendering texture mapped objects, we present textured splats. An ideal reconstruction function for 3D signals is developed which can be used as a texture map for a splat. Extensions to the basic splatting technique are then developed to additionally represent vector fields.<<ETX>>","AuthorNamesDeduped":"Roger Crawfis;Nelson L. Max","AuthorNames":"R.A. Crawfis;N. Max","AuthorAffiliation":"Lawrence Livermore Nat. Lab., Livermore, CA, USA;Lawrence Livermore Nat. Lab., Livermore, CA, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"1","XPloreCitationCount022019":"73","PubsCited":"6","Award":"TT"}},{"name":"Bruno Jobard","value":78,"numPapers":10,"cluster":"8","visible":1,"index":142,"weight":3,"x":321.1356947405252,"y":227.6727493697811,"px":328.10236651651417,"py":232.1462240431868,"node":{"Conference":"Vis","Year":"1994","Title":"Visualizing flow over curvilinear grid surfaces using line integral convolution","DOI":"10.1109/VISUAL.1994.346313","Link":"http://dx.doi.org/10.1109/VISUAL.1994.346313","FirstPage":"240","LastPage":"247, C27","PaperType":"C","Abstract":"Line integral convolution (LIC), introduced by B. Cabral and C. Leedom (1993), is a powerful technique for imaging and animating vector fields. We extend the LIC paradigm in three ways: the existing technique is limited to vector fields over a regular Cartesian grid and we extend it to vector fields over parametric surfaces, specifically those found in curvilinear grids, used in computational fluid dynamics simulations; periodic motion filters can be used to animate the flow visualization, but when the flow lies on a parametric surface, the motion appears misleading, and we explain why this problem arises and show how to adjust the LIC algorithm to handle it; we introduce a technique to visualize vector magnitude as well as vector direction, which is based on varying the frequency of the filter function and we develop a different technique based on kernel phase shifts which we have found to show substantially better results. Implementation of these algorithms utilizes texture-mapping hardware to run in real time, which allows them to be included in interactive applications.<<ETX>>","AuthorNamesDeduped":"Lisa K. Forssell","AuthorNames":"L.K. Forssell","AuthorAffiliation":"Comput. Sci. Corp., NASA Ames Res. Center, Moffett Field, CA, USA","InternalReferences":"10.1109/VISUAL.1992.235227;10.1109/VISUAL.1990.146360;10.1109/VISUAL.1991.175771;10.1109/VISUAL.1992.235210;10.1109/VISUAL.1990.146359;10.1109/VISUAL.1993.398846;10.1109/VISUAL.1993.398850;10.1109/VISUAL.1991.175773;10.1109/VISUAL.1992.235226","AuthorKeywords":"","AminerCitationCount022019":"120","XPloreCitationCount022019":"28","PubsCited":"17","Award":""}},{"name":"Gerik Scheuermann","value":560,"numPapers":147,"cluster":"6","visible":1,"index":143,"weight":54,"x":290.5364645858611,"y":454.33199756143864,"px":295.7800273409425,"py":454.2709918509734,"node":{"Conference":"Vis","Year":"1997","Title":"Visualization of higher order singularities in vector fields","DOI":"10.1109/VISUAL.1997.663858","Link":"http://dx.doi.org/10.1109/VISUAL.1997.663858","FirstPage":"67","LastPage":"74","PaperType":"C","Abstract":"Presents an algorithm for the visualization of vector field topology based on Clifford algebra. It allows the detection of higher-order singularities. This is accomplished by first analysing the possible critical points and then choosing a suitable polynomial approximation, because conventional methods based on piecewise linear or bilinear approximation do not allow higher-order critical points and destroy the topology in such cases. The algorithm is still very fast, because of using linear approximation outside the areas with several critical points.","AuthorNamesDeduped":"Gerik Scheuermann;Hans Hagen;Heinz Krüger;Martin Menzel;Alyn P. Rockwood","AuthorNames":"G. Scheuermann;H. Hagen;H. Kruger;M. Menzel;A. Rockwood","AuthorAffiliation":"Dept. of Comput. Sci., Kaiserslautern Univ., Germany","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"93","XPloreCitationCount022019":"17","PubsCited":"7","Award":""}},{"name":"Al Globus","value":129,"numPapers":2,"cluster":"6","visible":1,"index":144,"weight":4,"x":180.2952817917653,"y":515.0937232448232,"px":187.4395288991224,"py":513.1570514960688,"node":{"Conference":"Vis","Year":"1990","Title":"FAST: a multi-processed environment for visualization of computational fluid dynamics","DOI":"10.1109/VISUAL.1990.146360","Link":"http://dx.doi.org/10.1109/VISUAL.1990.146360","FirstPage":"14","LastPage":"27, 461-2","PaperType":"C","Abstract":"The authors discuss FAST (flow analysis software toolkit), an implementation of a software system for fluid mechanics analysis. Visualization of computational aerodynamics requires flexible, extensible, and adaptable software tools for performing analysis tasks. An overview of FAST is given, and its architecture is discussed. Interactive visualization control is addressed. The advantages and disadvantages of FAST are discussed.<<ETX>>","AuthorNamesDeduped":"Gordon V. Bancroft;Fergus Merritt;Todd Plessel;Paul G. Kelaita;R. Kevin McCabe;Al Globus","AuthorNames":"G.V. Bancroft;F.J. Merritt;T.C. Plessel;P.G. Kelaita;R.K. McCabe;A. Globus","AuthorAffiliation":"Sterling Federal Syst. Inc., Palo Alto, CA, USA;Sterling Federal Syst. Inc., Palo Alto, CA, USA;Sterling Federal Syst. Inc., Palo Alto, CA, USA;Sterling Federal Syst. Inc., Palo Alto, CA, USA;Sterling Federal Syst. Inc., Palo Alto, CA, USA;Sterling Federal Syst. Inc., Palo Alto, CA, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"31","XPloreCitationCount022019":"29","PubsCited":"20","Award":""}},{"name":"T. Lasinski","value":89,"numPapers":2,"cluster":"6","visible":1,"index":145,"weight":3,"x":189.68499311027998,"y":582.0636005847139,"px":196.79107385057392,"py":578.9338903431117,"node":{"Conference":"Vis","Year":"1990","Title":"FAST: a multi-processed environment for visualization of computational fluid dynamics","DOI":"10.1109/VISUAL.1990.146360","Link":"http://dx.doi.org/10.1109/VISUAL.1990.146360","FirstPage":"14","LastPage":"27, 461-2","PaperType":"C","Abstract":"The authors discuss FAST (flow analysis software toolkit), an implementation of a software system for fluid mechanics analysis. Visualization of computational aerodynamics requires flexible, extensible, and adaptable software tools for performing analysis tasks. An overview of FAST is given, and its architecture is discussed. Interactive visualization control is addressed. The advantages and disadvantages of FAST are discussed.<<ETX>>","AuthorNamesDeduped":"Gordon V. Bancroft;Fergus Merritt;Todd Plessel;Paul G. Kelaita;R. Kevin McCabe;Al Globus","AuthorNames":"G.V. Bancroft;F.J. Merritt;T.C. Plessel;P.G. Kelaita;R.K. McCabe;A. Globus","AuthorAffiliation":"Sterling Federal Syst. Inc., Palo Alto, CA, USA;Sterling Federal Syst. Inc., Palo Alto, CA, USA;Sterling Federal Syst. Inc., Palo Alto, CA, USA;Sterling Federal Syst. Inc., Palo Alto, CA, USA;Sterling Federal Syst. Inc., Palo Alto, CA, USA;Sterling Federal Syst. Inc., Palo Alto, CA, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"31","XPloreCitationCount022019":"29","PubsCited":"20","Award":""}},{"name":"Xavier Tricoche","value":329,"numPapers":83,"cluster":"6","visible":1,"index":146,"weight":35,"x":302.7403683278614,"y":509.68564890598304,"px":307.65132274975605,"py":507.5226613311954,"node":{"Conference":"Vis","Year":"1991","Title":"A tool for visualizing the topology of three-dimensional vector fields","DOI":"10.1109/VISUAL.1991.175773","Link":"http://dx.doi.org/10.1109/VISUAL.1991.175773","FirstPage":"33","LastPage":"40, 408","PaperType":"C","Abstract":"A description is given of a software system, TOPO, that numerically analyzes and graphically displays topological aspects of a three-dimensional vector field, v, to produce a single, relatively simple picture that characterizes v. The topology of v considered consists of its critical points (where v=0), their invariant manifolds, and the integral curves connecting these invariant manifolds. The field in the neighborhood of each critical point is approximated by the Taylor expansion. The coefficients of the first nonzero term of the Taylor expansion around a critical point are the 3*3 matrix Delta v. Critical points are classified by examining Delta v's eigenvalues. The eigenvectors of Delta v span the invariant manifolds of the linearized field around a critical point. Curves integrated from initial points on the eigenvectors a small distance from a critical point connect with other critical points (or the boundary) to complete the topology. One class of critical surfaces that is important in computational fluid dynamics is analyzed.<<ETX>>","AuthorNamesDeduped":"Al Globus;Creon Levit;T. Lasinski","AuthorNames":"A. Globus;C. Levit;T. Lasinski","AuthorAffiliation":"","InternalReferences":"10.1109/VISUAL.1990.146360;10.1109/VISUAL.1990.146359","AuthorKeywords":"","AminerCitationCount022019":"296","XPloreCitationCount022019":"93","PubsCited":"44","Award":""}},{"name":"Patricia Crossno","value":184,"numPapers":24,"cluster":"5","visible":1,"index":147,"weight":3,"x":362.7576791825911,"y":654.389463424927,"px":364.88327122564516,"py":648.6912550894905,"node":{"Conference":"Vis","Year":"1994","Title":"VolVis: a diversified volume visualization system","DOI":"10.1109/VISUAL.1994.346340","Link":"http://dx.doi.org/10.1109/VISUAL.1994.346340","FirstPage":"31","LastPage":"38, C3","PaperType":"C","Abstract":"VolVis is a diversified, easy to use, extensible, high performance, and portable volume visualization system for scientists and engineers as well as for visualization developers and researchers. VolVis accepts as input 3D scalar volumetric data as well as 3D volume-sampled and classical geometric models. Interaction with the data is controlled by a variety of 3D input devices in an input device-independent environment. VolVis output includes navigation preview, static images, and animation sequences. A variety of volume rendering algorithms are supported ranging from fast rough approximations, to compression-domain rendering, to accurate volumetric ray tracing and radiosity, and irregular grid rendering.<<ETX>>","AuthorNamesDeduped":"Ricardo S. Avila;Taosong He;Lichan Hong;Arie E. Kaufman;Hanspeter Pfister;Cláudio T. Silva;Lisa M. Sobierajski;Sidney W. Wang","AuthorNames":"R. Avila;Taosong He;Lichan Hong;A. Kaufman;H. Pfister;C. Silva;L. Sobierajski;S. Wang","AuthorAffiliation":"Howard Hughes Med. Inst., State Univ. of New York, Stony Brook, NY, USA","InternalReferences":"10.1109/VISUAL.1992.235231;10.1109/VISUAL.1993.398862;10.1109/VISUAL.1993.398854;10.1109/VISUAL.1990.146391","AuthorKeywords":"","AminerCitationCount022019":"139","XPloreCitationCount022019":"30","PubsCited":"15","Award":""}},{"name":"Edward Angel","value":30,"numPapers":5,"cluster":"5","visible":1,"index":148,"weight":1,"x":176.3242530790542,"y":982.0554042956677,"px":175.66332845697482,"py":972.1843922346487,"node":{"Conference":"Vis","Year":"1993","Title":"Spray rendering: Visualization using smart particles","DOI":"10.1109/VISUAL.1993.398880","Link":"http://dx.doi.org/10.1109/VISUAL.1993.398880","FirstPage":"283","LastPage":"290","PaperType":"C","Abstract":"We propose a new framework for doing scientific visualization. The basis for this framework is a combination of particle systems and behavioral animation. Here, particles are not only affected by the field that they are in, but can also exhibit different programmed behaviors. An intuitive delivery system, based on virtual cans of spray paint, is also described to introduce the smart particles into the data set. Hence the name spray rendering. Using this metaphor, different types of spray paint are used to highlight different features in the data set. Spray rendering offers several advantages over existing methods: (1) it generalizes the current techniques of surface, volume and flow visualization under one coherent framework; (2) it works with regular and irregular grids as well as sparse and dense data sets; (3) it allows selective progressive refinement; (4) it is modular, extensible and provides scientists with the flexibility for exploring relationships in their data sets in natural and artistic ways.<<ETX>>","AuthorNamesDeduped":"Alex T. Pang;Kyle Smith","AuthorNames":"A. Pang;K. Smith","AuthorAffiliation":"Board of Studies in Comput. & Inf. Sci., California Univ., Santa Cruz, CA, USA;Board of Studies in Comput. & Inf. Sci., California Univ., Santa Cruz, CA, USA","InternalReferences":"10.1109/VISUAL.1992.235226","AuthorKeywords":"","AminerCitationCount022019":"50","XPloreCitationCount022019":"10","PubsCited":"17","Award":""}},{"name":"Tobias Preußer","value":27,"numPapers":25,"cluster":"6","visible":1,"index":149,"weight":1,"x":699.7031130425961,"y":836.0416866454516,"px":689.7563538563367,"py":830.2009793079656,"node":{"Conference":"Vis","Year":"1993","Title":"Implicit stream surfaces","DOI":"10.1109/VISUAL.1993.398875","Link":"http://dx.doi.org/10.1109/VISUAL.1993.398875","FirstPage":"245","LastPage":"252","PaperType":"C","Abstract":"Streamlines and stream surfaces are well known techniques for the visualization of fluid flow. For steady velocity fields, a streamline is the trace of a particle, and a stream surface is the trace of a curve. Here a new method is presented for the construction of stream surfaces. The central concept is the representation of a stream surface as an implicit surface f (x) = C. After the initial calculation of f a family of stream surfaces can be generated efficiently by varying C. The shapes of the originating curves are defined by the value of f at the boundary. Two techniques are presented for the calculation of f: one based on solving the convection equation, the other on backward tracing of the trajectories of grid points. The flow around objects is discussed separately. With this method irregular topologies of the originating curves and of the stream surfaces can be handled easily. Further, it can also be used for other visualization techniques, such as time surfaces and stream volumes. Finally, an effective method for the automatic placement of originating curves is presented.<<ETX>>","AuthorNamesDeduped":"Jarke J. van Wijk","AuthorNames":"J.J. van Wijk","AuthorAffiliation":"Netherlands Energy Res. Foundation, Petten, Netherlands","InternalReferences":"10.1109/VISUAL.1992.235211;10.1109/VISUAL.1992.235225;10.1109/VISUAL.1990.146359","AuthorKeywords":"","AminerCitationCount022019":"173","XPloreCitationCount022019":"40","PubsCited":"13","Award":""}},{"name":"Martin Rumpf","value":34,"numPapers":26,"cluster":"6","visible":1,"index":150,"weight":1,"x":226.80535338893444,"y":179.79576187064623,"px":230.69279880101396,"py":184.39826610013625,"node":{"Conference":"Vis","Year":"1993","Title":"Implicit stream surfaces","DOI":"10.1109/VISUAL.1993.398875","Link":"http://dx.doi.org/10.1109/VISUAL.1993.398875","FirstPage":"245","LastPage":"252","PaperType":"C","Abstract":"Streamlines and stream surfaces are well known techniques for the visualization of fluid flow. For steady velocity fields, a streamline is the trace of a particle, and a stream surface is the trace of a curve. Here a new method is presented for the construction of stream surfaces. The central concept is the representation of a stream surface as an implicit surface f (x) = C. After the initial calculation of f a family of stream surfaces can be generated efficiently by varying C. The shapes of the originating curves are defined by the value of f at the boundary. Two techniques are presented for the calculation of f: one based on solving the convection equation, the other on backward tracing of the trajectories of grid points. The flow around objects is discussed separately. With this method irregular topologies of the originating curves and of the stream surfaces can be handled easily. Further, it can also be used for other visualization techniques, such as time surfaces and stream volumes. Finally, an effective method for the automatic placement of originating curves is presented.<<ETX>>","AuthorNamesDeduped":"Jarke J. van Wijk","AuthorNames":"J.J. van Wijk","AuthorAffiliation":"Netherlands Energy Res. Foundation, Petten, Netherlands","InternalReferences":"10.1109/VISUAL.1992.235211;10.1109/VISUAL.1992.235225;10.1109/VISUAL.1990.146359","AuthorKeywords":"","AminerCitationCount022019":"173","XPloreCitationCount022019":"40","PubsCited":"13","Award":""}},{"name":"Robert Michael Kirby","value":264,"numPapers":56,"cluster":"4","visible":1,"index":151,"weight":7,"x":244.00058971526238,"y":438.43804847226954,"px":249.42259892968747,"py":437.75640591875975,"node":{"Conference":"Vis","Year":"1998","Title":"Visualizing diffusion tensor images of the mouse spinal cord","DOI":"10.1109/VISUAL.1998.745294","Link":"http://dx.doi.org/10.1109/VISUAL.1998.745294","FirstPage":"127","LastPage":"134","PaperType":"C","Abstract":"Within biological systems, water molecules undergo continuous stochastic Brownian motion. The diffusion rate can give clues to the structure of the underlying tissues. In some tissues, the rate is anisotropic. Diffusion-rate images can be calculated from diffusion-weighted MRI. A 2D diffusion tensor image (DTI) and an associated anatomical scalar field define seven values at each spatial location. We present two new methods for visually representing DTIs. The first method displays an array of ellipsoids, where the shape of each ellipsoid represents one tensor value. The ellipsoids are all normalized to approximately the same size so that they can be displayed simultaneously in context. The second method uses concepts from oil painting to represent the seven-valued data with multiple layers of varying brush strokes. Both methods successfully display most or all of the information in DTIs and provide exploratory methods for understanding them. The ellipsoid method has a simpler interpretation and explanation than the painting-motivated method; the painting-motivated method displays more of the information and is easier to read quantatively. We demonstrate the methods on images of the mouse spinal cord. The visualizations show significant differences between spinal cords from mice suffering from experimental allergic encephalomyelitis and spinal cords from wild-type mice. The differences are consistent with differences shown histologically and suggest that our new non-invasive imaging methodology and visualization of the results could have early diagnostic value for neurodegenerative diseases.","AuthorNamesDeduped":"David H. Laidlaw;Eric T. Ahrens;David Kremers;Matthew J. Avalos;Russell E. Jacobs;Carol Readhead","AuthorNames":"D.H. Laidlaw;E.T. Ahrens;D. Kremers;M.J. Avalos;R.E. Jacobs;C. Readhead","AuthorAffiliation":"California Inst. of Technol., Pasadena, CA, USA","InternalReferences":"10.1109/VISUAL.1992.235201","AuthorKeywords":"multi-valued visualization, tensor field visualization,oil painting","AminerCitationCount022019":"198","XPloreCitationCount022019":"55","PubsCited":"26","Award":""}},{"name":"David L. Kao","value":126,"numPapers":25,"cluster":"6","visible":1,"index":152,"weight":1,"x":-23.798244070925577,"y":712.9783595835231,"px":-22.71158833224683,"py":705.2799049521766,"node":{"Conference":"Vis","Year":"1995","Title":"Enhanced spot noise for vector field visualization","DOI":"10.1109/VISUAL.1995.480817","Link":"http://dx.doi.org/10.1109/VISUAL.1995.480817","FirstPage":"233","LastPage":"239, 457","PaperType":"C","Abstract":"Spot noise is a technique for texture synthesis, which is very useful for vector field visualization. This paper describes improvements and extensions of the basic principle of spot noise. First, better visualization of highly curved vector fields with spot noise is achieved, by adapting the shape of the spots to the local velocity field. Second, filtering of spots is proposed to eliminate undesired low frequency components from the spot noise texture. Third, methods are described to utilize graphics hardware to generate the texture, and to produce variable viewpoint animations of spot noise on surfaces. Fourth, the synthesis of spot noise on grids with highly irregular cell sizes is described.","AuthorNamesDeduped":"Wim C. de Leeuw;Jarke J. van Wijk","AuthorNames":"W.C. de Leeuw;J.J. van Wijk","AuthorAffiliation":"Fac. of Tech. Math. & Inf., Delft Univ. of Technol., Netherlands","InternalReferences":"10.1109/VISUAL.1994.346312;10.1109/VISUAL.1994.346313;10.1109/VISUAL.1993.398877","AuthorKeywords":"","AminerCitationCount022019":"125","XPloreCitationCount022019":"33","PubsCited":"7","Award":""}},{"name":"Raghu Machiraju","value":147,"numPapers":30,"cluster":"6","visible":1,"index":153,"weight":3,"x":300.4319722274276,"y":657.9141316000159,"px":303.72012863311755,"py":652.8315650417962,"node":{"Conference":"Vis","Year":"1994","Title":"An evaluation of reconstruction filters for volume rendering","DOI":"10.1109/VISUAL.1994.346331","Link":"http://dx.doi.org/10.1109/VISUAL.1994.346331","FirstPage":"100","LastPage":"107, C10","PaperType":"C","Abstract":"To render images from a three-dimensional array of sample values, it is necessary to interpolate between the samples. This paper is concerned with interpolation methods that are equivalent to convolving the samples with a reconstruction filter; this covers all commonly used schemes, including trilinear and cubic interpolation. We first outline the formal basis of interpolation in three-dimensional signal processing theory. We then propose numerical metrics that can be used to measure filter characteristics that are relevant to the appearance of images generated using that filter. We apply those metrics to several previously used filters and relate the results to isosurface images of the interpolations. We show that the choice of interpolation scheme can have a dramatic effect on image quality, and we discuss the cost/benefit tradeoff inherent in choosing a filter.<<ETX>>","AuthorNamesDeduped":"Steve Marschner;Richard Lobb","AuthorNames":"S.R. Marschner;R.J. Lobb","AuthorAffiliation":"Program of Comput. Graphics, Cornell Univ., Ithaca, NY, USA;Program of Comput. Graphics, Cornell Univ., Ithaca, NY, USA","InternalReferences":"10.1109/VISUAL.1993.398851","AuthorKeywords":"","AminerCitationCount022019":"372","XPloreCitationCount022019":"113","PubsCited":"19","Award":""}},{"name":"Ming Wan","value":109,"numPapers":17,"cluster":"4","visible":1,"index":154,"weight":5,"x":459.7053242435188,"y":769.5512447895624,"px":459.81994373083495,"py":761.2981128621338,"node":{"Conference":"Vis","Year":"1997","Title":"Interactive volume rendering for virtual colonoscopy","DOI":"10.1109/VISUAL.1997.663915","Link":"http://dx.doi.org/10.1109/VISUAL.1997.663915","FirstPage":"433","LastPage":"436","PaperType":"C","Abstract":"3D virtual colonoscopy has recently been proposed as a non-invasive alternative procedure for the visualization of the human colon. Surface rendering is sufficient for implementing such a procedure to obtain an overview of the interior surface of the colon at interactive rendering speeds. Unfortunately, physicians can not use it to explore tissues beneath the surface to differentiate between benign and malignant structures. In this paper, we present a direct volume rendering approach based on perspective ray casting, as a supplement to the surface navigation. To accelerate the rendering speed, surface-assistant techniques are used to adapt the resampling rates by skipping the empty space inside the colon. In addition, a parallel version of the algorithm has been implemented on a shared-memory multiprocessing architecture. Experiments have been conducted on both simulation and patient data sets.","AuthorNamesDeduped":"Suya You;Lichan Hong;Ming Wan;Kittiboon Junyaprasert;Arie E. Kaufman;Shigeru Muraki;Yong Zhou 0001;Mark Wax;Zhengrong Liang","AuthorNames":"Suya You;Lichan Hong;Ming Wan;K. Junyaprasert;A. Kaufman;S. Muraki;Yong Zhou;M. Wax;Zhengrong Liang","AuthorAffiliation":"Center for Visual Comput., State Univ. of New York, Stony Brook, NY, USA","InternalReferences":"","AuthorKeywords":"Virtual Colonoscopy,Endoscopy,Visibility,Interactive Navigation,Volume Rendering,Surface Rendering, Parallel Processing, Virtual Environment","AminerCitationCount022019":"76","XPloreCitationCount022019":"2","PubsCited":"11","Award":""}},{"name":"Zhengrong Liang","value":33,"numPapers":4,"cluster":"4","visible":1,"index":155,"weight":2,"x":451.96665421823286,"y":870.0169045083205,"px":453.1338706914345,"py":863.4698343053326,"node":{"Conference":"Vis","Year":"1997","Title":"Interactive volume rendering for virtual colonoscopy","DOI":"10.1109/VISUAL.1997.663915","Link":"http://dx.doi.org/10.1109/VISUAL.1997.663915","FirstPage":"433","LastPage":"436","PaperType":"C","Abstract":"3D virtual colonoscopy has recently been proposed as a non-invasive alternative procedure for the visualization of the human colon. Surface rendering is sufficient for implementing such a procedure to obtain an overview of the interior surface of the colon at interactive rendering speeds. Unfortunately, physicians can not use it to explore tissues beneath the surface to differentiate between benign and malignant structures. In this paper, we present a direct volume rendering approach based on perspective ray casting, as a supplement to the surface navigation. To accelerate the rendering speed, surface-assistant techniques are used to adapt the resampling rates by skipping the empty space inside the colon. In addition, a parallel version of the algorithm has been implemented on a shared-memory multiprocessing architecture. Experiments have been conducted on both simulation and patient data sets.","AuthorNamesDeduped":"Suya You;Lichan Hong;Ming Wan;Kittiboon Junyaprasert;Arie E. Kaufman;Shigeru Muraki;Yong Zhou 0001;Mark Wax;Zhengrong Liang","AuthorNames":"Suya You;Lichan Hong;Ming Wan;K. Junyaprasert;A. Kaufman;S. Muraki;Yong Zhou;M. Wax;Zhengrong Liang","AuthorAffiliation":"Center for Visual Comput., State Univ. of New York, Stony Brook, NY, USA","InternalReferences":"","AuthorKeywords":"Virtual Colonoscopy,Endoscopy,Visibility,Interactive Navigation,Volume Rendering,Surface Rendering, Parallel Processing, Virtual Environment","AminerCitationCount022019":"76","XPloreCitationCount022019":"2","PubsCited":"11","Award":""}},{"name":"Mark Wax","value":33,"numPapers":4,"cluster":"4","visible":1,"index":156,"weight":2,"x":423.54144532006956,"y":888.3400942337626,"px":421.00470787568986,"py":881.4922741957259,"node":{"Conference":"Vis","Year":"1997","Title":"Interactive volume rendering for virtual colonoscopy","DOI":"10.1109/VISUAL.1997.663915","Link":"http://dx.doi.org/10.1109/VISUAL.1997.663915","FirstPage":"433","LastPage":"436","PaperType":"C","Abstract":"3D virtual colonoscopy has recently been proposed as a non-invasive alternative procedure for the visualization of the human colon. Surface rendering is sufficient for implementing such a procedure to obtain an overview of the interior surface of the colon at interactive rendering speeds. Unfortunately, physicians can not use it to explore tissues beneath the surface to differentiate between benign and malignant structures. In this paper, we present a direct volume rendering approach based on perspective ray casting, as a supplement to the surface navigation. To accelerate the rendering speed, surface-assistant techniques are used to adapt the resampling rates by skipping the empty space inside the colon. In addition, a parallel version of the algorithm has been implemented on a shared-memory multiprocessing architecture. Experiments have been conducted on both simulation and patient data sets.","AuthorNamesDeduped":"Suya You;Lichan Hong;Ming Wan;Kittiboon Junyaprasert;Arie E. Kaufman;Shigeru Muraki;Yong Zhou 0001;Mark Wax;Zhengrong Liang","AuthorNames":"Suya You;Lichan Hong;Ming Wan;K. Junyaprasert;A. Kaufman;S. Muraki;Yong Zhou;M. Wax;Zhengrong Liang","AuthorAffiliation":"Center for Visual Comput., State Univ. of New York, Stony Brook, NY, USA","InternalReferences":"","AuthorKeywords":"Virtual Colonoscopy,Endoscopy,Visibility,Interactive Navigation,Volume Rendering,Surface Rendering, Parallel Processing, Virtual Environment","AminerCitationCount022019":"76","XPloreCitationCount022019":"2","PubsCited":"11","Award":""}},{"name":"Steven G. Parker","value":77,"numPapers":5,"cluster":"4","visible":1,"index":157,"weight":1,"x":470.5006742170745,"y":953.6829365357379,"px":468.8564326209614,"py":947.2118371554121,"node":{"Conference":"Vis","Year":"1998","Title":"Interactive ray tracing for isosurface rendering","DOI":"10.1109/VISUAL.1998.745713","Link":"http://dx.doi.org/10.1109/VISUAL.1998.745713","FirstPage":"233","LastPage":"238","PaperType":"C","Abstract":"We show that it is feasible to perform interactive isosurfacing of very large rectilinear datasets with brute-force ray tracing on a conventional (distributed) shared-memory multiprocessor machine. Rather than generate geometry representing the isosurface and render with a z-buffer, for each pixel we trace a ray through a volume and do an analytic isosurface intersection computation. Although this method has a high intrinsic computational cost, its simplicity and scalability make it ideal for large datasets on current high-end systems. Incorporating simple optimizations, such as volume bricking and a shallow hierarchy, enables interactive rendering (i.e. 10 frames per second) of the 1 GByte full resolution Visible Woman dataset on an SGI Reality Monster. The graphics capabilities of the Reality Monster are used only for display of the final color image.","AuthorNamesDeduped":"Steven G. Parker;Peter Shirley;Yarden Livnat;Charles D. Hansen;Peter-Pike J. Sloan","AuthorNames":"S. Parker;P. Shirley;Y. Livnat;C. Hansen;P.-P. Sloan","AuthorAffiliation":"Dept. of Comput. Sci., Utah Univ., Salt Lake City, UT, USA","InternalReferences":"10.1109/VISUAL.1997.663888;10.1109/VISUAL.1994.346331;10.1109/VISUAL.1994.346320;10.1109/VISUAL.1995.485154;10.1109/VISUAL.1998.745300","AuthorKeywords":"","AminerCitationCount022019":"391","XPloreCitationCount022019":"94","PubsCited":"17","Award":"BP"}},{"name":"Peter-Pike J. Sloan","value":77,"numPapers":5,"cluster":"4","visible":1,"index":158,"weight":1,"x":435.0872703334978,"y":955.9849564854073,"px":435.0310416690627,"py":949.8739623575793,"node":{"Conference":"Vis","Year":"1998","Title":"Interactive ray tracing for isosurface rendering","DOI":"10.1109/VISUAL.1998.745713","Link":"http://dx.doi.org/10.1109/VISUAL.1998.745713","FirstPage":"233","LastPage":"238","PaperType":"C","Abstract":"We show that it is feasible to perform interactive isosurfacing of very large rectilinear datasets with brute-force ray tracing on a conventional (distributed) shared-memory multiprocessor machine. Rather than generate geometry representing the isosurface and render with a z-buffer, for each pixel we trace a ray through a volume and do an analytic isosurface intersection computation. Although this method has a high intrinsic computational cost, its simplicity and scalability make it ideal for large datasets on current high-end systems. Incorporating simple optimizations, such as volume bricking and a shallow hierarchy, enables interactive rendering (i.e. 10 frames per second) of the 1 GByte full resolution Visible Woman dataset on an SGI Reality Monster. The graphics capabilities of the Reality Monster are used only for display of the final color image.","AuthorNamesDeduped":"Steven G. Parker;Peter Shirley;Yarden Livnat;Charles D. Hansen;Peter-Pike J. Sloan","AuthorNames":"S. Parker;P. Shirley;Y. Livnat;C. Hansen;P.-P. Sloan","AuthorAffiliation":"Dept. of Comput. Sci., Utah Univ., Salt Lake City, UT, USA","InternalReferences":"10.1109/VISUAL.1997.663888;10.1109/VISUAL.1994.346331;10.1109/VISUAL.1994.346320;10.1109/VISUAL.1995.485154;10.1109/VISUAL.1998.745300","AuthorKeywords":"","AminerCitationCount022019":"391","XPloreCitationCount022019":"94","PubsCited":"17","Award":"BP"}},{"name":"Stephen C. North","value":176,"numPapers":40,"cluster":"2","visible":1,"index":159,"weight":3,"x":475.61452865998314,"y":150.99786226781896,"px":482.5819229589073,"py":158.05144670897946,"node":{"Conference":"Vis","Year":"1998","Title":"The Gridfit algorithm: an efficient and effective approach to visualizing large amounts of spatial data","DOI":"10.1109/VISUAL.1998.745301","Link":"http://dx.doi.org/10.1109/VISUAL.1998.745301","FirstPage":"181","LastPage":"188","PaperType":"C","Abstract":"In a large number of applications, data is collected and referenced by their spatial locations. Visualizing large amounts of spatially referenced data on a limited-size screen display often results in poor visualizations due to the high degree of overplotting of neighboring datapoints. We introduce a new approach to visualizing large amounts of spatially referenced data. The basic idea is to intelligently use the unoccupied pixels of the display instead of overplotting data points. After formally describing the problem, we present two solutions which are based on: placing overlapping data points on the nearest unoccupied pixel; and shifting data points along a screen-filling curve (e.g., Hilbert-curve). We then develop a more sophisticated approach called Gridfit, which is based on a hierarchical partitioning of the data space. We evaluate all three approaches with respect to their efficiency and effectiveness and show the superiority of the Gridfit approach. For measuring the effectiveness, we not only present the resulting visualizations but also introduce mathematical effectiveness criteria measuring properties of the generated visualizations with respect to the original data such as distance- and position-preservation.","AuthorNamesDeduped":"Daniel A. Keim;Annemarie Herrmann","AuthorNames":"D.A. Keim;A. Herrmann","AuthorAffiliation":"Inst. of Comput. Sci., Halle-Wittenberg Univ., Halle, Germany","InternalReferences":"10.1109/VISUAL.1995.485139;10.1109/INFVIS.1995.528688;10.1109/VISUAL.1991.175794;10.1109/VISUAL.1990.146387;10.1109/VISUAL.1990.146402;10.1109/VISUAL.1993.398870;10.1109/VISUAL.1995.485140;10.1109/VISUAL.1994.346302;10.1109/INFVIS.1995.528690;10.1109/VISUAL.1990.146386","AuthorKeywords":"visualizing large data sets, visualizing spatially referenced data, visualizing geographical data, interfaces to databases","AminerCitationCount022019":"66","XPloreCitationCount022019":"13","PubsCited":"34","Award":""}},{"name":"Heidrun Schumann","value":194,"numPapers":60,"cluster":"5","visible":1,"index":160,"weight":2,"x":845.3919043312985,"y":375.3056430885479,"px":837.9000653518211,"py":375.75883942708145,"node":{"Conference":"Vis","Year":"1990","Title":"Parallel coordinates: a tool for visualizing multi-dimensional geometry","DOI":"10.1109/VISUAL.1990.146402","Link":"http://dx.doi.org/10.1109/VISUAL.1990.146402","FirstPage":"361","LastPage":"378","PaperType":"C","Abstract":"A methodology for visualizing analytic and synthetic geometry in R/sup N/ is presented. It is based on a system of parallel coordinates which induces a nonprojective mapping between N-dimensional and two-dimensional sets. Hypersurfaces are represented by their planar images which have some geometrical properties analogous to the properties of the hypersurface that they represent. A point from to line duality when N=2 generalizes to lines and hyperplanes enabling the representation of polyhedra in R/sup N/. The representation of a class of convex and non-convex hypersurfaces is discussed, together with an algorithm for constructing and displaying any interior point. The display shows some local properties of the hypersurface and provides information on the point's proximity to the boundary. Applications are discussed.<<ETX>>","AuthorNamesDeduped":"Alfred Inselberg;Bernard Dimsdale","AuthorNames":"A. Inselberg;B. Dimsdale","AuthorAffiliation":"IBM Sci. Center, Los Angeles, CA, USA;IBM Sci. Center, Los Angeles, CA, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"920","XPloreCitationCount022019":"308","PubsCited":"47","Award":""}},{"name":"John T. Stasko","value":1589,"numPapers":170,"cluster":"0","visible":1,"index":161,"weight":125,"x":539.0077596700141,"y":275.0158319508456,"px":542.2444403717884,"py":282.4017174149854,"node":{"Conference":"Vis","Year":"1994","Title":"Strata-various: multi-layer visualization of dynamics in software system behavior","DOI":"10.1109/VISUAL.1994.346322","Link":"http://dx.doi.org/10.1109/VISUAL.1994.346322","FirstPage":"172","LastPage":"178, C19","PaperType":"C","Abstract":"Current software visualization tools are inadequate for understanding, debugging, and tuning realistically complex applications. These tools often present only static structure, or they present dynamics from only a few of the many layers of a program and its underlying system. This paper introduces \"PV\", a prototype program visualization system which provides concurrent visual presentation of behavior from all layers, including: the program itself, user-level libraries, the operating system, and the hardware, as this behavior unfolds over time. PV juxtaposes views from different layers in order to facilitate visual correlation, and allows these views to be navigated in a coordinated fashion. This results in an extremely powerful mechanism for exploring application behavior. Experience is presented from actual use of PV in production settings with programmers facing real deadlines and serious performance problems.<<ETX>>","AuthorNamesDeduped":"Doug Kimelman;Bryan S. Rosenburg;Tova Roth","AuthorNames":"D. Kimelman;B. Rosenburg;T. Roth","AuthorAffiliation":"IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA;IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA;IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"50","XPloreCitationCount022019":"15","PubsCited":"18","Award":""}},{"name":"Wendy Cowley","value":86,"numPapers":13,"cluster":"2","visible":1,"index":162,"weight":2,"x":870.9464568759417,"y":202.2216469098951,"px":865.8104560190826,"py":204.1112627169735,"node":{"Conference":"InfoVis","Year":"1998","Title":"Visualizing decision table classifiers","DOI":"10.1109/INFVIS.1998.729565","Link":"http://dx.doi.org/10.1109/INFVIS.1998.729565","FirstPage":"102","LastPage":"105, 157","PaperType":"C","Abstract":"Decision tables, like decision trees or neural nets, are classification models used for prediction. They are induced by machine learning algorithms. A decision table consists of a hierarchical table in which each entry in a higher level table gets broken down by the values of a pair of additional attributes to form another table. The structure is similar to dimensional stacking. A visualization method is presented that allows a model based on many attributes to be understood even by those unfamiliar with machine learning. Various forms of interaction are used to make this visualization more useful than other static designs.","AuthorNamesDeduped":"Barry G. Becker","AuthorNames":"B.G. Becker","AuthorAffiliation":"Silicon Graphics Inc., Mountain View, CA, USA","InternalReferences":"10.1109/VISUAL.1990.146386","AuthorKeywords":"","AminerCitationCount022019":"","XPloreCitationCount022019":"7","PubsCited":"12","Award":""}},{"name":"Elizabeth Jurrus","value":47,"numPapers":11,"cluster":"2","visible":1,"index":163,"weight":1,"x":758.5783488135803,"y":-132.72328497438744,"px":751.4152741734592,"py":-127.55181544103917,"node":{"Conference":"InfoVis","Year":"1998","Title":"Visualizing decision table classifiers","DOI":"10.1109/INFVIS.1998.729565","Link":"http://dx.doi.org/10.1109/INFVIS.1998.729565","FirstPage":"102","LastPage":"105, 157","PaperType":"C","Abstract":"Decision tables, like decision trees or neural nets, are classification models used for prediction. They are induced by machine learning algorithms. A decision table consists of a hierarchical table in which each entry in a higher level table gets broken down by the values of a pair of additional attributes to form another table. The structure is similar to dimensional stacking. A visualization method is presented that allows a model based on many attributes to be understood even by those unfamiliar with machine learning. Various forms of interaction are used to make this visualization more useful than other static designs.","AuthorNamesDeduped":"Barry G. Becker","AuthorNames":"B.G. Becker","AuthorAffiliation":"Silicon Graphics Inc., Mountain View, CA, USA","InternalReferences":"10.1109/VISUAL.1990.146386","AuthorKeywords":"","AminerCitationCount022019":"","XPloreCitationCount022019":"7","PubsCited":"12","Award":""}},{"name":"T. J. Jankun-Kelly","value":114,"numPapers":32,"cluster":"5","visible":1,"index":164,"weight":1,"x":388.67826907184855,"y":804.851152262864,"px":391.2874551620203,"py":798.4829104843845,"node":{"Conference":"Vis","Year":"1999","Title":"Image graphs-a novel approach to visual data exploration","DOI":"10.1109/VISUAL.1999.809871","Link":"http://dx.doi.org/10.1109/VISUAL.1999.809871","FirstPage":"81","LastPage":"88","PaperType":"C","Abstract":"For types of data visualization where the cost of producing images is high, and the relationship between the rendering parameters and the image produced is less than obvious, a visual representation of the exploration process can make the process more efficient and effective. Image graphs represent not only the results but also the process of data visualization. Each node in an image graph consists of an image and the corresponding visualization parameters used to produce it. Each edge in a graph shows the change in rendering parameters between the two nodes it connects. Image graphs are not just static representations; users can interact with a graph to review a previous visualization session or to perform new rendering. Operations which cause changes in rendering parameters can propagate through the graph. The user can take advantage of the information in image graphs to understand how certain parameter changes affect visualization results. Users can also share image graphs to streamline the process of collaborative visualization. We have implemented a volume visualization system using the image graph interface, and the examples presented come from this application.","AuthorNamesDeduped":"Kwan-Liu Ma","AuthorNames":"Kwan-Liu Ma","AuthorAffiliation":"California Univ., Davis, CA, USA","InternalReferences":"10.1109/VISUAL.1995.480821;10.1109/VISUAL.1996.568113","AuthorKeywords":"knowledge representations, scientific visualization, visualization systems, volume rendering","AminerCitationCount022019":"126","XPloreCitationCount022019":"29","PubsCited":"13","Award":""}},{"name":"Martin Kraus","value":192,"numPapers":22,"cluster":"4","visible":1,"index":165,"weight":12,"x":363.04982485597645,"y":357.0899729663593,"px":367.45518973357616,"py":358.8327373805006,"node":{"Conference":"Vis","Year":"1993","Title":"Flow volumes for interactive vector field visualization","DOI":"10.1109/VISUAL.1993.398846","Link":"http://dx.doi.org/10.1109/VISUAL.1993.398846","FirstPage":"19","LastPage":"24","PaperType":"C","Abstract":"Flow volumes are the volumetric equivalent of stream lines. They provide more information about the vector field being visualized than do stream lines or ribbons. Presented is an efficient method for producing flow volumes, composed of transparently rendered tetrahedra, for use in an interactive system. The problems of rendering, subdivision, sorting, composing artifacts, and user interaction are dealt with. Efficiency comes from rendering only the volume of the smoke, and using hardware texturing and compositing.<<ETX>>","AuthorNamesDeduped":"Nelson L. Max;Barry G. Becker;Roger Crawfis","AuthorNames":"N. Max;B. Becker;R. Crawfis","AuthorAffiliation":"Lawrence Livermore Nat. Lab., Livermore, CA, USA;Lawrence Livermore Nat. Lab., Livermore, CA, USA;Lawrence Livermore Nat. Lab., Livermore, CA, USA","InternalReferences":"10.1109/VISUAL.1992.235210;10.1109/VISUAL.1992.235211","AuthorKeywords":"","AminerCitationCount022019":"148","XPloreCitationCount022019":"33","PubsCited":"13","Award":""}},{"name":"Min Chen","value":351,"numPapers":103,"cluster":"2","visible":1,"index":166,"weight":16,"x":418.75379525925877,"y":394.5774739796547,"px":421.81555109290406,"py":395.3510383271162,"node":{"Conference":"Vis","Year":"2000","Title":"Pen-and-ink rendering in volume visualisation","DOI":"10.1109/VISUAL.2000.885696","Link":"http://dx.doi.org/10.1109/VISUAL.2000.885696","FirstPage":"203","LastPage":"210","PaperType":"C","Abstract":"Concerns the development of non-photorealistic rendering techniques for volume visualisation. In particular, we present two pen-and-ink rendering methods, a 3D method based on non-photorealistic solid textures, and a 2/sup +/D method that involves two rendering phases in the object space and the image space respectively. As both techniques utilize volume- and image-based data representations, they can be built upon a traditional volume rendering pipeline, and can be integrated with the photorealistic methods available in such a pipeline. We demonstrate that such an integration facilitates an effective mechanism for enhancing visualisation and its interpretation.","AuthorNamesDeduped":"Steve M. F. Treavett;Min Chen","AuthorNames":"S.M.F. Treavett;M. Chen","AuthorAffiliation":"Dept. of Comput. Sci., Univ. of Wales, Swansea, UK","InternalReferences":"10.1109/VISUAL.1996.568110","AuthorKeywords":"Volume rendering, non-photorealistic rendering, pen-and-ink rendering, 3D texture mapping","AminerCitationCount022019":"75","XPloreCitationCount022019":"24","PubsCited":"35","Award":""}},{"name":"Lukas Mroz","value":42,"numPapers":18,"cluster":"4","visible":1,"index":167,"weight":2,"x":466.5085386107315,"y":732.8513131596966,"px":468.527855884395,"py":724.259326977799,"node":{"Conference":"Vis","Year":"1998","Title":"High quality rendering of attributed volume data","DOI":"10.1109/VISUAL.1998.745311","Link":"http://dx.doi.org/10.1109/VISUAL.1998.745311","FirstPage":"255","LastPage":"262","PaperType":"C","Abstract":"For high quality rendering of objects segmented from tomographic volume data the precise location of the boundaries of adjacent objects in subvoxel resolution is required. We describe a new method that determines the membership of a given sample point to an object by reclassifying the sample point using interpolation of the original intensity values and searching for the best fitting object in the neighbourhood. Using a ray-casting approach we then compute the surface location between successive sample points along the viewing-ray by interpolation or bisection. The accurate calculation of the object boundary enables a much more precise computation of the gray-level-gradient yielding the surface normal. Our new approach significantly improves the quality of reconstructed and shaded surfaces and reduces aliasing artifacts for animations and magnified views. We illustrate the results on different cases including the Visible-Human-Data, where we achieve nearly photo-realistic images.","AuthorNamesDeduped":"Ulf Tiede;Thomas Schiemann;Karl Heinz Höhne","AuthorNames":"U. Tiede;T. Schiemann;K.H. Hohne","AuthorAffiliation":"Inst. of Math. & Comput. Sci. in Med., Eppendorf Univ. Hosp., Hamburg, Germany","InternalReferences":"","AuthorKeywords":"partial-volume-effect, ray-casting, tomographic data,Visible-Human-Project","AminerCitationCount022019":"143","XPloreCitationCount022019":"37","PubsCited":"15","Award":""}},{"name":"Jian Huang","value":35,"numPapers":6,"cluster":"4","visible":1,"index":168,"weight":1,"x":24.64624991230633,"y":370.56309930783794,"px":32.87310717071659,"py":372.9404424859076,"node":{"Conference":"Vis","Year":"1999","Title":"Splatting without the blur","DOI":"10.1109/VISUAL.1999.809909","Link":"http://dx.doi.org/10.1109/VISUAL.1999.809909","FirstPage":"363","LastPage":"544","PaperType":"C","Abstract":"Splatting is a volume rendering algorithm that combines efficient volume projection with a sparse data representation. Only voxels that have values inside the iso-range need to be considered, and these voxels can be projected via efficient rasterization schemes. In splatting, each projected voxel is represented as a radially symmetric interpolation kernel, equivalent to a fuzzy ball. Projecting such a basis function leaves a fuzzy impression, called a footprint or splat, on the screen. Splatting traditionally classifies and shades the voxels prior to projection, and thus each voxel footprint is weighted by the assigned voxel color and opacity. Projecting these fuzzy color balls provides a uniform screen image for homogeneous object regions, but leads to a blurry appearance of object edges. The latter is clearly undesirable, especially when the view is zoomed on the object. In this work, we manipulate the rendering pipeline of splatting by performing the classification and shading process after the voxels have been projected onto the screen. In this way volume contributions outside the iso-range never affect the image. Since shading requires gradients, we not only splat the density volume, using regular splats, but we also project the gradient volume, using gradient splats. However alternative to gradient splats, we can also compute the gradients on the projection plane using central differencing. This latter scheme cuts the number of footprint rasterization by a factor of four since only the voxel densities have to be projected.","AuthorNamesDeduped":"Klaus Mueller;Torsten Möller;Roger Crawfis","AuthorNames":"K. Mueller;T. Moller;R. Crawlis","AuthorAffiliation":"Dept. of Comput. & Inf. Sci., Ohio State Univ., Columbus, OH, USA","InternalReferences":"10.1109/VISUAL.1998.745713;10.1109/VISUAL.1998.745311;10.1109/VISUAL.1996.567608;10.1109/VISUAL.1997.663848;10.1109/VISUAL.1998.745309;10.1109/VISUAL.1993.398877;10.1109/VISUAL.1994.346340","AuthorKeywords":"","AminerCitationCount022019":"126","XPloreCitationCount022019":"27","PubsCited":"35","Award":""}},{"name":"Rephael Wenger","value":52,"numPapers":27,"cluster":"6","visible":1,"index":169,"weight":2,"x":115.00576919488763,"y":525.5894799777516,"px":123.07602688809494,"py":523.3587060213205,"node":{"Conference":"Vis","Year":"1992","Title":"Four-dimensional views of 3D scalar fields","DOI":"10.1109/VISUAL.1992.235222","Link":"http://dx.doi.org/10.1109/VISUAL.1992.235222","FirstPage":"84","LastPage":"91","PaperType":"C","Abstract":"Scalar functions of three variables, w=f(x, y, z), are common in many types of scientific and medical applications. Such 3D scalar fields can be understood as elevation maps in four dimensions, with three independent variables (x, y, z) and a fourth, dependent, variable w that corresponds to the elevations. It is shown how techniques developed originally for the display of 3-manifolds in 4D Euclidean space can be adapted to visualize 3D scalar fields in a variety of ways.<<ETX>>","AuthorNamesDeduped":"Andrew J. Hanson;Pheng-Ann Heng","AuthorNames":"A.J. Hanson;P.A. Heng","AuthorAffiliation":"CERN, Geneva, Switzerland","InternalReferences":"10.1109/VISUAL.1990.146363;10.1109/VISUAL.1991.175821;10.1109/VISUAL.1990.146391","AuthorKeywords":"","AminerCitationCount022019":"37","XPloreCitationCount022019":"15","PubsCited":"17","Award":""}},{"name":"Alyn P. Rockwood","value":49,"numPapers":2,"cluster":"6","visible":1,"index":170,"weight":2,"x":150.57680952984592,"y":658.3602459837431,"px":157.34640685741516,"py":653.6136909857938,"node":{"Conference":"Vis","Year":"1990","Title":"Accurate display of tensor product isosurfaces","DOI":"10.1109/VISUAL.1990.146401","Link":"http://dx.doi.org/10.1109/VISUAL.1990.146401","FirstPage":"353","LastPage":"360, 489","PaperType":"C","Abstract":"A general method for rendering isosurfaces of multivariate rational and polynomial tensor products is described. The method is robust up to degree 15, handling singularities without introducing spurious rendering artifacts. The approach does not solve the problem of singularities in general, but it removes the problem from the rendering domain to the interpolation/approximation domain. It is based on finding real roots of a polynomial in Bernstein form. This makes it particularly suitable for parallel and pipelined processing. It is envisioned that the tensor products will be used as approximants or interpolants for empirical data or scalar fields. An interpolation scheme is given as an example.<<ETX>>","AuthorNamesDeduped":"Alyn P. Rockwood","AuthorNames":"A. Rockwood","AuthorAffiliation":"Silicon Graphics Comput. Syst., Mountain View, CA, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"14","XPloreCitationCount022019":"5","PubsCited":"19","Award":""}},{"name":"Huub van de Wetering","value":272,"numPapers":29,"cluster":"5","visible":1,"index":171,"weight":10,"x":599.297513226096,"y":512.0704408561307,"px":599.2691971646082,"py":509.46740879610354,"node":{"Conference":"Vis","Year":"1991","Title":"Tree-maps: a space-filling approach to the visualization of hierarchical information structures","DOI":"10.1109/VISUAL.1991.175815","Link":"http://dx.doi.org/10.1109/VISUAL.1991.175815","FirstPage":"284","LastPage":"291","PaperType":"C","Abstract":"A method for visualizing hierarchically structured information is described. The tree-map visualization technique makes 100% use of the available display space, mapping the full hierarchy onto a rectangular region in a space-filling manner. This efficient use of space allows very large hierarchies to be displayed in their entirety and facilitates the presentation of semantic information. Tree-maps can depict both the structure and content of the hierarchy. However, the approach is best suited to hierarchies in which the content of the leaf nodes and the structure of the hierarchy are of primary importance, and the content information associated with internal nodes is largely derived from their children.<<ETX>>","AuthorNamesDeduped":"Brian Johnson;Ben Shneiderman","AuthorNames":"B. Johnson;B. Shneiderman","AuthorAffiliation":"Dept. of Comput. Sci., Maryland Univ., College Park, MD, USA;Dept. of Comput. Sci., Maryland Univ., College Park, MD, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"1791","XPloreCitationCount022019":"351","PubsCited":"23","Award":""}},{"name":"Matthias Zwicker","value":39,"numPapers":14,"cluster":"4","visible":1,"index":172,"weight":4,"x":358.0269846760708,"y":481.1785702840558,"px":362.4184081794003,"py":478.0834946290955,"node":{"Conference":"Vis","Year":"1995","Title":"Splatting of curvilinear volumes","DOI":"10.1109/VISUAL.1995.480796","Link":"http://dx.doi.org/10.1109/VISUAL.1995.480796","FirstPage":"61","LastPage":"68, 439","PaperType":"C","Abstract":"The paper presents a splatting algorithm for volume rendering of curvilinear grids. A stochastic sampling technique called Poisson sphere/ellipsoid sampling is employed to adaptively resample a curvilinear grid with a set of randomly distributed points whose energy support extents are well approximated by spheres and ellipsoids. Filter kernels corresponding to these spheres and ellipsoids are used to generate the volume rendered image of the curvilinear grid with a conventional footprint evaluation algorithm. Experimental results show that our approach can be regarded as an alternative to existing fast volume rendering techniques of curvilinear grids.","AuthorNamesDeduped":"Xiaoyang Mao;Lichan Hong;Arie E. Kaufman","AuthorNames":"Xiaoyang Mao;Lichan Hong;A. Kaufman","AuthorAffiliation":"Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA;Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA;Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA","InternalReferences":"10.1109/VISUAL.1992.235228;10.1109/VISUAL.1993.398853;10.1109/VISUAL.1994.346340","AuthorKeywords":"","AminerCitationCount022019":"50","XPloreCitationCount022019":"12","PubsCited":"24","Award":""}},{"name":"Jeroen van Baar","value":33,"numPapers":5,"cluster":"4","visible":1,"index":173,"weight":1,"x":524.4132774863995,"y":879.5020578201162,"px":524.0275677595183,"py":873.1280690477072,"node":{"Conference":"Vis","Year":"1995","Title":"Splatting of curvilinear volumes","DOI":"10.1109/VISUAL.1995.480796","Link":"http://dx.doi.org/10.1109/VISUAL.1995.480796","FirstPage":"61","LastPage":"68, 439","PaperType":"C","Abstract":"The paper presents a splatting algorithm for volume rendering of curvilinear grids. A stochastic sampling technique called Poisson sphere/ellipsoid sampling is employed to adaptively resample a curvilinear grid with a set of randomly distributed points whose energy support extents are well approximated by spheres and ellipsoids. Filter kernels corresponding to these spheres and ellipsoids are used to generate the volume rendered image of the curvilinear grid with a conventional footprint evaluation algorithm. Experimental results show that our approach can be regarded as an alternative to existing fast volume rendering techniques of curvilinear grids.","AuthorNamesDeduped":"Xiaoyang Mao;Lichan Hong;Arie E. Kaufman","AuthorNames":"Xiaoyang Mao;Lichan Hong;A. Kaufman","AuthorAffiliation":"Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA;Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA;Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA","InternalReferences":"10.1109/VISUAL.1992.235228;10.1109/VISUAL.1993.398853;10.1109/VISUAL.1994.346340","AuthorKeywords":"","AminerCitationCount022019":"50","XPloreCitationCount022019":"12","PubsCited":"24","Award":""}},{"name":"Gordon Erlebacher","value":76,"numPapers":19,"cluster":"8","visible":1,"index":174,"weight":4,"x":309.8546071980276,"y":307.6902725030253,"px":315.2719092955626,"py":310.868100518159,"node":{"Conference":"Vis","Year":"1995","Title":"Enhanced spot noise for vector field visualization","DOI":"10.1109/VISUAL.1995.480817","Link":"http://dx.doi.org/10.1109/VISUAL.1995.480817","FirstPage":"233","LastPage":"239, 457","PaperType":"C","Abstract":"Spot noise is a technique for texture synthesis, which is very useful for vector field visualization. This paper describes improvements and extensions of the basic principle of spot noise. First, better visualization of highly curved vector fields with spot noise is achieved, by adapting the shape of the spots to the local velocity field. Second, filtering of spots is proposed to eliminate undesired low frequency components from the spot noise texture. Third, methods are described to utilize graphics hardware to generate the texture, and to produce variable viewpoint animations of spot noise on surfaces. Fourth, the synthesis of spot noise on grids with highly irregular cell sizes is described.","AuthorNamesDeduped":"Wim C. de Leeuw;Jarke J. van Wijk","AuthorNames":"W.C. de Leeuw;J.J. van Wijk","AuthorAffiliation":"Fac. of Tech. Math. & Inf., Delft Univ. of Technol., Netherlands","InternalReferences":"10.1109/VISUAL.1994.346312;10.1109/VISUAL.1994.346313;10.1109/VISUAL.1993.398877","AuthorKeywords":"","AminerCitationCount022019":"125","XPloreCitationCount022019":"33","PubsCited":"7","Award":""}},{"name":"M. Yousuff Hussaini","value":45,"numPapers":6,"cluster":"8","visible":1,"index":175,"weight":1,"x":74.49838748267274,"y":682.4850762633564,"px":88.01159281674484,"py":686.6108837821494,"node":{"Conference":"Vis","Year":"1995","Title":"Enhanced spot noise for vector field visualization","DOI":"10.1109/VISUAL.1995.480817","Link":"http://dx.doi.org/10.1109/VISUAL.1995.480817","FirstPage":"233","LastPage":"239, 457","PaperType":"C","Abstract":"Spot noise is a technique for texture synthesis, which is very useful for vector field visualization. This paper describes improvements and extensions of the basic principle of spot noise. First, better visualization of highly curved vector fields with spot noise is achieved, by adapting the shape of the spots to the local velocity field. Second, filtering of spots is proposed to eliminate undesired low frequency components from the spot noise texture. Third, methods are described to utilize graphics hardware to generate the texture, and to produce variable viewpoint animations of spot noise on surfaces. Fourth, the synthesis of spot noise on grids with highly irregular cell sizes is described.","AuthorNamesDeduped":"Wim C. de Leeuw;Jarke J. van Wijk","AuthorNames":"W.C. de Leeuw;J.J. van Wijk","AuthorAffiliation":"Fac. of Tech. Math. & Inf., Delft Univ. of Technol., Netherlands","InternalReferences":"10.1109/VISUAL.1994.346312;10.1109/VISUAL.1994.346313;10.1109/VISUAL.1993.398877","AuthorKeywords":"","AminerCitationCount022019":"125","XPloreCitationCount022019":"33","PubsCited":"7","Award":""}},{"name":"Hamish A. Carr","value":243,"numPapers":82,"cluster":"6","visible":1,"index":176,"weight":26,"x":275.98354915764594,"y":379.74113137084487,"px":282.0207277359268,"py":382.1071617177455,"node":{"Conference":"Vis","Year":"1997","Title":"Computing the separating surface for segmented data","DOI":"10.1109/VISUAL.1997.663887","Link":"http://dx.doi.org/10.1109/VISUAL.1997.663887","FirstPage":"229","LastPage":"233","PaperType":"C","Abstract":"An algorithm for computing a triangulated surface which separates a collection of data points that have been segmented into a number of different classes is presented. The problem generalizes the concept of an isosurface which separates data points that have been segmented into only two classes: those for which data function values are above the threshold and those which are below the threshold value. The algorithm is very simple, easy to implement and applies without limit to the number of classes.","AuthorNamesDeduped":"Gregory M. Nielson;Richard Franke","AuthorNames":"G.M. Nielson;R. Franke","AuthorAffiliation":"Dept. of Comput. Sci. & Eng., Arizona State Univ., Tempe, AZ, USA","InternalReferences":"10.1109/VISUAL.1991.175782","AuthorKeywords":"","AminerCitationCount022019":"59","XPloreCitationCount022019":"20","PubsCited":"5","Award":""}},{"name":"Eric Shaffer","value":34,"numPapers":7,"cluster":"6","visible":1,"index":177,"weight":1,"x":-68.59373199311368,"y":242.28504183152256,"px":-58.567734330512415,"py":245.0990916179623,"node":{"Conference":"Vis","Year":"2001","Title":"Efficient Adaptive Simplification of Massive Meshes","DOI":"10.1109/VISUAL.2001.964503","Link":"http://doi.ieeecomputersociety.org/10.1109/VISUAL.2001.964503","FirstPage":"127","LastPage":"134","PaperType":"C","Abstract":"The growing availability of massive polygonal models, and the inability of most existing visualization tools to work with such data, has created a pressing need for memory-efficient methods capable of simplifying very large meshes. In this paper, we present a method for performing adaptive simplification of polygonal meshes that are too large to fit in-core. Our algorithm performs two passes over an input mesh. In the first pass, the model is quantized using a uniform grid, and surface information is accumulated in the form of quadrics and dual quadrics. This sampling is then used to construct a BSP-tree in which the partitioning planes are determined by the dual quadrics. In the final pass, the original vertices are clustered using the BSP-tree, yielding an adaptive approximation of the original mesh. The BSP-tree describes a natural simplification hierarchy, making it possible to generate a progressive transmission and construct level-of-detail representations. In this way, the algorithm provides some of the features associated with more expensive edge contraction methods while maintaining greater computational efficiency. In addition to performing adaptive simplification, our algorithm exhibits output-sensitive memory requirements and allows fine control over the size of the simplified mesh.","AuthorNamesDeduped":"Eric Shaffer;Michael Garland","AuthorNames":"E. Shaffer;M. Garland","AuthorAffiliation":"Dept. of Comput. Sci., Illinois Univ., Urbana, IL, USA;Dept. of Comput. Sci., Illinois Univ., Urbana, IL, USA","InternalReferences":"10.1109/VISUAL.2001.964502;10.1109/VISUAL.1998.745282;10.1109/VISUAL.1998.745314","AuthorKeywords":"surface simplification, massive meshes, quadric error metric, recursive partitioning, out-of-core simplification","AminerCitationCount022019":"181","XPloreCitationCount022019":"37","PubsCited":"24","Award":""}},{"name":"Michael Garland","value":144,"numPapers":37,"cluster":"6","visible":1,"index":178,"weight":1,"x":-114.98375047300722,"y":424.4590689788835,"px":-109.95643075370224,"py":424.13173073168025,"node":{"Conference":"Vis","Year":"1997","Title":"Simplifying polygonal models using successive mappings","DOI":"10.1109/VISUAL.1997.663908","Link":"http://dx.doi.org/10.1109/VISUAL.1997.663908","FirstPage":"395","LastPage":"402","PaperType":"C","Abstract":"We present the use of mapping functions to automatically generate levels of detail with known error bounds for polygonal models. We develop a piece-wise linear mapping function for each simplification operation and use this function to measure deviation of the new surface from both the previous level of detail and from the original surface. In addition, we use the mapping function to compute appropriate texture coordinates if the original map has texture coordinates at its vertices. Our overall algorithm uses edge collapse operations. We present rigorous procedures for the generation of local planar projections as well as for the selection of a new vertex position for the edge collapse operation. As compared to earlier methods, our algorithm is able to compute tight error bounds on surface deviation and produce an entire continuum of levels of detail with mappings between them. We demonstrate the effectiveness of our algorithm on several models: a Ford Bronco consisting of over 300 parts and 70,000 triangles, a textured lion model consisting of 49 parts and 86,000 triangles, and a textured, wrinkled torus consisting of 79,000 triangles.","AuthorNamesDeduped":"Jonathan D. Cohen;Dinesh Manocha;Marc Olano","AuthorNames":"J. Cohen;D. Manocha;M. Olano","AuthorAffiliation":"North Carolina Univ., Chapel Hill, NC, USA","InternalReferences":"","AuthorKeywords":"model simplification,levels-of-detail, surface approximation, projection, linear programming","AminerCitationCount022019":"129","XPloreCitationCount022019":"31","PubsCited":"24","Award":""}},{"name":"Michael S. Brown","value":58,"numPapers":15,"cluster":"7","visible":1,"index":179,"weight":7,"x":1016.441527660871,"y":-397.24952105567536,"px":1012.9030234951574,"py":-393.1667497685272,"node":{"Conference":"Vis","Year":"1999","Title":"Multi-projector displays using camera-based registration","DOI":"10.1109/VISUAL.1999.809883","Link":"http://dx.doi.org/10.1109/VISUAL.1999.809883","FirstPage":"161","LastPage":"522","PaperType":"C","Abstract":"Conventional projector-based display systems are typically designed around precise and regular configurations of projectors and display surfaces. While this results in rendering simplicity and speed, it also means painstaking construction and ongoing maintenance. In previously published work, we introduced a vision of projector-based displays constructed from a collection of casually-arranged projectors and display surfaces. In this paper, we present flexible yet practical methods for realizing this vision, enabling low-cost mega-pixel display systems with large physical dimensions, higher resolution, or both. The techniques afford new opportunities to build personal 3D visualization systems in offices, conference rooms, theaters, or even your living room. As a demonstration of the simplicity and effectiveness of the methods that we continue to perfect, we show in the included video that a 10-year old child can construct and calibrate a two-camera, two-projector, head-tracked display system, all in about 15 minutes.","AuthorNamesDeduped":"Ramesh Raskar;Michael S. Brown;Ruigang Yang;Wei-Chao Chen;Greg Welch;Herman Towles;W. Brent Seales;Henry Fuchs","AuthorNames":"R. Raskar;M.S. Brown;Ruigang Yang;Wei-Chao Chen;G. Welch;H. Towles;B. Scales;H. Fuchs","AuthorAffiliation":"Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA","InternalReferences":"","AuthorKeywords":"display, projection, spatially immersive display, panoramic image display, virtual environments, intensity blending, image-based modeling, depth, calibration, auto-calibration, structured light, camera-based registration","AminerCitationCount022019":"0","XPloreCitationCount022019":"125","PubsCited":"21","Award":""}},{"name":"Wei-Chao Chen","value":48,"numPapers":2,"cluster":"7","visible":1,"index":180,"weight":2,"x":1058.1589820869099,"y":-356.00191483369576,"px":1053.1256313973615,"py":-350.1689035582167,"node":{"Conference":"Vis","Year":"1999","Title":"Multi-projector displays using camera-based registration","DOI":"10.1109/VISUAL.1999.809883","Link":"http://dx.doi.org/10.1109/VISUAL.1999.809883","FirstPage":"161","LastPage":"522","PaperType":"C","Abstract":"Conventional projector-based display systems are typically designed around precise and regular configurations of projectors and display surfaces. While this results in rendering simplicity and speed, it also means painstaking construction and ongoing maintenance. In previously published work, we introduced a vision of projector-based displays constructed from a collection of casually-arranged projectors and display surfaces. In this paper, we present flexible yet practical methods for realizing this vision, enabling low-cost mega-pixel display systems with large physical dimensions, higher resolution, or both. The techniques afford new opportunities to build personal 3D visualization systems in offices, conference rooms, theaters, or even your living room. As a demonstration of the simplicity and effectiveness of the methods that we continue to perfect, we show in the included video that a 10-year old child can construct and calibrate a two-camera, two-projector, head-tracked display system, all in about 15 minutes.","AuthorNamesDeduped":"Ramesh Raskar;Michael S. Brown;Ruigang Yang;Wei-Chao Chen;Greg Welch;Herman Towles;W. Brent Seales;Henry Fuchs","AuthorNames":"R. Raskar;M.S. Brown;Ruigang Yang;Wei-Chao Chen;G. Welch;H. Towles;B. Scales;H. Fuchs","AuthorAffiliation":"Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA","InternalReferences":"","AuthorKeywords":"display, projection, spatially immersive display, panoramic image display, virtual environments, intensity blending, image-based modeling, depth, calibration, auto-calibration, structured light, camera-based registration","AminerCitationCount022019":"0","XPloreCitationCount022019":"125","PubsCited":"21","Award":""}},{"name":"Greg Welch","value":66,"numPapers":3,"cluster":"7","visible":1,"index":181,"weight":3,"x":990.6577042162779,"y":-414.9249752361651,"px":985.682013565027,"py":-410.0727564370058,"node":{"Conference":"Vis","Year":"1999","Title":"A distributed graphics system for large tiled displays","DOI":"10.1109/VISUAL.1999.809890","Link":"http://dx.doi.org/10.1109/VISUAL.1999.809890","FirstPage":"215","LastPage":"527","PaperType":"C","Abstract":"Recent interest in large displays has led to renewed development of tiled displays, which are comprised of several individual displays arranged in an array and used as one large logical display. Stanford's \"Interactive Mural\" is an example of such a display, using an overlapping four by two array of projectors that back-project onto a diffuse screen to form a 6' by 2' display area with a resolution of over 60 dpi. Writing software to make effective use of the large display space is a challenge because normal window system interaction metaphors break down. One promising approach is to switch to immersive applications; another approach, the one we are investigating, is to emulate office, conference room or studio environments which use the space to display a collection of visual material to support group activities. We describe a virtual graphics system that is designed to support multiple simultaneous rendering streams from both local and remote sites. The system abstracts the physical number of computers, graphics subsystems and projectors used to create the display. We provide performance measurements to show that the system scales well and thus supports a variety of different hardware configurations. The system is also interesting because it uses transparent \"layers\", instead of windows, to manage the screen.","AuthorNamesDeduped":"Greg Humphreys;Pat Hanrahan","AuthorNames":"G. Humphreys;P. Hanrahan","AuthorAffiliation":"Dept. of Comput. Sci., Stanford Univ., CA, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"217","XPloreCitationCount022019":"43","PubsCited":"26","Award":""}},{"name":"Herman Towles","value":86,"numPapers":7,"cluster":"7","visible":1,"index":182,"weight":4,"x":989.2225231383698,"y":-364.92200044766315,"px":983.6780606244847,"py":-359.8143214781402,"node":{"Conference":"Vis","Year":"1999","Title":"A distributed graphics system for large tiled displays","DOI":"10.1109/VISUAL.1999.809890","Link":"http://dx.doi.org/10.1109/VISUAL.1999.809890","FirstPage":"215","LastPage":"527","PaperType":"C","Abstract":"Recent interest in large displays has led to renewed development of tiled displays, which are comprised of several individual displays arranged in an array and used as one large logical display. Stanford's \"Interactive Mural\" is an example of such a display, using an overlapping four by two array of projectors that back-project onto a diffuse screen to form a 6' by 2' display area with a resolution of over 60 dpi. Writing software to make effective use of the large display space is a challenge because normal window system interaction metaphors break down. One promising approach is to switch to immersive applications; another approach, the one we are investigating, is to emulate office, conference room or studio environments which use the space to display a collection of visual material to support group activities. We describe a virtual graphics system that is designed to support multiple simultaneous rendering streams from both local and remote sites. The system abstracts the physical number of computers, graphics subsystems and projectors used to create the display. We provide performance measurements to show that the system scales well and thus supports a variety of different hardware configurations. The system is also interesting because it uses transparent \"layers\", instead of windows, to manage the screen.","AuthorNamesDeduped":"Greg Humphreys;Pat Hanrahan","AuthorNames":"G. Humphreys;P. Hanrahan","AuthorAffiliation":"Dept. of Comput. Sci., Stanford Univ., CA, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"217","XPloreCitationCount022019":"43","PubsCited":"26","Award":""}},{"name":"Henry Fuchs","value":127,"numPapers":7,"cluster":"7","visible":1,"index":183,"weight":2,"x":937.468128348334,"y":-385.20973624440904,"px":932.5003842933626,"py":-379.3737096865053,"node":{"Conference":"Vis","Year":"1991","Title":"Achieving direct volume visualization with interactive semantic region selection","DOI":"10.1109/VISUAL.1991.175778","Link":"http://dx.doi.org/10.1109/VISUAL.1991.175778","FirstPage":"58","LastPage":"65, 410","PaperType":"C","Abstract":"The authors have achieved rates as high as 15 frames per second for interactive direct visualization of 3D data by trading some function for speed, while volume rendering with a full complement of ramp classification capabilities is performed at 1.4 frames per second. These speeds have made the combination of region selection with volume rendering practical for the first time. Semantic-driven selection, rather than geometric clipping, has proved to be a natural means of interacting with 3D data. Internal organs in medical data or other regions of interest can be built from preprocessed region primitives. The resulting combined system has been applied to real 3D medical data with encouraging results.<<ETX>>","AuthorNamesDeduped":"Terry S. Yoo;Ulrich Neumann;Henry Fuchs;Stephen M. Pizer;Tim J. Cullip;John Rhoades;Ross T. Whitaker","AuthorNames":"T.S. Yoo;U. Neumann;H. Fuchs;S.M. Pizer;T. Cullip;J. Rhoades;R. Whitaker","AuthorAffiliation":"North Carolina Univ., Chapel Hill, NC, USA;North Carolina Univ., Chapel Hill, NC, USA;North Carolina Univ., Chapel Hill, NC, USA;North Carolina Univ., Chapel Hill, NC, USA;North Carolina Univ., Chapel Hill, NC, USA;North Carolina Univ., Chapel Hill, NC, USA;North Carolina Univ., Chapel Hill, NC, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"32","XPloreCitationCount022019":"10","PubsCited":"13","Award":""}},{"name":"Stefan Röttger","value":78,"numPapers":13,"cluster":"4","visible":1,"index":184,"weight":1,"x":81.96288976997661,"y":46.824954480927566,"px":88.2004041395627,"py":49.90304238766317,"node":{"Conference":"Vis","Year":"1993","Title":"Flow volumes for interactive vector field visualization","DOI":"10.1109/VISUAL.1993.398846","Link":"http://dx.doi.org/10.1109/VISUAL.1993.398846","FirstPage":"19","LastPage":"24","PaperType":"C","Abstract":"Flow volumes are the volumetric equivalent of stream lines. They provide more information about the vector field being visualized than do stream lines or ribbons. Presented is an efficient method for producing flow volumes, composed of transparently rendered tetrahedra, for use in an interactive system. The problems of rendering, subdivision, sorting, composing artifacts, and user interaction are dealt with. Efficiency comes from rendering only the volume of the smoke, and using hardware texturing and compositing.<<ETX>>","AuthorNamesDeduped":"Nelson L. Max;Barry G. Becker;Roger Crawfis","AuthorNames":"N. Max;B. Becker;R. Crawfis","AuthorAffiliation":"Lawrence Livermore Nat. Lab., Livermore, CA, USA;Lawrence Livermore Nat. Lab., Livermore, CA, USA;Lawrence Livermore Nat. Lab., Livermore, CA, USA","InternalReferences":"10.1109/VISUAL.1992.235210;10.1109/VISUAL.1992.235211","AuthorKeywords":"","AminerCitationCount022019":"148","XPloreCitationCount022019":"33","PubsCited":"13","Award":""}},{"name":"Helwig Hauser","value":916,"numPapers":204,"cluster":"3","visible":1,"index":185,"weight":74,"x":476.2498276564638,"y":424.6648124511217,"px":477.9097285976068,"py":422.67655045805435,"node":{"Conference":"Vis","Year":"1998","Title":"High quality rendering of attributed volume data","DOI":"10.1109/VISUAL.1998.745311","Link":"http://dx.doi.org/10.1109/VISUAL.1998.745311","FirstPage":"255","LastPage":"262","PaperType":"C","Abstract":"For high quality rendering of objects segmented from tomographic volume data the precise location of the boundaries of adjacent objects in subvoxel resolution is required. We describe a new method that determines the membership of a given sample point to an object by reclassifying the sample point using interpolation of the original intensity values and searching for the best fitting object in the neighbourhood. Using a ray-casting approach we then compute the surface location between successive sample points along the viewing-ray by interpolation or bisection. The accurate calculation of the object boundary enables a much more precise computation of the gray-level-gradient yielding the surface normal. Our new approach significantly improves the quality of reconstructed and shaded surfaces and reduces aliasing artifacts for animations and magnified views. We illustrate the results on different cases including the Visible-Human-Data, where we achieve nearly photo-realistic images.","AuthorNamesDeduped":"Ulf Tiede;Thomas Schiemann;Karl Heinz Höhne","AuthorNames":"U. Tiede;T. Schiemann;K.H. Hohne","AuthorAffiliation":"Inst. of Math. & Comput. Sci. in Med., Eppendorf Univ. Hosp., Hamburg, Germany","InternalReferences":"","AuthorKeywords":"partial-volume-effect, ray-casting, tomographic data,Visible-Human-Project","AminerCitationCount022019":"143","XPloreCitationCount022019":"37","PubsCited":"15","Award":""}},{"name":"Martin Hering-Bertram","value":58,"numPapers":18,"cluster":"6","visible":1,"index":186,"weight":4,"x":7.1694100939366425,"y":671.513971643742,"px":14.365085025163523,"py":667.3355617926936,"node":{"Conference":"Vis","Year":"1994","Title":"Progressive transmission of scientific data using biorthogonal wavelet transform","DOI":"10.1109/VISUAL.1994.346332","Link":"http://dx.doi.org/10.1109/VISUAL.1994.346332","FirstPage":"93","LastPage":"99, C9","PaperType":"C","Abstract":"An important issue in scientific visualization systems is the management of data sets. Most data sets in scientific visualization, whether created by measurement or simulation, are usually voluminous. The goal of data management is to reduce the storage space and the access time of these data sets to speed up the visualization process. A new progressive transmission scheme using spline biorthogonal wavelet bases is proposed in this paper. By exploiting the properties of this set of wavelet bases, a fast algorithm involving only additions and subtractions is developed. Due to the multiresolutional nature of the wavelet transform, this scheme is compatible with hierarchical-structured rendering algorithms. The formula for reconstructing the functional values in a continuous volume space is given in a simple polynomial form. Lossless compression is possible, even when using floating-point numbers. This algorithm has been applied to data from a global ocean model. The lossless compression ratio is about 1.5:1. With a compression ratio of 50:1, the reconstructed data is still of good quality. Several other wavelet bases are compared with the spline biorthogonal wavelet bases. Finally the reconstructed data is visualized using various algorithms and the results are demonstrated.<<ETX>>","AuthorNamesDeduped":"Hai Tao;Robert J. Moorhead II","AuthorNames":"Hai Tao;R.J. Moorhead","AuthorAffiliation":"NSF Eng. Res. Center for Comput. Field Simulation, Mississippi Univ., MS, USA;NSF Eng. Res. Center for Comput. Field Simulation, Mississippi Univ., MS, USA","InternalReferences":"10.1109/VISUAL.1993.398845","AuthorKeywords":"","AminerCitationCount022019":"50","XPloreCitationCount022019":"14","PubsCited":"15","Award":""}},{"name":"Mark C. Miller","value":133,"numPapers":10,"cluster":"6","visible":1,"index":187,"weight":2,"x":183.85963491332484,"y":454.9192324880628,"px":189.901779062191,"py":453.06449791657485,"node":{"Conference":"Vis","Year":"1996","Title":"Temporal continuity of levels of detail in Delaunay triangulated terrain","DOI":"10.1109/VISUAL.1996.567600","Link":"http://dx.doi.org/10.1109/VISUAL.1996.567600","FirstPage":"37","LastPage":"42","PaperType":"C","Abstract":"The representation of a scene at different levels of detail is necessary to achieve real-time rendering. In aerial views, only the part of the scene that is close to the viewing point needs to be displayed with a high level of detail, while more distant parts can be displayed with a low level of detail. However, when a sequence of images is generated and displayed in real-time, the transition between different levels of detail causes noticeable temporal aliasing. In this paper, we propose a method, based on object blending, that visually softens the transition between two levels of Delaunay triangulation. We present an algorithm that establishes, in an off-line process, a correspondence between two given polygonal objects. The correspondence enables on-line blending between two representations of an object, so that one representation (level of detail) progressively evolves into the other.","AuthorNamesDeduped":"Daniel Cohen-Or;Yishay Levanoni","AuthorNames":"D. Cohen-Or;Y. Levanoni","AuthorAffiliation":"Sch. of Math. Sci., Tel Aviv Univ., Israel","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"","XPloreCitationCount022019":"23","PubsCited":"18","Award":""}},{"name":"Feng Dong","value":4,"numPapers":14,"cluster":"4","visible":1,"index":188,"weight":1,"x":147.9074207968268,"y":294.1628460092722,"px":160.4571359858964,"py":301.2436518973785,"node":{"Conference":"Vis","Year":"1997","Title":"An anti-aliasing technique for splatting","DOI":"10.1109/VISUAL.1997.663882","Link":"http://dx.doi.org/10.1109/VISUAL.1997.663882","FirstPage":"197","LastPage":"204","PaperType":"C","Abstract":"Splatting is a popular direct volume rendering algorithm. However, the algorithm does not correctly render cases where the volume sampling rate is higher than the image sampling rate (e.g. more than one voxel maps into a pixel). This situation arises with orthographic projections of high-resolution volumes, as well as with perspective projections of volumes of any resolution. The result is potentially severe spatial and temporal aliasing artifacts. Some volume ray-casting algorithms avoid these artifacts by employing reconstruction kernels which vary in width as the rays diverge. Unlike ray-casting algorithms, existing splatting algorithms do not have an equivalent mechanism for avoiding these artifacts. The authors propose such a mechanism, which delivers high-quality splatted images and has the potential for a very efficient hardware implementation.","AuthorNamesDeduped":"J. Edward Swan;Klaus Mueller;Torsten Möller;Naeem Shareef;Roger Crawfis;Roni Yagel","AuthorNames":"J.E. Swan;K. Mueller;T. Moller;N. Shareel;R. Crawfis;R. Yagel","AuthorAffiliation":"Adv. Comput. Center for the Arts & Design, Ohio State Univ., Columbus, OH, USA","InternalReferences":"10.1109/VISUAL.1996.567608;10.1109/VISUAL.1993.398877;10.1109/VISUAL.1994.346331;10.1109/VISUAL.1995.480792;10.1109/VISUAL.1993.398852","AuthorKeywords":"volume rendering, splatting, direct volume rendering, resampling, reconstruction, anti-aliasing, perspective projection","AminerCitationCount022019":"64","XPloreCitationCount022019":"16","PubsCited":"26","Award":"BP"}},{"name":"Gordon Clapworthy","value":4,"numPapers":14,"cluster":"4","visible":1,"index":189,"weight":1,"x":-186.9444776825936,"y":797.9857407410501,"px":-191.59290447745357,"py":799.2374901686115,"node":{"Conference":"Vis","Year":"1997","Title":"An anti-aliasing technique for splatting","DOI":"10.1109/VISUAL.1997.663882","Link":"http://dx.doi.org/10.1109/VISUAL.1997.663882","FirstPage":"197","LastPage":"204","PaperType":"C","Abstract":"Splatting is a popular direct volume rendering algorithm. However, the algorithm does not correctly render cases where the volume sampling rate is higher than the image sampling rate (e.g. more than one voxel maps into a pixel). This situation arises with orthographic projections of high-resolution volumes, as well as with perspective projections of volumes of any resolution. The result is potentially severe spatial and temporal aliasing artifacts. Some volume ray-casting algorithms avoid these artifacts by employing reconstruction kernels which vary in width as the rays diverge. Unlike ray-casting algorithms, existing splatting algorithms do not have an equivalent mechanism for avoiding these artifacts. The authors propose such a mechanism, which delivers high-quality splatted images and has the potential for a very efficient hardware implementation.","AuthorNamesDeduped":"J. Edward Swan;Klaus Mueller;Torsten Möller;Naeem Shareef;Roger Crawfis;Roni Yagel","AuthorNames":"J.E. Swan;K. Mueller;T. Moller;N. Shareel;R. Crawfis;R. Yagel","AuthorAffiliation":"Adv. Comput. Center for the Arts & Design, Ohio State Univ., Columbus, OH, USA","InternalReferences":"10.1109/VISUAL.1996.567608;10.1109/VISUAL.1993.398877;10.1109/VISUAL.1994.346331;10.1109/VISUAL.1995.480792;10.1109/VISUAL.1993.398852","AuthorKeywords":"volume rendering, splatting, direct volume rendering, resampling, reconstruction, anti-aliasing, perspective projection","AminerCitationCount022019":"64","XPloreCitationCount022019":"16","PubsCited":"26","Award":"BP"}},{"name":"Meleagros A. Krokos","value":0,"numPapers":7,"cluster":"4","visible":1,"index":190,"weight":1,"x":169.9266750434794,"y":650.8798965913537,"px":178.66467407496955,"py":637.8111356019776,"node":{"Conference":"Vis","Year":"1997","Title":"An anti-aliasing technique for splatting","DOI":"10.1109/VISUAL.1997.663882","Link":"http://dx.doi.org/10.1109/VISUAL.1997.663882","FirstPage":"197","LastPage":"204","PaperType":"C","Abstract":"Splatting is a popular direct volume rendering algorithm. However, the algorithm does not correctly render cases where the volume sampling rate is higher than the image sampling rate (e.g. more than one voxel maps into a pixel). This situation arises with orthographic projections of high-resolution volumes, as well as with perspective projections of volumes of any resolution. The result is potentially severe spatial and temporal aliasing artifacts. Some volume ray-casting algorithms avoid these artifacts by employing reconstruction kernels which vary in width as the rays diverge. Unlike ray-casting algorithms, existing splatting algorithms do not have an equivalent mechanism for avoiding these artifacts. The authors propose such a mechanism, which delivers high-quality splatted images and has the potential for a very efficient hardware implementation.","AuthorNamesDeduped":"J. Edward Swan;Klaus Mueller;Torsten Möller;Naeem Shareef;Roger Crawfis;Roni Yagel","AuthorNames":"J.E. Swan;K. Mueller;T. Moller;N. Shareel;R. Crawfis;R. Yagel","AuthorAffiliation":"Adv. Comput. Center for the Arts & Design, Ohio State Univ., Columbus, OH, USA","InternalReferences":"10.1109/VISUAL.1996.567608;10.1109/VISUAL.1993.398877;10.1109/VISUAL.1994.346331;10.1109/VISUAL.1995.480792;10.1109/VISUAL.1993.398852","AuthorKeywords":"volume rendering, splatting, direct volume rendering, resampling, reconstruction, anti-aliasing, perspective projection","AminerCitationCount022019":"64","XPloreCitationCount022019":"16","PubsCited":"26","Award":"BP"}},{"name":"Xiaoming Wei","value":33,"numPapers":10,"cluster":"4","visible":1,"index":191,"weight":3,"x":485.74686599882074,"y":717.8120893099939,"px":487.47636222269665,"py":710.2161289445887,"node":{"Conference":"InfoVis","Year":"1997","Title":"Nonlinear magnification fields","DOI":"10.1109/INFVIS.1997.636786","Link":"http://dx.doi.org/10.1109/INFVIS.1997.636786","FirstPage":"51","LastPage":"58","PaperType":"C","Abstract":"We introduce nonlinear magnification fields as an abstract representation of nonlinear magnification, providing methods for converting transformation routines to magnification fields and vice-versa. This new representation provides ease of manipulation and power of expression. By removing the restrictions of explicit foci and allowing precise specification of magnification values, we can achieve magnification effects which were not previously possible. Of particular interest are techniques we introduce for expressing complex and subtle magnification effects through magnification brushing, and allowing intrinsic properties of the data being visualized to create data-driven magnifications.","AuthorNamesDeduped":"Alan Keahey;Edward L. Robertson","AuthorNames":"T.A. Keahey;E.L. Robertson","AuthorAffiliation":"Dept. of Comput. Sci., Indiana Univ., Bloomington, IN, USA","InternalReferences":"10.1109/INFVIS.1996.559214","AuthorKeywords":"information visualization, nonlinear magnification, data-driven magnification, fisheye views, magnification brushing, data-mining","AminerCitationCount022019":"","XPloreCitationCount022019":"23","PubsCited":"20","Award":""}},{"name":"Chris Stolte","value":483,"numPapers":17,"cluster":"0","visible":1,"index":192,"weight":19,"x":530.6042645214203,"y":249.79982607725722,"px":533.1110123609554,"py":254.3863262482545,"node":{"Conference":"InfoVis","Year":"1996","Title":"Visage: a user interface environment for exploring information","DOI":"10.1109/INFVIS.1996.559210","Link":"http://dx.doi.org/10.1109/INFVIS.1996.559210","FirstPage":"3","LastPage":"12, 116","PaperType":"C","Abstract":"Visage is a prototype user interface environment for exploring and analyzing information. It represents an approach to coordinating multiple visualizations, analysis and presentation tools in data-intensive domains. Visage is based on an information-centric approach to user interface design which strives to eliminate impediments to direct user access to information objects across applications and visualizations. Visage consists of a set of data manipulation operations, an intelligent system for generating a wide variety of data visualizations (SAGE) and a briefing tool that supports the conversion of visual displays used during exploration into interactive presentation slides. This paper presents the user interface components and styles of interaction that are central to Visage's information-centric approach.","AuthorNamesDeduped":"Steven F. Roth;Peter Lucas 0002;Jeffrey Senn;Cristina C. Gomberg;Michael B. Burks;Philip J. Stroffolino;John A. Kolojechick;Carolyn Dunmire","AuthorNames":"S.F. Roth;P. Lucas;J.A. Senn;C.C. Gomberg;M.B. Burks;P.J. Stroffolino;A.J. Kolojechick;C. Dunmire","AuthorAffiliation":"Sch. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA","InternalReferences":"10.1109/VISUAL.1993.398870;10.1109/VISUAL.1991.175815","AuthorKeywords":"Visualization, exploratory data analysis, graphics, user interface environment, human-computer interaction","AminerCitationCount022019":"230","XPloreCitationCount022019":"34","PubsCited":"13","Award":"TT"}},{"name":"Pat Hanrahan","value":633,"numPapers":20,"cluster":"0","visible":1,"index":193,"weight":21,"x":501.1801528658097,"y":307.22267615546025,"px":507.6525336224943,"py":307.2164081527614,"node":{"Conference":"Vis","Year":"1991","Title":"Achieving direct volume visualization with interactive semantic region selection","DOI":"10.1109/VISUAL.1991.175778","Link":"http://dx.doi.org/10.1109/VISUAL.1991.175778","FirstPage":"58","LastPage":"65, 410","PaperType":"C","Abstract":"The authors have achieved rates as high as 15 frames per second for interactive direct visualization of 3D data by trading some function for speed, while volume rendering with a full complement of ramp classification capabilities is performed at 1.4 frames per second. These speeds have made the combination of region selection with volume rendering practical for the first time. Semantic-driven selection, rather than geometric clipping, has proved to be a natural means of interacting with 3D data. Internal organs in medical data or other regions of interest can be built from preprocessed region primitives. The resulting combined system has been applied to real 3D medical data with encouraging results.<<ETX>>","AuthorNamesDeduped":"Terry S. Yoo;Ulrich Neumann;Henry Fuchs;Stephen M. Pizer;Tim J. Cullip;John Rhoades;Ross T. Whitaker","AuthorNames":"T.S. Yoo;U. Neumann;H. Fuchs;S.M. Pizer;T. Cullip;J. Rhoades;R. Whitaker","AuthorAffiliation":"North Carolina Univ., Chapel Hill, NC, USA;North Carolina Univ., Chapel Hill, NC, USA;North Carolina Univ., Chapel Hill, NC, USA;North Carolina Univ., Chapel Hill, NC, USA;North Carolina Univ., Chapel Hill, NC, USA;North Carolina Univ., Chapel Hill, NC, USA;North Carolina Univ., Chapel Hill, NC, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"32","XPloreCitationCount022019":"10","PubsCited":"13","Award":""}},{"name":"Jörn Schneidewind","value":171,"numPapers":19,"cluster":"2","visible":1,"index":194,"weight":6,"x":363.2380328620755,"y":272.52099056779247,"px":369.08336491821774,"py":273.94840168253637,"node":{"Conference":"Vis","Year":"1998","Title":"The Gridfit algorithm: an efficient and effective approach to visualizing large amounts of spatial data","DOI":"10.1109/VISUAL.1998.745301","Link":"http://dx.doi.org/10.1109/VISUAL.1998.745301","FirstPage":"181","LastPage":"188","PaperType":"C","Abstract":"In a large number of applications, data is collected and referenced by their spatial locations. Visualizing large amounts of spatially referenced data on a limited-size screen display often results in poor visualizations due to the high degree of overplotting of neighboring datapoints. We introduce a new approach to visualizing large amounts of spatially referenced data. The basic idea is to intelligently use the unoccupied pixels of the display instead of overplotting data points. After formally describing the problem, we present two solutions which are based on: placing overlapping data points on the nearest unoccupied pixel; and shifting data points along a screen-filling curve (e.g., Hilbert-curve). We then develop a more sophisticated approach called Gridfit, which is based on a hierarchical partitioning of the data space. We evaluate all three approaches with respect to their efficiency and effectiveness and show the superiority of the Gridfit approach. For measuring the effectiveness, we not only present the resulting visualizations but also introduce mathematical effectiveness criteria measuring properties of the generated visualizations with respect to the original data such as distance- and position-preservation.","AuthorNamesDeduped":"Daniel A. Keim;Annemarie Herrmann","AuthorNames":"D.A. Keim;A. Herrmann","AuthorAffiliation":"Inst. of Comput. Sci., Halle-Wittenberg Univ., Halle, Germany","InternalReferences":"10.1109/VISUAL.1995.485139;10.1109/INFVIS.1995.528688;10.1109/VISUAL.1991.175794;10.1109/VISUAL.1990.146387;10.1109/VISUAL.1990.146402;10.1109/VISUAL.1993.398870;10.1109/VISUAL.1995.485140;10.1109/VISUAL.1994.346302;10.1109/INFVIS.1995.528690;10.1109/VISUAL.1990.146386","AuthorKeywords":"visualizing large data sets, visualizing spatially referenced data, visualizing geographical data, interfaces to databases","AminerCitationCount022019":"66","XPloreCitationCount022019":"13","PubsCited":"34","Award":""}},{"name":"Donald H. House","value":54,"numPapers":11,"cluster":"2","visible":1,"index":195,"weight":1,"x":775.4594204918012,"y":-9.056430850907994,"px":773.3549650783434,"py":-3.022741901221388,"node":{"Conference":"Vis","Year":"1998","Title":"Continuous cartogram construction","DOI":"10.1109/VISUAL.1998.745303","Link":"http://dx.doi.org/10.1109/VISUAL.1998.745303","FirstPage":"197","LastPage":"204","PaperType":"C","Abstract":"Area cartograms are used for visualizing geographically distributed data by attaching measurements to regions of a map and scaling the regions such that their areas are proportional to the measured quantities. A continuous area cartogram is a cartogram that is constructed without changing the underlying map topology. We present a new algorithm for the construction of continuous area cartograms that was developed by viewing their construction as a constrained optimization problem. The algorithm uses a relaxation method that exploits hierarchical resolution, constrained dynamics, and a scheme that alternates goals of achieving correct region areas and adjusting region shapes. It is compared favorably to existing methods in its ability to preserve region shape recognition cues, while still achieving high accuracy.","AuthorNamesDeduped":"Donald H. House;Christopher J. Kocmoud","AuthorNames":"D.H. House;C.J. Kocmoud","AuthorAffiliation":"Visualization Lab., Texas A&M Univ., College Station, TX, USA","InternalReferences":"","AuthorKeywords":"cartogram, value-by-area map, map transformation,anamorphosis, thematic cartography, constrained optimization","AminerCitationCount022019":"76","XPloreCitationCount022019":"11","PubsCited":"0","Award":""}},{"name":"Kresimir Matkovic","value":223,"numPapers":49,"cluster":"3","visible":1,"index":196,"weight":13,"x":443.42536487165574,"y":509.28933814514716,"px":444.65307834998595,"py":507.93657107444676,"node":{"Conference":"InfoVis","Year":"1998","Title":"The generalized detail in-context problem","DOI":"10.1109/INFVIS.1998.729558","Link":"http://dx.doi.org/10.1109/INFVIS.1998.729558","FirstPage":"44","LastPage":"51, 152","PaperType":"C","Abstract":"The paper describes a general formulation of the \"detail-in-context\" problem, which is a central issue of fundamental importance to a wide variety of nonlinear magnification systems. A number of tools are described for dealing with this problem effectively. These tools can be applied to any continuous nonlinear magnification system, and are not tied to specific implementation features of the system that produced the original transformation. Of particular interest is the development of \"seamless multi level views\", which allow multiple global views of an information space (each having different information content) to be integrated into a single view without discontinuity.","AuthorNamesDeduped":"Alan Keahey","AuthorNames":"T.A. Keahey","AuthorAffiliation":"Los Alamos Nat. Lab., NM, USA","InternalReferences":"10.1109/INFVIS.1997.636786;10.1109/INFVIS.1997.636718;10.1109/INFVIS.1996.559214","AuthorKeywords":"","AminerCitationCount022019":"","XPloreCitationCount022019":"29","PubsCited":"25","Award":""}},{"name":"Silvia Miksch","value":171,"numPapers":89,"cluster":"0","visible":1,"index":197,"weight":9,"x":612.3457722548503,"y":382.7891346516981,"px":611.4910936369234,"py":381.4559713475376,"node":{"Conference":"Vis","Year":"2000","Title":"FastSplats: optimized splatting on rectilinear grids","DOI":"10.1109/VISUAL.2000.885698","Link":"http://dx.doi.org/10.1109/VISUAL.2000.885698","FirstPage":"219","LastPage":"226","PaperType":"C","Abstract":"Splatting is widely applied in many areas, including volume, point-based and image-based rendering. Improvements to splatting, such as eliminating popping and color bleeding, occasion-based acceleration, post-rendering classification and shading, have all been recently accomplished. These improvements share a common need for efficient frame-buffer accesses. We present an optimized software splatting package, using a newly designed primitive, called FastSplat, to scan-convert footprints. Our approach does not use texture mapping hardware, but supports the whole pipeline in memory. In such an integrated pipeline, we are then able to study the optimization strategies and address image quality issues. While this research is meant for a study of the inherent trade-off of splatting, our renderer, purely in software, achieves 3- to 5-fold speedups over a top-end texture hardware implementation (for opaque data sets). We further propose a method of efficient occlusion culling using a summed area table of opacity. 3D solid texturing and bump mapping capabilities are demonstrated to show the flexibility of such an integrated rendering pipeline. A detailed numerical error analysis, in addition to the performance and storage issues, is also presented. Our approach requires low storage and uses simple operations. Thus, it is easily implementable in hardware.","AuthorNamesDeduped":"Jian Huang;Roger Crawfis;Naeem Shareef;Klaus Mueller","AuthorNames":"Jian Huang;K. Mueller;N. Shareef;R. Crawfis","AuthorAffiliation":"Dept. of Comput. & Inf. Sci., Ohio State Univ., Columbus, OH, USA","InternalReferences":"10.1109/VISUAL.1999.809909;10.1109/VISUAL.1993.398877;10.1109/VISUAL.1999.809872","AuthorKeywords":"","AminerCitationCount022019":"77","XPloreCitationCount022019":"9","PubsCited":"22","Award":""}},{"name":"Jing Yang 0001","value":341,"numPapers":76,"cluster":"2","visible":1,"index":198,"weight":25,"x":568.6918870272918,"y":292.5712476802577,"px":570.2666477580767,"py":294.0377846675867,"node":{"Conference":"InfoVis","Year":"2001","Title":"A comparison of 2-D visualizations of hierarchies","DOI":"10.1109/INFVIS.2001.963290","Link":"http://dx.doi.org/10.1109/INFVIS.2001.963290","FirstPage":"131","LastPage":"138","PaperType":"C","Abstract":"","AuthorNamesDeduped":"S. Todd Barlow;Padraic Neville","AuthorNames":"T. Barlow;P. Neville","AuthorAffiliation":"SAS Institute Inc.","InternalReferences":"10.1109/INFVIS.1998.729557;10.1109/VISUAL.1992.235217","AuthorKeywords":"","AminerCitationCount022019":"45","XPloreCitationCount022019":"30","PubsCited":"8","Award":""}},{"name":"Martin Wattenberg","value":915,"numPapers":50,"cluster":"0","visible":1,"index":199,"weight":62,"x":619.4450483481842,"y":321.9816894244697,"px":618.580969603743,"py":321.45684894292975,"node":{"Conference":"Vis","Year":"1992","Title":"Improving the visualization of hierarchies with treemaps: design issues and experimentation","DOI":"10.1109/VISUAL.1992.235217","Link":"http://dx.doi.org/10.1109/VISUAL.1992.235217","FirstPage":"124","LastPage":"131","PaperType":"C","Abstract":"Controlled experiments with novice treemap users and real data highlight the strengths of treemaps and provide direction for improvement. Issues discussed include experimental results, layout algorithms, nesting offsets, labeling, animation, and small multiple displays. Treemaps prove to be a potent tool for hierarchy display. The principles discussed are applicable to many information visualization situations.<<ETX>>","AuthorNamesDeduped":"David Turo;B. Johnson","AuthorNames":"D. Turo;B. Johnson","AuthorAffiliation":"Dept. of Comput. Sci., Maryland Univ., College Park, MD, USA;Dept. of Comput. Sci., Maryland Univ., College Park, MD, USA","InternalReferences":"10.1109/VISUAL.1991.175796;10.1109/VISUAL.1991.175791;10.1109/VISUAL.1991.175815;10.1109/VISUAL.1991.175794","AuthorKeywords":"","AminerCitationCount022019":"94","XPloreCitationCount022019":"24","PubsCited":"16","Award":""}},{"name":"Frank van Ham","value":589,"numPapers":32,"cluster":"0","visible":1,"index":200,"weight":22,"x":635.0835867446469,"y":310.163839040868,"px":632.698574076364,"py":311.67724412011177,"node":{"Conference":"InfoVis","Year":"1995","Title":"Case study. Narcissus: visualising information","DOI":"10.1109/INFVIS.1995.528691","Link":"http://dx.doi.org/10.1109/INFVIS.1995.528691","FirstPage":"90","LastPage":"96","PaperType":"C","Abstract":"It is becoming increasingly important that support is provided for users who are dealing with complex information spaces. The need is driven by the growing number of domains where there is a requirement for users to understand, navigate and manipulate large sets of computer based data; by the increasing size and complexity of this information and by the pressures to use this information efficiently. The paradigmatic example is the World Wide Web, but other domains include software systems, information systems and concurrent engineering. One approach to providing this support is to provide sophisticated visualisation tools which lead the users to form an intuitive understanding of the structure and behaviour of their domain and which provide mechanisms which allow them to manipulate objects within their system. The paper describes such a tool and a number of visualisation techniques that it implements.","AuthorNamesDeduped":"Robert J. Hendley;Nick S. Drew;Andrew Wood;Russell Beale","AuthorNames":"R.J. Hendley;N.S. Drew;A.M. Wood;R. Beale","AuthorAffiliation":"Sch. of Comput. Sci., Birmingham Univ., UK;Sch. of Comput. Sci., Birmingham Univ., UK;Sch. of Comput. Sci., Birmingham Univ., UK;Sch. of Comput. Sci., Birmingham Univ., UK","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"247","XPloreCitationCount022019":"31","PubsCited":"8","Award":""}},{"name":"S. Todd Barlow","value":29,"numPapers":2,"cluster":"6","visible":1,"index":201,"weight":1,"x":873.9810151076224,"y":689.1861046655838,"px":873.3590154544661,"py":681.6797756591699,"node":{"Conference":"InfoVis","Year":"1998","Title":"Dynamic aggregation with circular visual designs","DOI":"10.1109/INFVIS.1998.729557","Link":"http://dx.doi.org/10.1109/INFVIS.1998.729557","FirstPage":"35","LastPage":"43, 151","PaperType":"C","Abstract":"One very effective method for managing large data sets is aggregation or binning. We consider two aggregation methods that are tightly coupled with interactive manipulation and the visual representation of the data. Through this integration we hope to provide effective support for the aggregation process, specifically by enabling: 1) automatic aggregation, 2) continuous change and control of the aggregation level, 3) spatially based aggregates, 4) context maintenance across different aggregate levels, and 5) feedback on the level of aggregation.","AuthorNamesDeduped":"Mei C. Chuah","AuthorNames":"M.C. Chuah","AuthorAffiliation":"Sch. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA","InternalReferences":"10.1109/INFVIS.1997.636787;10.1109/VISUAL.1992.235206","AuthorKeywords":"","AminerCitationCount022019":"93","XPloreCitationCount022019":"27","PubsCited":"13","Award":""}},{"name":"Padraic Neville","value":29,"numPapers":2,"cluster":"6","visible":1,"index":202,"weight":1,"x":216.03015675570276,"y":725.6679422201222,"px":219.0827603275651,"py":712.0887226722853,"node":{"Conference":"InfoVis","Year":"1998","Title":"Dynamic aggregation with circular visual designs","DOI":"10.1109/INFVIS.1998.729557","Link":"http://dx.doi.org/10.1109/INFVIS.1998.729557","FirstPage":"35","LastPage":"43, 151","PaperType":"C","Abstract":"One very effective method for managing large data sets is aggregation or binning. We consider two aggregation methods that are tightly coupled with interactive manipulation and the visual representation of the data. Through this integration we hope to provide effective support for the aggregation process, specifically by enabling: 1) automatic aggregation, 2) continuous change and control of the aggregation level, 3) spatially based aggregates, 4) context maintenance across different aggregate levels, and 5) feedback on the level of aggregation.","AuthorNamesDeduped":"Mei C. Chuah","AuthorNames":"M.C. Chuah","AuthorAffiliation":"Sch. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA","InternalReferences":"10.1109/INFVIS.1997.636787;10.1109/VISUAL.1992.235206","AuthorKeywords":"","AminerCitationCount022019":"93","XPloreCitationCount022019":"27","PubsCited":"13","Award":""}},{"name":"Jean-Daniel Fekete","value":930,"numPapers":141,"cluster":"0","visible":1,"index":203,"weight":67,"x":585.2228794931509,"y":293.56231120981096,"px":582.7226682572064,"py":297.31385435019246,"node":{"Conference":"InfoVis","Year":"2001","Title":"Change blindness in information visualization: a case study","DOI":"10.1109/INFVIS.2001.963274","Link":"http://dx.doi.org/10.1109/INFVIS.2001.963274","FirstPage":"15","LastPage":"22","PaperType":"C","Abstract":"","AuthorNamesDeduped":"Lucy T. Nowell;Elizabeth G. Hetzler;Ted Tanasse","AuthorNames":"L. Nowell;E. Hetzler;T. Tanasse","AuthorAffiliation":"Pacific Northwest National Laboratory","InternalReferences":"10.1109/INFVIS.1997.636789;10.1109/INFVIS.2000.885099;10.1109/INFVIS.1995.528692;10.1109/INFVIS.1995.528686;10.1109/INFVIS.1995.528691","AuthorKeywords":"","AminerCitationCount022019":"79","XPloreCitationCount022019":"31","PubsCited":"35","Award":""}},{"name":"Catherine Plaisant","value":375,"numPapers":34,"cluster":"0","visible":1,"index":204,"weight":11,"x":654.5844140321011,"y":240.02612229044658,"px":652.6328806366234,"py":243.83587189762628,"node":{"Conference":"Vis","Year":"1996","Title":"Cheops: a compact explorer for complex hierarchies","DOI":"10.1109/VISUAL.1996.567745","Link":"http://dx.doi.org/10.1109/VISUAL.1996.567745","FirstPage":"87","LastPage":"92","PaperType":"C","Abstract":"As the amount of electronic information explodes, hierarchies to handle this information become huge and complex. Visualizing and interacting with these hierarchies become daunting tasks. The problem is exacerbated if the visualization is to be done on mass-market personal computers, with limited processing power and visual resolution. Many of the current visualization techniques work effectively for hierarchies of 1000 nodes, but as the number of nodes increases toward 5000, these techniques tend to break down. Hierarchies above 5000 nodes usually require special modifications such as clustering, which can affect visual stability. This paper introduces Cheops, a novel approach to the representation, browsing and exploration of huge, complex information hierarchies such as the Dewey Decimal Classification system, which can contain between a million and a billion nodes. The Cheops approach maintains context within a huge hierarchy, while simultaneously providing easy access to details. This paper presents some preliminary results from usability tests performed on an 8-wide-by-9-deep classification hierarchy, which if fully populated would contain over 19 million nodes.","AuthorNamesDeduped":"Luc Beaudoin;Marc-Antoine Parent;Louis C. Vroomen","AuthorNames":"L. Beaudoin;M.-A. Parent;L.C. Vroomen","AuthorAffiliation":"Centre de Recherche Inf. de Montreal, Que.,, Canada","InternalReferences":"10.1109/INFVIS.1995.528689","AuthorKeywords":"Hierarchical representation, information visualization and exploration, focus+context techniques, graphical browser","AminerCitationCount022019":"71","XPloreCitationCount022019":"15","PubsCited":"10","Award":""}},{"name":"Armin Kanitsar","value":287,"numPapers":22,"cluster":"3","visible":1,"index":205,"weight":18,"x":483.4262904352652,"y":591.8874404701376,"px":485.02992908493405,"py":587.6297130707135,"node":{"Conference":"Vis","Year":"2001","Title":"Computed tomography angiography: a case study of peripheral vessel investigation","DOI":"10.1109/VISUAL.2001.964555","Link":"http://dx.doi.org/10.1109/VISUAL.2001.964555","FirstPage":"477","LastPage":"480","PaperType":"C","Abstract":"This paper deals with vessel exploration based on computed tomography angiography. Large image sequences of the lower extremities are investigated in a clinical environment. Two different approaches for peripheral vessel diagnosis dealing with stenosis and calcification detection are introduced. The paper presents an automated vessel-tracking tool for curved planar reformation. An interactive segmentation tool for bone removal is proposed.","AuthorNamesDeduped":"Armin Kanitsar;Rainer Wegenkittl;Petr Felkel;Dominik Fleischmann;Dominique Sandner;M. Eduard Gröller","AuthorNames":"A. Kanitsar;D. Fleischmann;R. Wegenkittl;D. Sandner;P. Felkel;E. Groller","AuthorAffiliation":"Inst. of Comput. Graphics & Algorithms, Vienna Univ. of Technol., Austria","InternalReferences":"","AuthorKeywords":"Computed Tomography Angiography (CTA), semi automatic segmentation, optimal path computation","AminerCitationCount022019":"66","XPloreCitationCount022019":"14","PubsCited":"7","Award":""}},{"name":"Petr Felkel","value":144,"numPapers":6,"cluster":"3","visible":1,"index":206,"weight":7,"x":533.9623724670364,"y":703.9169542003549,"px":535.01247696427,"py":698.8092204470851,"node":{"Conference":"Vis","Year":"2001","Title":"Computed tomography angiography: a case study of peripheral vessel investigation","DOI":"10.1109/VISUAL.2001.964555","Link":"http://dx.doi.org/10.1109/VISUAL.2001.964555","FirstPage":"477","LastPage":"480","PaperType":"C","Abstract":"This paper deals with vessel exploration based on computed tomography angiography. Large image sequences of the lower extremities are investigated in a clinical environment. Two different approaches for peripheral vessel diagnosis dealing with stenosis and calcification detection are introduced. The paper presents an automated vessel-tracking tool for curved planar reformation. An interactive segmentation tool for bone removal is proposed.","AuthorNamesDeduped":"Armin Kanitsar;Rainer Wegenkittl;Petr Felkel;Dominik Fleischmann;Dominique Sandner;M. Eduard Gröller","AuthorNames":"A. Kanitsar;D. Fleischmann;R. Wegenkittl;D. Sandner;P. Felkel;E. Groller","AuthorAffiliation":"Inst. of Comput. Graphics & Algorithms, Vienna Univ. of Technol., Austria","InternalReferences":"","AuthorKeywords":"Computed Tomography Angiography (CTA), semi automatic segmentation, optimal path computation","AminerCitationCount022019":"66","XPloreCitationCount022019":"14","PubsCited":"7","Award":""}},{"name":"Dominik Fleischmann","value":231,"numPapers":13,"cluster":"3","visible":1,"index":207,"weight":18,"x":523.4415212958178,"y":621.7058677219445,"px":524.3190839005259,"py":617.5708532272628,"node":{"Conference":"Vis","Year":"2001","Title":"Computed tomography angiography: a case study of peripheral vessel investigation","DOI":"10.1109/VISUAL.2001.964555","Link":"http://dx.doi.org/10.1109/VISUAL.2001.964555","FirstPage":"477","LastPage":"480","PaperType":"C","Abstract":"This paper deals with vessel exploration based on computed tomography angiography. Large image sequences of the lower extremities are investigated in a clinical environment. Two different approaches for peripheral vessel diagnosis dealing with stenosis and calcification detection are introduced. The paper presents an automated vessel-tracking tool for curved planar reformation. An interactive segmentation tool for bone removal is proposed.","AuthorNamesDeduped":"Armin Kanitsar;Rainer Wegenkittl;Petr Felkel;Dominik Fleischmann;Dominique Sandner;M. Eduard Gröller","AuthorNames":"A. Kanitsar;D. Fleischmann;R. Wegenkittl;D. Sandner;P. Felkel;E. Groller","AuthorAffiliation":"Inst. of Comput. Graphics & Algorithms, Vienna Univ. of Technol., Austria","InternalReferences":"","AuthorKeywords":"Computed Tomography Angiography (CTA), semi automatic segmentation, optimal path computation","AminerCitationCount022019":"66","XPloreCitationCount022019":"14","PubsCited":"7","Award":""}},{"name":"Dominique Sandner","value":44,"numPapers":0,"cluster":"3","visible":1,"index":208,"weight":2,"x":534.5021501471613,"y":787.2081850432745,"px":532.8500246195473,"py":779.4441216233275,"node":{"Conference":"Vis","Year":"2001","Title":"Computed tomography angiography: a case study of peripheral vessel investigation","DOI":"10.1109/VISUAL.2001.964555","Link":"http://dx.doi.org/10.1109/VISUAL.2001.964555","FirstPage":"477","LastPage":"480","PaperType":"C","Abstract":"This paper deals with vessel exploration based on computed tomography angiography. Large image sequences of the lower extremities are investigated in a clinical environment. Two different approaches for peripheral vessel diagnosis dealing with stenosis and calcification detection are introduced. The paper presents an automated vessel-tracking tool for curved planar reformation. An interactive segmentation tool for bone removal is proposed.","AuthorNamesDeduped":"Armin Kanitsar;Rainer Wegenkittl;Petr Felkel;Dominik Fleischmann;Dominique Sandner;M. Eduard Gröller","AuthorNames":"A. Kanitsar;D. Fleischmann;R. Wegenkittl;D. Sandner;P. Felkel;E. Groller","AuthorAffiliation":"Inst. of Comput. Graphics & Algorithms, Vienna Univ. of Technol., Austria","InternalReferences":"","AuthorKeywords":"Computed Tomography Angiography (CTA), semi automatic segmentation, optimal path computation","AminerCitationCount022019":"66","XPloreCitationCount022019":"14","PubsCited":"7","Award":""}},{"name":"Bernhard Preim","value":239,"numPapers":89,"cluster":"3","visible":1,"index":209,"weight":31,"x":511.17707094969575,"y":653.1130693759139,"px":511.58586069838407,"py":647.3883747863727,"node":{"Conference":"Vis","Year":"1997","Title":"An interactive cerebral blood vessel exploration system","DOI":"10.1109/VISUAL.1997.663917","Link":"http://dx.doi.org/10.1109/VISUAL.1997.663917","FirstPage":"443","LastPage":"446","PaperType":"C","Abstract":"An interactive cerebral blood vessel exploration system is described. It has been designed on the basis of neurosurgeons' requirements in order to assist them in the diagnosis of vascular pathologies. The system is based on the construction of a symbolic model of the vascular tree, with automatic identification and labelling of vessel bifurcations, aneurysms and stenoses. It provides several types of visualization: individual MRA (magnetic resonance angiography) slices, MIP (maximum intensity projection), shaded rendering, symbolic schemes and surface reconstruction.","AuthorNamesDeduped":"Anna Puig;Dani Tost;Isabel Navazo","AuthorNames":"A. Puig;D. Tost;I. Navazo","AuthorAffiliation":"Polytech. Univ. of Catalonia, Spain","InternalReferences":"10.1109/VISUAL.1995.480790","AuthorKeywords":"Volume Modelling and Rendering, Medical Applications, Cerebral Blood Vessel","AminerCitationCount022019":"44","XPloreCitationCount022019":"8","PubsCited":"20","Award":""}},{"name":"Heinz-Otto Peitgen","value":74,"numPapers":8,"cluster":"3","visible":1,"index":210,"weight":1,"x":656.4864609579613,"y":855.7635986399536,"px":652.8621379488286,"py":847.4057544026383,"node":{"Conference":"Vis","Year":"1997","Title":"An interactive cerebral blood vessel exploration system","DOI":"10.1109/VISUAL.1997.663917","Link":"http://dx.doi.org/10.1109/VISUAL.1997.663917","FirstPage":"443","LastPage":"446","PaperType":"C","Abstract":"An interactive cerebral blood vessel exploration system is described. It has been designed on the basis of neurosurgeons' requirements in order to assist them in the diagnosis of vascular pathologies. The system is based on the construction of a symbolic model of the vascular tree, with automatic identification and labelling of vessel bifurcations, aneurysms and stenoses. It provides several types of visualization: individual MRA (magnetic resonance angiography) slices, MIP (maximum intensity projection), shaded rendering, symbolic schemes and surface reconstruction.","AuthorNamesDeduped":"Anna Puig;Dani Tost;Isabel Navazo","AuthorNames":"A. Puig;D. Tost;I. Navazo","AuthorAffiliation":"Polytech. Univ. of Catalonia, Spain","InternalReferences":"10.1109/VISUAL.1995.480790","AuthorKeywords":"Volume Modelling and Rendering, Medical Applications, Cerebral Blood Vessel","AminerCitationCount022019":"44","XPloreCitationCount022019":"8","PubsCited":"20","Award":""}},{"name":"Caixia Zhang","value":6,"numPapers":18,"cluster":"4","visible":1,"index":211,"weight":2,"x":299.7993326395965,"y":302.37412031863767,"px":306.20311839207386,"py":304.8662313216524,"node":{"Conference":"Vis","Year":"1998","Title":"Eliminating popping artifacts in sheet buffer-based splatting","DOI":"10.1109/VISUAL.1998.745309","Link":"http://dx.doi.org/10.1109/VISUAL.1998.745309","FirstPage":"239","LastPage":"245","PaperType":"C","Abstract":"Splatting is a fast volume rendering algorithm which achieves its speed by projecting voxels in the form of pre-integrated interpolation kernels, or splats. Presently, two main variants of the splatting algorithm exist: (i) the original method, in which all splats are composited back-to-front, and (ii) the sheet-buffer method, in which the splats are added in cache-sheets, aligned with the volume face most parallel to the image plane, which are subsequently composited back-to-front. The former method is prone to cause bleeding artifacts from hidden objects, while the latter method reduces bleeding, but causes very visible color popping artifacts when the orientation of the compositing sheets changes suddenly as the image screen becomes more parallel to another volume face. We present a new variant of the splatting algorithm in which the compositing sheets are always parallel to the image plane, eliminating the condition for popping, while maintaining the insensitivity to color bleeding. This enables pleasing animated viewing of volumetric objects without temporal color and lighting discontinuities. The method uses a hierarchy of partial splats and employs an efficient list-based volume traversal scheme for fast splat access. It also offers more accuracy for perspective splatting as the decomposition of the individual splats facilitates a better approximation to the diverging nature of the rays that traverse the splatting kernels.","AuthorNamesDeduped":"Klaus Mueller;Roger Crawfis","AuthorNames":"K. Mueller;R. Crawfis","AuthorAffiliation":"Dept. of Comput. & Inf. Sci., Ohio State Univ., Columbus, OH, USA","InternalReferences":"10.1109/VISUAL.1996.567608;10.1109/VISUAL.1996.568119;10.1109/VISUAL.1995.480792;10.1109/VISUAL.1997.663882;10.1109/VISUAL.1993.398877;10.1109/VISUAL.1993.398852","AuthorKeywords":"","AminerCitationCount022019":"118","XPloreCitationCount022019":"25","PubsCited":"23","Award":""}},{"name":"Daniel Weiskopf","value":657,"numPapers":234,"cluster":"8","visible":1,"index":212,"weight":62,"x":461.2784422573288,"y":340.7273256246658,"px":465.3930936130795,"py":342.3780773122344,"node":{"Conference":"Vis","Year":"1990","Title":"Wide-band relativistic Doppler effect visualization","DOI":"10.1109/VISUAL.1990.146368","Link":"http://dx.doi.org/10.1109/VISUAL.1990.146368","FirstPage":"83","LastPage":"92, 465-7","PaperType":"C","Abstract":"The authors present a flexible and efficient method to simulate the Doppler shift. In this new method the spectral curves of surface properties and light composition are represented by spline functions of wavelength. These functions can cover the entire electromagnetic (EM) waves bandwidth, and incorporate the thermal radiation of objects into the surface property description. In particular, a temperature-dependent emission spectral distribution can be assigned to each object for imaging the nonvisible thermal spectra which may become visible due to blue shift. The Doppler shift and shading operations are performed through the manipulation of spline coefficients. The evaluation of the spline functions, which is computationally expensive, is only carried out once-at the end of each shading loop for generating the display RGB values.<<ETX>>","AuthorNamesDeduped":"Ping-Kang Hsiung;Robert H. Thibadeau;Christopher B. Cox;Robert H. P. Dunn;Michael Wu;Paul Andrew Olbrich","AuthorNames":"P.-K. Hsiung;R.H. Thibadeau;C.B. Cox;R.H.P. Dunn;M. Wu;P.A. Olbrich","AuthorAffiliation":"Carnegie Mellon Univ., Pittsburgh, PA, USA;Carnegie Mellon Univ., Pittsburgh, PA, USA;Carnegie Mellon Univ., Pittsburgh, PA, USA;Carnegie Mellon Univ., Pittsburgh, PA, USA;Carnegie Mellon Univ., Pittsburgh, PA, USA;Carnegie Mellon Univ., Pittsburgh, PA, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"50","XPloreCitationCount022019":"5","PubsCited":"8","Award":""}},{"name":"Joe Michael Kniss","value":313,"numPapers":18,"cluster":"4","visible":1,"index":213,"weight":10,"x":343.8313782111889,"y":377.73531515389027,"px":348.8673172513221,"py":379.7371528425478,"node":{"Conference":"Vis","Year":"1995","Title":"A rule-based tool for assisting colormap selection","DOI":"10.1109/VISUAL.1995.480803","Link":"http://dx.doi.org/10.1109/VISUAL.1995.480803","FirstPage":"118","LastPage":"125, 444","PaperType":"C","Abstract":"The paper presents an interactive approach for guiding the user's select of colormaps in visualization. PRAVDAColor, implemented as a module in the IBM Visualization Data Explorer, provides the user a selection of appropriate colormaps given the data type and spatial frequency, the user's task, and properties of the human perceptual system.","AuthorNamesDeduped":"Lawrence D. Bergman;Bernice E. Rogowitz;Lloyd Treinish","AuthorNames":"L.D. Bergman;B.E. Rogowitz;L.A. Treinish","AuthorAffiliation":"IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA;IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA;IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA","InternalReferences":"10.1109/VISUAL.1995.480821;10.1109/VISUAL.1993.398874","AuthorKeywords":"","AminerCitationCount022019":"238","XPloreCitationCount022019":"62","PubsCited":"24","Award":""}},{"name":"Gunther H. Weber","value":114,"numPapers":29,"cluster":"6","visible":1,"index":214,"weight":4,"x":153.6184300642849,"y":429.93153189923254,"px":161.1094187559085,"py":430.5343902399041,"node":{"Conference":"Vis","Year":"1997","Title":"Haar wavelets over triangular domains with applications to multiresolution models for flow over a sphere","DOI":"10.1109/VISUAL.1997.663871","Link":"http://dx.doi.org/10.1109/VISUAL.1997.663871","FirstPage":"143","LastPage":"149","PaperType":"C","Abstract":"Some new piecewise constant wavelets defined over nested triangulated domains are presented and applied to the problem of multiresolution analysis of flow over a spherical domain. These new, nearly orthogonal wavelets have advantages over the existing weaker biorthogonal wavelets. In the planar case of uniform areas, the wavelets converge to one of two fully orthogonal Haar wavelets. These new, fully orthogonal wavelets are proven to be the only possible wavelets of this type.","AuthorNamesDeduped":"Gregory M. Nielson;Il-Hong Jung;Junwon Sung","AuthorNames":"G.M. Nielson;Il-Hong Jung;Junwon Sung","AuthorAffiliation":"Dept. of Comput. Sci. & Eng., Arizona State Univ., Tempe, AZ, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"68","XPloreCitationCount022019":"20","PubsCited":"3","Award":""}},{"name":"Thomas Gerstner","value":46,"numPapers":9,"cluster":"6","visible":1,"index":215,"weight":2,"x":47.217285311375115,"y":422.97405674639447,"px":57.12632044678848,"py":421.9888970596475,"node":{"Conference":"Vis","Year":"1996","Title":"Octree-based decimation of marching cubes surfaces","DOI":"10.1109/VISUAL.1996.568127","Link":"http://dx.doi.org/10.1109/VISUAL.1996.568127","FirstPage":"335","LastPage":"342","PaperType":"C","Abstract":"The marching cubes (MC) algorithm is a method for generating isosurfaces. It also generates an excessively large number of triangles to represent an isosurface; this increases the rendering time. This paper presents a decimation method to reduce the number of triangles generated. Decimation is carried out before creating a large number of triangles. Four major steps comprise the algorithm: surface tracking, merging, crack patching and triangulation. Surface tracking is an enhanced implementation of the MC algorithm. Starting from a seed point, the surface tracker visits only those cells likely to compose part of the desired isosurface. The cells making up the extracted surface are stored in an octree that is further processed. A bottom-up approach is taken in merging the cells containing a relatively flat approximating surface. The finer surface details are maintained. Cells are merged as long as the error due to such an operation is within a user-specified error parameter, or a cell acquires more than one connected surface component in it. A crack patching method is described that forces edges of smaller cells to lie along those of the larger neighboring cells. The overall saving in the number of triangles depends both on the specified error value and the nature of the data. Use of the hierarchical octree data structure also presents the potential of incremental representation of surfaces. We can generate a highly smoothed surface representation which can be progressively refined as the user-specified error value is decreased.","AuthorNamesDeduped":"Raj Shekhar;Elias Fayyad;Roni Yagel;J. Fredrick Cornhill","AuthorNames":"R. Shekhar;E. Fayyad;R. Yagel;J.F. Cornhill","AuthorAffiliation":"Biomed. Eng. Center, Ohio State Univ., Columbus, OH, USA","InternalReferences":"10.1109/VISUAL.1994.346308","AuthorKeywords":"","AminerCitationCount022019":"0","XPloreCitationCount022019":"64","PubsCited":"7","Award":""}},{"name":"Ingrid Hotz","value":85,"numPapers":25,"cluster":"6","visible":1,"index":216,"weight":2,"x":73.02588748285504,"y":570.6336107838829,"px":80.40650011648894,"py":566.6092248534145,"node":{"Conference":"Vis","Year":"1992","Title":"Virtual spacetime: an environment for the visualization of curved spacetimes via geodesic flows","DOI":"10.1109/VISUAL.1992.235196","Link":"http://dx.doi.org/10.1109/VISUAL.1992.235196","FirstPage":"291","LastPage":"298","PaperType":"C","Abstract":"An implementation of a virtual environment for visualizing the geometry of curved spacetime by the display of interactive geodesics is described. This technique displays the paths of particles under the influence of gravity as described by the general theory of relativity and is useful in the investigation of solutions to the field equations of that theory. A boom-mounted six-degree-of-freedom head-position-sensitive stereo CRT system is used for display. A hand-position-sensitive glove controller is used to control the initial positions and directions of geodesics in spacetime. A multiprocessor graphics workstation is used for computation and rendering. Several techniques for visualizing the geometry of spacetime using geodesics are discussed. Although this work is described exclusively in the context of physical four-dimensional spacetimes, it extends to arbitrary geometries in arbitrary dimensions. While this work is intended for researchers, it is also useful for the teaching of general relativity.<<ETX>>","AuthorNamesDeduped":"Steve Bryson","AuthorNames":"S. Bryson","AuthorAffiliation":"NASA Ames Res. Center, Moffett Field, CA, USA","InternalReferences":"10.1109/VISUAL.1991.175771","AuthorKeywords":"","AminerCitationCount022019":"36","XPloreCitationCount022019":"4","PubsCited":"14","Award":""}},{"name":"Ming Jiang 0005","value":51,"numPapers":10,"cluster":"6","visible":1,"index":217,"weight":2,"x":181.87757774686224,"y":798.6614067280527,"px":183.94176047303858,"py":791.8567892231115,"node":{"Conference":"Vis","Year":"1999","Title":"The \"Parallel Vectors\" operator-a vector field visualization primitive","DOI":"10.1109/VISUAL.1999.809896","Link":"http://dx.doi.org/10.1109/VISUAL.1999.809896","FirstPage":"263","LastPage":"532","PaperType":"C","Abstract":"We propose an elementary operation on a pair of vector fields as a building block for defining and computing global line-type features of vector or scalar fields. While usual feature definitions often are procedural and therefore implicit, our operator allows precise mathematical definitions. It can serve as a basis for comparing feature definitions and for reuse of algorithms and implementations. Applications focus on vortex core methods.","AuthorNamesDeduped":"Ronald Peikert;Martin Roth","AuthorNames":"R. Peikert;M. Roth","AuthorAffiliation":"Dept. of Comput. Sci., ETH Zurich, Switzerland","InternalReferences":"10.1109/VISUAL.1998.745290;10.1109/VISUAL.1996.568137;10.1109/VISUAL.1998.745296;10.1109/VISUAL.1995.480795;10.1109/VISUAL.1994.346327;10.1109/VISUAL.1997.663894;10.1109/VISUAL.1998.745297;10.1109/VISUAL.1996.567807","AuthorKeywords":"","AminerCitationCount022019":"193","XPloreCitationCount022019":"71","PubsCited":"29","Award":""}},{"name":"David S. Thompson","value":51,"numPapers":12,"cluster":"6","visible":1,"index":218,"weight":2,"x":161.79813357905653,"y":755.0779196260484,"px":165.73307707881352,"py":749.2541935906702,"node":{"Conference":"Vis","Year":"1999","Title":"The \"Parallel Vectors\" operator-a vector field visualization primitive","DOI":"10.1109/VISUAL.1999.809896","Link":"http://dx.doi.org/10.1109/VISUAL.1999.809896","FirstPage":"263","LastPage":"532","PaperType":"C","Abstract":"We propose an elementary operation on a pair of vector fields as a building block for defining and computing global line-type features of vector or scalar fields. While usual feature definitions often are procedural and therefore implicit, our operator allows precise mathematical definitions. It can serve as a basis for comparing feature definitions and for reuse of algorithms and implementations. Applications focus on vortex core methods.","AuthorNamesDeduped":"Ronald Peikert;Martin Roth","AuthorNames":"R. Peikert;M. Roth","AuthorAffiliation":"Dept. of Comput. Sci., ETH Zurich, Switzerland","InternalReferences":"10.1109/VISUAL.1998.745290;10.1109/VISUAL.1996.568137;10.1109/VISUAL.1998.745296;10.1109/VISUAL.1995.480795;10.1109/VISUAL.1994.346327;10.1109/VISUAL.1997.663894;10.1109/VISUAL.1998.745297;10.1109/VISUAL.1996.567807","AuthorKeywords":"","AminerCitationCount022019":"193","XPloreCitationCount022019":"71","PubsCited":"29","Award":""}},{"name":"Xiaoqiang Zheng","value":100,"numPapers":31,"cluster":"6","visible":1,"index":219,"weight":13,"x":196.09995838742452,"y":639.2769739294635,"px":199.9835247746974,"py":634.2142802277958,"node":{"Conference":"Vis","Year":"1998","Title":"Interactive deformations from tensor fields","DOI":"10.1109/VISUAL.1998.745316","Link":"http://dx.doi.org/10.1109/VISUAL.1998.745316","FirstPage":"297","LastPage":"304","PaperType":"C","Abstract":"This paper presents techniques for interactively visualizing tensor fields using deformations. The conceptual idea behind this approach is to allow the tensor field to manifest its influence on idealized objects placed within the tensor field. This is similar, though not exactly the same, to surfaces deforming under load in order to relieve built up stress and strain. We illustrate the effectiveness of the Deviator-Isotropic tensor decomposition in deformation visualizations of CFD strain rate. We also investigate how directional flow techniques can be extended to distinguish between regions of tensile versus compressive forces.","AuthorNamesDeduped":"Ed Boring;Alex T. Pang","AuthorNames":"E. Boring;A. Pang","AuthorAffiliation":"Dept. of Comput. Sci., California Univ., Santa Cruz, CA, USA","InternalReferences":"10.1109/VISUAL.1997.663929;10.1109/VISUAL.1996.567752;10.1109/VISUAL.1993.398849;10.1109/VISUAL.1991.175773;10.1109/VISUAL.1992.235193;10.1109/VISUAL.1995.485141;10.1109/VISUAL.1994.346330;10.1109/VISUAL.1991.175789;10.1109/VISUAL.1994.346326;10.1109/VISUAL.1997.663857;10.1109/VISUAL.1992.235224;10.1109/VISUAL.1996.568139;10.1109/VISUAL.1994.346315","AuthorKeywords":"tensor,stress, strain, shear, normal,directional flow, symmetric, antisymmetric, deviator, isotropic","AminerCitationCount022019":"50","XPloreCitationCount022019":"9","PubsCited":"32","Award":""}},{"name":"Anna Vilanova","value":309,"numPapers":104,"cluster":"3","visible":1,"index":220,"weight":30,"x":526.7261141767444,"y":584.1148827055874,"px":526.8264375807927,"py":580.8397261064814,"node":{"Conference":"Vis","Year":"1999","Title":"Interactive exploration of extra- and interacranial blood vessels","DOI":"10.1109/VISUAL.1999.809912","Link":"http://dx.doi.org/10.1109/VISUAL.1999.809912","FirstPage":"389","LastPage":"547","PaperType":"C","Abstract":"We present a system for interactive explorations of extra- and intracranial blood vessels. Starting with a stack of images from 3D angiography, we use virtual clips to limit the segmentation of the vessel tree to the parts the neuroradiologists are interested in. Furthermore, methods of interactive virtual endoscopy are applied in order to provide an interior view of the blood vessels.","AuthorNamesDeduped":"Dirk Bartz;Wolfgang Straßer;Martin Skalej;Dorothea Welte","AuthorNames":"D. Bartz;W. Strasser;M. Skalej;D. Welte","AuthorAffiliation":"Wilhelm-Schickard-Inst. fur Inf., Tubingen Univ., Germany","InternalReferences":"10.1109/VISUAL.1998.745337;10.1109/VISUAL.1997.663915","AuthorKeywords":"","AminerCitationCount022019":"0","XPloreCitationCount022019":"6","PubsCited":"19","Award":""}},{"name":"Milos Srámek","value":80,"numPapers":18,"cluster":"3","visible":1,"index":221,"weight":7,"x":487.88648473102273,"y":646.9101764968482,"px":489.70263942306417,"py":641.7250174994767,"node":{"Conference":"Vis","Year":"1993","Title":"Accelerating volume animation by space-leaping","DOI":"10.1109/VISUAL.1993.398852","Link":"http://dx.doi.org/10.1109/VISUAL.1993.398852","FirstPage":"62","LastPage":"69","PaperType":"C","Abstract":"In this work we present a method for speeding the process of volume animation. It exploits coherency between consecutive images to shorten the path rays take through the volume. Rays are provided with the information needed to leap over the empty space and commence volume traversal at the vicinity of meaningful data. The algorithm starts by projecting the volume onto a C-buffer (coordinates-buffer) which stores the object-space coordinates of the first non-empty voxel visible from a pixel. Following a change in the viewing parameters, the C-buffer is transformed accordingly. Next, coordinates that possibly became hidden are discarded. The remaining values serve as an estimate of the point where the new rays should start their volume traversal. This method does not require 3-D preprocessing and does not suffer from any image degradation. It can be combined with existing acceleration techniques and can support any ray traversal algorithm and material modeling scheme.<<ETX>>","AuthorNamesDeduped":"Roni Yagel;Z. Shi","AuthorNames":"R. Yagel;Z. Shi","AuthorAffiliation":"Dept. of Comput. & Inf. Sci., Ohio State Univ., Columbbus, OH, USA;Dept. of Comput. & Inf. Sci., Ohio State Univ., Columbbus, OH, USA","InternalReferences":"10.1109/VISUAL.1992.235231","AuthorKeywords":"","AminerCitationCount022019":"178","XPloreCitationCount022019":"41","PubsCited":"16","Award":""}},{"name":"Tamara Munzner","value":1204,"numPapers":207,"cluster":"0","visible":1,"index":222,"weight":93,"x":521.1800610302621,"y":301.18757613086814,"px":525.013702501031,"py":303.8854924009021,"node":{"Conference":"InfoVis","Year":"1995","Title":"Case study: 3D displays of Internet traffic","DOI":"10.1109/INFVIS.1995.528697","Link":"http://dx.doi.org/10.1109/INFVIS.1995.528697","FirstPage":"129","LastPage":"131","PaperType":"C","Abstract":"The explosive growth in world-wide communications, especially the Internet, has highlighted the need for techniques to visualize network traffic. The traditional node and link network displays work well for small datasets but become visually cluttered and uninterpretable for large datasets. A natural 3D metaphor for displaying world-wide network data is to position the nodes on a globe and draw arcs between them coding the traffic. This technique has several advantages of over the traditional 2D displays, it naturally reduces line crossing clutter, provides an intuitive model for navigation and indication of time, and retains the geographic context. Coupling these strengths with some novel interaction techniques involving the globe surface translucency and arc heights illustrates the usefulness for this class of displays.","AuthorNamesDeduped":"Kenneth C. Cox;Stephen G. Eick","AuthorNames":"K.C. Cox;S.G. Eick","AuthorAffiliation":"AT&T Bell Labs., Naperville, IL, USA;AT&T Bell Labs., Naperville, IL, USA","InternalReferences":"10.1109/VISUAL.1993.398870","AuthorKeywords":"","AminerCitationCount022019":"50","XPloreCitationCount022019":"12","PubsCited":"8","Award":""}},{"name":"Wei Peng","value":185,"numPapers":14,"cluster":"2","visible":1,"index":223,"weight":2,"x":397.1153517641645,"y":99.1398854949363,"px":401.306198072925,"py":104.04495904573956,"node":{"Conference":"Vis","Year":"1990","Title":"Exploring N-dimensional databases","DOI":"10.1109/VISUAL.1990.146386","Link":"http://dx.doi.org/10.1109/VISUAL.1990.146386","FirstPage":"230","LastPage":"237","PaperType":"C","Abstract":"The authors present a tool for the display and analysis of N-dimensional data based on a technique called dimensional stacking. This technique is described. The primary goal is to create a tool that enables the user to project data of arbitrary dimensions onto a two-dimensional image. Of equal importance is the ability to control the viewing parameters, so that one can interactively adjust what ranges of values each dimension takes and the form in which the dimensions are displayed. This will allow an intuitive feel for the data to be developed as the database is explored. The system uses dimensional stacking, to collapse and N-dimension space down into a 2-D space and then render the values contained therein. Each value can then be represented as a pixel or rectangular region on a 2-D screen whose intensity corresponds to the data value at that point.<<ETX>>","AuthorNamesDeduped":"Jeffrey LeBlanc;Matthew O. Ward;Norman Wittels","AuthorNames":"J. LeBlanc;M.O. Ward;N. Wittels","AuthorAffiliation":"Worcester Polytech. Inst., MA, USA;Worcester Polytech. Inst., MA, USA;Worcester Polytech. Inst., MA, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"347","XPloreCitationCount022019":"89","PubsCited":"16","Award":""}},{"name":"Stefan Berchtold","value":121,"numPapers":3,"cluster":"2","visible":1,"index":224,"weight":2,"x":395.33242631310765,"y":155.68181504314342,"px":401.0271864891051,"py":159.51581748798188,"node":{"Conference":"Vis","Year":"1990","Title":"Parallel coordinates: a tool for visualizing multi-dimensional geometry","DOI":"10.1109/VISUAL.1990.146402","Link":"http://dx.doi.org/10.1109/VISUAL.1990.146402","FirstPage":"361","LastPage":"378","PaperType":"C","Abstract":"A methodology for visualizing analytic and synthetic geometry in R/sup N/ is presented. It is based on a system of parallel coordinates which induces a nonprojective mapping between N-dimensional and two-dimensional sets. Hypersurfaces are represented by their planar images which have some geometrical properties analogous to the properties of the hypersurface that they represent. A point from to line duality when N=2 generalizes to lines and hyperplanes enabling the representation of polyhedra in R/sup N/. The representation of a class of convex and non-convex hypersurfaces is discussed, together with an algorithm for constructing and displaying any interior point. The display shows some local properties of the hypersurface and provides information on the point's proximity to the boundary. Applications are discussed.<<ETX>>","AuthorNamesDeduped":"Alfred Inselberg;Bernard Dimsdale","AuthorNames":"A. Inselberg;B. Dimsdale","AuthorAffiliation":"IBM Sci. Center, Los Angeles, CA, USA;IBM Sci. Center, Los Angeles, CA, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"920","XPloreCitationCount022019":"308","PubsCited":"47","Award":""}},{"name":"Tolga Tasdizen","value":173,"numPapers":10,"cluster":"3","visible":1,"index":225,"weight":5,"x":374.95517971772557,"y":501.1959859154311,"px":379.3832133958281,"py":498.63443069234086,"node":{"Conference":"Vis","Year":"2002","Title":"Geometric surface smoothing via anisotropic diffusion of normals","DOI":"10.1109/VISUAL.2002.1183766","Link":"http://dx.doi.org/10.1109/VISUAL.2002.1183766","FirstPage":"125","LastPage":"132","PaperType":"C","Abstract":"This paper introduces a method for smoothing complex, noisy surfaces, while preserving (and enhancing) sharp, geometric features. It has two main advantages over previous approaches to feature preserving surface smoothing. First is the use of level set surface models, which allows us to process very complex shapes of arbitrary and changing topology. This generality makes it well suited for processing surfaces that are derived directly from measured data. The second advantage is that the proposed method derives from a well-founded formulation, which is a natural generalization of anisotropic diffusion, as used in image processing. This formulation is based on the proposition that the generalization of image filtering entails filtering the normals of the surface, rather than processing the positions of points on a mesh.","AuthorNamesDeduped":"Tolga Tasdizen;Ross T. Whitaker;Paul Burchard;Stanley Osher","AuthorNames":"T. Tasdizen;R. Whitaker;P. Burchard;S. Osher","AuthorAffiliation":"Sch. of Comput., Utah Univ., Salt Lake City, UT, USA","InternalReferences":"","AuthorKeywords":"anisotropic diffusion, surface fairing, geometric surface processing, intrinsic Laplacian of curvature, level sets","AminerCitationCount022019":"263","XPloreCitationCount022019":"67","PubsCited":"32","Award":""}},{"name":"Robert S. Laramee","value":115,"numPapers":68,"cluster":"6","visible":1,"index":226,"weight":9,"x":348.40345439506075,"y":511.6455962155751,"px":352.38768010555145,"py":508.7832163845412,"node":{"Conference":"Vis","Year":"2001","Title":"Lagrangian-Eulerian Advection for Unsteady Flow Visualization","DOI":"10.1109/VISUAL.2001.964493","Link":"http://doi.ieeecomputersociety.org/10.1109/VISUAL.2001.964492","FirstPage":"53","LastPage":"60","PaperType":"C","Abstract":"In this paper, we propose a new technique to visualize dense representations of time-dependent vector fields based on a Lagrangian-Eulerian Advection (LEA) scheme. The algorithm produces animations with high spatio-temporal correlation at interactive rates. With this technique, every still frame depicts the instantaneous structure of the flow, whereas an animated sequence of frames reveals the motion a dense collection of particles would take when released into the flow. The simplicity of both the resulting data structures and the implementation suggest that LEA could become a useful component of any scientific visualization toolkit concerned with the display of unsteady flows.","AuthorNamesDeduped":"Bruno Jobard;Gordon Erlebacher;M. Yousuff Hussaini","AuthorNames":"B. Jobard;G. Erlebacher;M. Yousuff Hussaini","AuthorAffiliation":"Sch. of Computational Sci. & Inf. Technol., Florida State Univ., Tallahassee, FL, USA;Sch. of Computational Sci. & Inf. Technol., Florida State Univ., Tallahassee, FL, USA;Sch. of Computational Sci. & Inf. Technol., Florida State Univ., Tallahassee, FL, USA","InternalReferences":"10.1109/VISUAL.2000.885689;10.1109/VISUAL.1994.346311;10.1109/VISUAL.1995.485146;10.1109/VISUAL.2000.885689","AuthorKeywords":"","AminerCitationCount022019":"93","XPloreCitationCount022019":"19","PubsCited":"13","Award":""}},{"name":"Peer-Timo Bremer","value":396,"numPapers":111,"cluster":"6","visible":1,"index":227,"weight":41,"x":260.561322190024,"y":416.08442983741105,"px":266.919046679236,"py":416.4253341379557,"node":{"Conference":"Vis","Year":"1998","Title":"Fast and memory efficient polygonal simplification","DOI":"10.1109/VISUAL.1998.745314","Link":"http://dx.doi.org/10.1109/VISUAL.1998.745314","FirstPage":"279","LastPage":"286","PaperType":"C","Abstract":"Conventional wisdom says that in order to produce high-quality simplified polygonal models, one must retain and use information about the original model during the simplification process. We demonstrate that excellent simplified models can be produced without the need to compare against information from the original geometry while performing local changes to the model. We use edge collapses to perform simplification, as do a number of other methods. We select the position of the new vertex so that the original volume of the model is maintained and we minimize the per-triangle change in volume of the tetrahedra swept out by those triangles that are moved. We also maintain surface area near boundaries and minimize the per-triangle area changes. Calculating the edge collapse priorities and the positions of the new vertices requires only the face connectivity and the the vertex locations in the intermediate model. This approach is memory efficient, allowing the simplification of very large polygonal models, and it is also fast. Moreover, simplified models created using this technique compare favorably to a number of other published simplification methods in terms of mean geometric error.","AuthorNamesDeduped":"Peter Lindstrom;Greg Turk","AuthorNames":"P. Lindstrom;G. Turk","AuthorAffiliation":"Georgia Inst. of Technol., Atlanta, GA, USA","InternalReferences":"10.1109/VISUAL.1995.485142;10.1109/VISUAL.1997.663883;10.1109/VISUAL.1997.663908;10.1109/VISUAL.1997.663906","AuthorKeywords":"","AminerCitationCount022019":"429","XPloreCitationCount022019":"94","PubsCited":"22","Award":""}},{"name":"Sung-Eui Yoon","value":17,"numPapers":22,"cluster":"6","visible":1,"index":228,"weight":3,"x":-110.18111273890804,"y":359.24294593424713,"px":-101.15996037392739,"py":356.94868964744956,"node":{"Conference":"Vis","Year":"2002","Title":"Optimized view-dependent rendering for large polygonal datasets","DOI":"10.1109/VISUAL.2002.1183760","Link":"http://dx.doi.org/10.1109/VISUAL.2002.1183760","FirstPage":"77","LastPage":"84","PaperType":"C","Abstract":"In this paper we are presenting a novel approach for rendering large datasets in a view-dependent manner. In a typical view-dependent rendering framework, an appropriate level of detail is selected and sent to the graphics hardware for rendering at each frame. In our approach, we have successfully managed to speed up the selection of the level of detail as well as the rendering of the selected levels. We have accelerated the selection of the appropriate level of detail by not scanning active nodes that do not contribute to the incremental update of the selected level of detail. Our idea is based on imposing a spatial subdivision over the view-dependence trees data-structure, which allows spatial tree cells to refine and merge in real-time rendering to comply with the changes in the active nodes list. The rendering of the selected level of detail is accelerated by using vertex arrays. To overcome the dynamic changes in the selected levels of detail we use multiple small vertex arrays whose sizes depend on the memory on the graphics hardware. These multiple vertex arrays are attached to the active cells of the spatial tree and represent the active nodes of these cells. These vertex arrays, which are sent to the graphics hardware at each frame, merge and split with respect to the changes in the cells of the spatial tree.","AuthorNamesDeduped":"Jihad El-Sana;Eitan Bachmant","AuthorNames":"J. El-Sana;E. Bachmat","AuthorAffiliation":"Dept. of Comput. Sci., Ben-Gurion Univ. of the Negev, Beer-Sheva, Israel;Dept. of Comput. Sci., Ben-Gurion Univ. of the Negev, Beer-Sheva, Israel","InternalReferences":"10.1109/VISUAL.1999.809877;10.1109/VISUAL.1997.663860;10.1109/VISUAL.2000.885724;10.1109/VISUAL.1998.745283;10.1109/VISUAL.1995.480805","AuthorKeywords":"Surface Simplification, Level of Detail, Multiresolution Hierarchies, View-Dependent Rendering","AminerCitationCount022019":"50","XPloreCitationCount022019":"9","PubsCited":"15","Award":""}},{"name":"Brian Salomon","value":15,"numPapers":11,"cluster":"6","visible":1,"index":229,"weight":1,"x":-266.8019292422006,"y":433.4280080481569,"px":-260.5358611673485,"py":427.06864478332903,"node":{"Conference":"Vis","Year":"2002","Title":"Optimized view-dependent rendering for large polygonal datasets","DOI":"10.1109/VISUAL.2002.1183760","Link":"http://dx.doi.org/10.1109/VISUAL.2002.1183760","FirstPage":"77","LastPage":"84","PaperType":"C","Abstract":"In this paper we are presenting a novel approach for rendering large datasets in a view-dependent manner. In a typical view-dependent rendering framework, an appropriate level of detail is selected and sent to the graphics hardware for rendering at each frame. In our approach, we have successfully managed to speed up the selection of the level of detail as well as the rendering of the selected levels. We have accelerated the selection of the appropriate level of detail by not scanning active nodes that do not contribute to the incremental update of the selected level of detail. Our idea is based on imposing a spatial subdivision over the view-dependence trees data-structure, which allows spatial tree cells to refine and merge in real-time rendering to comply with the changes in the active nodes list. The rendering of the selected level of detail is accelerated by using vertex arrays. To overcome the dynamic changes in the selected levels of detail we use multiple small vertex arrays whose sizes depend on the memory on the graphics hardware. These multiple vertex arrays are attached to the active cells of the spatial tree and represent the active nodes of these cells. These vertex arrays, which are sent to the graphics hardware at each frame, merge and split with respect to the changes in the cells of the spatial tree.","AuthorNamesDeduped":"Jihad El-Sana;Eitan Bachmant","AuthorNames":"J. El-Sana;E. Bachmat","AuthorAffiliation":"Dept. of Comput. Sci., Ben-Gurion Univ. of the Negev, Beer-Sheva, Israel;Dept. of Comput. Sci., Ben-Gurion Univ. of the Negev, Beer-Sheva, Israel","InternalReferences":"10.1109/VISUAL.1999.809877;10.1109/VISUAL.1997.663860;10.1109/VISUAL.2000.885724;10.1109/VISUAL.1998.745283;10.1109/VISUAL.1995.480805","AuthorKeywords":"Surface Simplification, Level of Detail, Multiresolution Hierarchies, View-Dependent Rendering","AminerCitationCount022019":"50","XPloreCitationCount022019":"9","PubsCited":"15","Award":""}},{"name":"Dirk Bartz","value":62,"numPapers":27,"cluster":"3","visible":1,"index":230,"weight":1,"x":684.3205837230616,"y":858.5004546685727,"px":678.6917301006424,"py":849.8087425893458,"node":{"Conference":"Vis","Year":"1998","Title":"Interactive virtual angioscopy","DOI":"10.1109/VISUAL.1998.745337","Link":"http://dx.doi.org/10.1109/VISUAL.1998.745337","FirstPage":"435","LastPage":"438","PaperType":"C","Abstract":"Virtual angioscopy is a non invasive medical procedure for exploring parts of the human vascular system. We have developed an interactive tool that takes as input, data acquired with standard medical imaging modalities and regards it as a virtual environment to be interactively inspected. The system supports real time navigation with stereoscopic direct volume rendering and dynamic endoscopic camera control, interactive tissue classification, and interactive point picking for morphological feature measurement. We provide an overview of the system, discuss the techniques used in our prototype, and present experimental results on human data sets.","AuthorNamesDeduped":"Enrico Gobbetti;Piero Pili;Antonio Zorcolo;Massimiliano Tuveri","AuthorNames":"E. Gobbetti;P. Pili;A. Zorcolo;M. Tuveri","AuthorAffiliation":"Center for Adv. Studies, Cagliari, Italy","InternalReferences":"10.1109/VISUAL.1997.663915","AuthorKeywords":"","AminerCitationCount022019":"68","XPloreCitationCount022019":"14","PubsCited":"29","Award":""}},{"name":"Holger Theisel","value":583,"numPapers":171,"cluster":"6","visible":1,"index":231,"weight":65,"x":333.4129581418145,"y":437.8029180447528,"px":337.5954199680832,"py":437.9213064218285,"node":{"Conference":"Vis","Year":"2000","Title":"Topology preserving compression of 2D vector fields","DOI":"10.1109/VISUAL.2000.885714","Link":"http://dx.doi.org/10.1109/VISUAL.2000.885714","FirstPage":"343","LastPage":"350","PaperType":"C","Abstract":"We present an algorithm for compressing 2D vector fields that preserves topology. Our approach is to simplify the given data set using constrained clustering. We employ different types of global and local error metrics including the earth mover's distance metric to measure the degradation in topology as well as weighted magnitude and angular errors. As a result, we obtain precise error bounds in the compressed vector fields. Experiments with both analytic and simulated data sets are presented. Results indicate that one can obtain significant compression with low errors without losing topology information.","AuthorNamesDeduped":"Suresh K. Lodha;Jose C. Renteria;Krishna M. Roskin","AuthorNames":"S.K. Lodha;J.C. Renteria;K.M. Roskin","AuthorAffiliation":"Dept. of Comput. Sci., California Univ., Santa Cruz, CA, USA","InternalReferences":"10.1109/VISUAL.1999.809865;10.1109/VISUAL.1998.745291;10.1109/VISUAL.1999.809907;10.1109/VISUAL.1998.745297;10.1109/VISUAL.1999.809863;10.1109/VISUAL.1999.809897;10.1109/VISUAL.1991.175773;10.1109/VISUAL.1997.663858;10.1109/VISUAL.1998.745284","AuthorKeywords":"compression, topology, vector fields, error metrics,clustering","AminerCitationCount022019":"53","XPloreCitationCount022019":"17","PubsCited":"15","Award":""}},{"name":"Hans-Peter Seidel","value":339,"numPapers":78,"cluster":"6","visible":1,"index":232,"weight":21,"x":279.2209118419553,"y":519.2713107462637,"px":284.1890289786172,"py":516.0897145562776,"node":{"Conference":"Vis","Year":"1997","Title":"ROAMing terrain: Real-time Optimally Adapting Meshes","DOI":"10.1109/VISUAL.1997.663860","Link":"http://dx.doi.org/10.1109/VISUAL.1997.663860","FirstPage":"81","LastPage":"88","PaperType":"C","Abstract":"Terrain visualization is a difficult problem for applications requiring accurate images of large datasets at high frame rates, such as flight simulation and ground-based aircraft testing using synthetic sensor simulation. On current graphics hardware, the problem is to maintain dynamic, view-dependent triangle meshes and texture maps that produce good images at the required frame rate. We present an algorithm for constructing triangle meshes that optimizes flexible view-dependent error metrics, produces guaranteed error bounds, achieves specified triangle counts directly and uses frame-to-frame coherence to operate at high frame rates for thousands of triangles per frame. Our method, dubbed Real-time Optimally Adapting Meshes (ROAM), uses two priority queues to drive split and merge operations that maintain continuous triangulations built from pre-processed bintree triangles. We introduce two additional performance optimizations: incremental triangle stripping and priority-computation deferral lists. ROAM's execution time is proportional to the number of triangle changes per frame, which is typically a few percent of the output mesh size; hence ROAM's performance is insensitive to the resolution and extent of the input terrain. Dynamic terrain and simple vertex morphing are supported.","AuthorNamesDeduped":"Mark A. Duchaineau;Murray Wolinsky;David E. Sigeti;Mark C. Miller;Charles Aldrich;Mark B. Mineev-Weinstein","AuthorNames":"M. Duchaineau;M. Wolinsky;D.E. Sigeti;M.C. Miller;C. Aldrich;M.B. Mineev-Weinstein","AuthorAffiliation":"Los Alamos Nat. Lab., NM, USA","InternalReferences":"10.1109/VISUAL.1996.567600;10.1109/VISUAL.1996.568126;10.1109/VISUAL.1996.568125;10.1109/VISUAL.1995.480813;10.1109/VISUAL.1995.480805","AuthorKeywords":"triangle bintree, view-dependent mesh, frame-to-frame coherence, greedy algorithms","AminerCitationCount022019":"1260","XPloreCitationCount022019":"170","PubsCited":"19","Award":""}},{"name":"Tino Weinkauf","value":243,"numPapers":80,"cluster":"6","visible":1,"index":233,"weight":24,"x":255.97369141690805,"y":504.8624431516112,"px":261.85337389836786,"py":503.12206977841186,"node":{"Conference":"Vis","Year":"2000","Title":"Topology preserving compression of 2D vector fields","DOI":"10.1109/VISUAL.2000.885714","Link":"http://dx.doi.org/10.1109/VISUAL.2000.885714","FirstPage":"343","LastPage":"350","PaperType":"C","Abstract":"We present an algorithm for compressing 2D vector fields that preserves topology. Our approach is to simplify the given data set using constrained clustering. We employ different types of global and local error metrics including the earth mover's distance metric to measure the degradation in topology as well as weighted magnitude and angular errors. As a result, we obtain precise error bounds in the compressed vector fields. Experiments with both analytic and simulated data sets are presented. Results indicate that one can obtain significant compression with low errors without losing topology information.","AuthorNamesDeduped":"Suresh K. Lodha;Jose C. Renteria;Krishna M. Roskin","AuthorNames":"S.K. Lodha;J.C. Renteria;K.M. Roskin","AuthorAffiliation":"Dept. of Comput. Sci., California Univ., Santa Cruz, CA, USA","InternalReferences":"10.1109/VISUAL.1999.809865;10.1109/VISUAL.1998.745291;10.1109/VISUAL.1999.809907;10.1109/VISUAL.1998.745297;10.1109/VISUAL.1999.809863;10.1109/VISUAL.1999.809897;10.1109/VISUAL.1991.175773;10.1109/VISUAL.1997.663858;10.1109/VISUAL.1998.745284","AuthorKeywords":"compression, topology, vector fields, error metrics,clustering","AminerCitationCount022019":"53","XPloreCitationCount022019":"17","PubsCited":"15","Award":""}},{"name":"Tom Bobach","value":42,"numPapers":5,"cluster":"6","visible":1,"index":234,"weight":1,"x":-7.910652859723207,"y":599.7819114126432,"px":-2.7252058483992414,"py":598.2161770561665,"node":{"Conference":"Vis","Year":"1993","Title":"Implicit stream surfaces","DOI":"10.1109/VISUAL.1993.398875","Link":"http://dx.doi.org/10.1109/VISUAL.1993.398875","FirstPage":"245","LastPage":"252","PaperType":"C","Abstract":"Streamlines and stream surfaces are well known techniques for the visualization of fluid flow. For steady velocity fields, a streamline is the trace of a particle, and a stream surface is the trace of a curve. Here a new method is presented for the construction of stream surfaces. The central concept is the representation of a stream surface as an implicit surface f (x) = C. After the initial calculation of f a family of stream surfaces can be generated efficiently by varying C. The shapes of the originating curves are defined by the value of f at the boundary. Two techniques are presented for the calculation of f: one based on solving the convection equation, the other on backward tracing of the trajectories of grid points. The flow around objects is discussed separately. With this method irregular topologies of the originating curves and of the stream surfaces can be handled easily. Further, it can also be used for other visualization techniques, such as time surfaces and stream volumes. Finally, an effective method for the automatic placement of originating curves is presented.<<ETX>>","AuthorNamesDeduped":"Jarke J. van Wijk","AuthorNames":"J.J. van Wijk","AuthorAffiliation":"Netherlands Energy Res. Foundation, Petten, Netherlands","InternalReferences":"10.1109/VISUAL.1992.235211;10.1109/VISUAL.1992.235225;10.1109/VISUAL.1990.146359","AuthorKeywords":"","AminerCitationCount022019":"173","XPloreCitationCount022019":"40","PubsCited":"13","Award":""}},{"name":"Karim Mahrous","value":42,"numPapers":5,"cluster":"6","visible":1,"index":235,"weight":1,"x":-27.68704082591476,"y":574.9348488058365,"px":-21.712341357440234,"py":573.9358557718634,"node":{"Conference":"Vis","Year":"1993","Title":"Implicit stream surfaces","DOI":"10.1109/VISUAL.1993.398875","Link":"http://dx.doi.org/10.1109/VISUAL.1993.398875","FirstPage":"245","LastPage":"252","PaperType":"C","Abstract":"Streamlines and stream surfaces are well known techniques for the visualization of fluid flow. For steady velocity fields, a streamline is the trace of a particle, and a stream surface is the trace of a curve. Here a new method is presented for the construction of stream surfaces. The central concept is the representation of a stream surface as an implicit surface f (x) = C. After the initial calculation of f a family of stream surfaces can be generated efficiently by varying C. The shapes of the originating curves are defined by the value of f at the boundary. Two techniques are presented for the calculation of f: one based on solving the convection equation, the other on backward tracing of the trajectories of grid points. The flow around objects is discussed separately. With this method irregular topologies of the originating curves and of the stream surfaces can be handled easily. Further, it can also be used for other visualization techniques, such as time surfaces and stream volumes. Finally, an effective method for the automatic placement of originating curves is presented.<<ETX>>","AuthorNamesDeduped":"Jarke J. van Wijk","AuthorNames":"J.J. van Wijk","AuthorAffiliation":"Netherlands Energy Res. Foundation, Petten, Netherlands","InternalReferences":"10.1109/VISUAL.1992.235211;10.1109/VISUAL.1992.235225;10.1109/VISUAL.1990.146359","AuthorKeywords":"","AminerCitationCount022019":"173","XPloreCitationCount022019":"40","PubsCited":"13","Award":""}},{"name":"Wolfgang Kollmann","value":93,"numPapers":15,"cluster":"6","visible":1,"index":236,"weight":5,"x":203.73954960886635,"y":496.17546057447595,"px":210.70339631659687,"py":495.20778610159266,"node":{"Conference":"Vis","Year":"1993","Title":"Implicit stream surfaces","DOI":"10.1109/VISUAL.1993.398875","Link":"http://dx.doi.org/10.1109/VISUAL.1993.398875","FirstPage":"245","LastPage":"252","PaperType":"C","Abstract":"Streamlines and stream surfaces are well known techniques for the visualization of fluid flow. For steady velocity fields, a streamline is the trace of a particle, and a stream surface is the trace of a curve. Here a new method is presented for the construction of stream surfaces. The central concept is the representation of a stream surface as an implicit surface f (x) = C. After the initial calculation of f a family of stream surfaces can be generated efficiently by varying C. The shapes of the originating curves are defined by the value of f at the boundary. Two techniques are presented for the calculation of f: one based on solving the convection equation, the other on backward tracing of the trajectories of grid points. The flow around objects is discussed separately. With this method irregular topologies of the originating curves and of the stream surfaces can be handled easily. Further, it can also be used for other visualization techniques, such as time surfaces and stream volumes. Finally, an effective method for the automatic placement of originating curves is presented.<<ETX>>","AuthorNamesDeduped":"Jarke J. van Wijk","AuthorNames":"J.J. van Wijk","AuthorAffiliation":"Netherlands Energy Res. Foundation, Petten, Netherlands","InternalReferences":"10.1109/VISUAL.1992.235211;10.1109/VISUAL.1992.235225;10.1109/VISUAL.1990.146359","AuthorKeywords":"","AminerCitationCount022019":"173","XPloreCitationCount022019":"40","PubsCited":"13","Award":""}},{"name":"David M. Weinstein","value":127,"numPapers":12,"cluster":"6","visible":1,"index":237,"weight":2,"x":45.65490790393149,"y":707.2041723872377,"px":47.20753011674431,"py":700.735762870904,"node":{"Conference":"Vis","Year":"1990","Title":"Moving iconic objects in scientific visualization","DOI":"10.1109/VISUAL.1990.146373","Link":"http://dx.doi.org/10.1109/VISUAL.1990.146373","FirstPage":"124","LastPage":"130, 468","PaperType":"C","Abstract":"The idea of independently moving, interacting graphical objects is introduced as a method for the visualization of continuous fields. Bird-oid objects or boids are discussed. These boids derive from: (1) icons which are geometric objects whose shape and appearance are related to the field variables, (2) three-dimensional cursors by which a user interactively picks a point in space, (3) particle traces, which are numerically integrated trajectories in space, (4) moving frames of vectors along space curves, and (5) actors, which are programming objects that can create and destroy instances of themselves, act according to internal logic, and communicate with each other and with a user. A software prototype in the C++ language has been developed which demonstrates some of the capabilities of these objects for the visualization of scalar, vector, and tensor fields defined over finite elements or finite volumes.<<ETX>>","AuthorNamesDeduped":"G. David Kerlick","AuthorNames":"D.G. Kerlick","AuthorAffiliation":"Tektronix Labs., Beaverton, OR, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"47","XPloreCitationCount022019":"12","PubsCited":"22","Award":""}},{"name":"Ye Zhao","value":134,"numPapers":51,"cluster":"5","visible":1,"index":238,"weight":7,"x":584.8312265631967,"y":548.3532028868534,"px":584.3812164644036,"py":544.2935030574431,"node":{"Conference":"Vis","Year":"2002","Title":"Simulating fire with texture splats","DOI":"10.1109/VISUAL.2002.1183779","Link":"http://dx.doi.org/10.1109/VISUAL.2002.1183779","FirstPage":"227","LastPage":"234","PaperType":"C","Abstract":"We propose the use of textured splats as the basic display primitives for an open surface fire model. The high-detail textures help to achieve a smooth boundary of the fire and gain the small-scale turbulence appearance. We utilize the Lattice Boltzmann Model (LBM) to simulate physically-based equations describing the fire evolution and its interaction with the environment (e.g., obstacles, wind and temperature). The property of fuel and non-burning objects are defined on the lattice of the computation domain. A temperature field is also incorporated to model the generation of smoke from the fire due to incomplete combustion. The linear and local characteristics of the LBM enable us to accelerate the computation with graphics hardware to reach real-time simulation speed, while the texture splat primitives enable interactive rendering frame rates.","AuthorNamesDeduped":"Xiaoming Wei;Wei Li 0004;Klaus Mueller;Arie E. Kaufman","AuthorNames":"Xiaoming Wei;Wei Li;K. Mueller;A. Kaufman","AuthorAffiliation":"Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA;Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA;Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA;Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA","InternalReferences":"10.1109/VISUAL.1993.398877","AuthorKeywords":"Fire Modeling, Textured Splatting, Lattice Boltzmann Model, Graphics Hardware","AminerCitationCount022019":"121","XPloreCitationCount022019":"9","PubsCited":"23","Award":""}},{"name":"Wolfgang Straßer","value":210,"numPapers":20,"cluster":"4","visible":1,"index":239,"weight":5,"x":302.8081830285235,"y":604.0610628623167,"px":307.32623053812745,"py":600.3205872262341,"node":{"Conference":"Vis","Year":"1994","Title":"Discretized Marching Cubes","DOI":"10.1109/VISUAL.1994.346308","Link":"http://dx.doi.org/10.1109/VISUAL.1994.346308","FirstPage":"281","LastPage":"287, C32","PaperType":"C","Abstract":"Since the introduction of standard techniques for isosurface extraction from volumetric datasets, one of the hardest problems has been to reduce the number of triangles (or polygons) generated. The paper presents an algorithm that considerably reduces the number of polygons generated by a Marching Cubes-like scheme (W. Lorensen and H. Cline, 1987) without excessively increasing the overall computational complexity. The algorithm assumes discretization of the dataset space and replaces cell edge interpolation by midpoint selection. Under these assumptions, the extracted surfaces are composed of polygons lying within a finite number of incidences, thus allowing simple merging of the output facets into large coplanar polygons. An experimental evaluation of the proposed approach on datasets related to biomedical imaging and chemical modelling is reported.<<ETX>>","AuthorNamesDeduped":"Claudio Montani;Riccardo Scateni;Roberto Scopigno","AuthorNames":"C. Montani;R. Scateni;R. Scopigno","AuthorAffiliation":"CNR, Pisa, Italy","InternalReferences":"10.1109/VISUAL.1992.235223","AuthorKeywords":"","AminerCitationCount022019":"274","XPloreCitationCount022019":"44","PubsCited":"16","Award":""}},{"name":"Jens H. Krüger","value":264,"numPapers":47,"cluster":"4","visible":1,"index":240,"weight":11,"x":396.81703395026943,"y":511.3013439915403,"px":399.57694481988966,"py":507.25739896717005,"node":{"Conference":"Vis","Year":"1999","Title":"Enabling Classification and Shading for 3D Texture Mapping based Volume Rendering using OpenGL and Extensions","DOI":"10.1109/VISUAL.1999.809889","Link":"http://dx.doi.org/10.1109/VISUAL.1999.809889","FirstPage":"207","LastPage":"526","PaperType":"C","Abstract":"We present a new technique which enables direct volume rendering based on 3D texture mapping hardware, enabling shading as well as classification of the interpolated data. Our technique supports accurate lighting for a one directional light source, semi-transparent classification, and correct blending. To circumvent the limitations of one general classification, we introduce multiple classification spaces which are very valuable to understand the visualized data, and even mandatory to comprehensively grasp the 3D relationship of different materials present in the volumetric data. Furthermore, we illustrate how multiple classification spaces can be realized using existing graphics hardware. In contrast to previously reported algorithms, our technique is capable of performing all the above mentioned tasks within the graphics pipeline. Therefore, it is very efficient: The three dimensional texture needs to be stored only once and no load is put onto the CPU. Besides using standard OpenGL functionality, we exploit advanced per pixel operations and make use of available OpenGL extensions.","AuthorNamesDeduped":"Michael Meißner;Ulrich Hoffmann;Wolfgang Straßer","AuthorNames":"M. Meissner;U. Hoffmann;W. Strasser","AuthorAffiliation":"Comput. Graphics Lab., Tubingen Univ., Germany","InternalReferences":"","AuthorKeywords":"Volume Rendering, 3D Texture Mapping, Rectilinear Grid, Shading, Classification, OpenGL","AminerCitationCount022019":"","XPloreCitationCount022019":"10","PubsCited":"23","Award":""}},{"name":"Jens Schneider","value":105,"numPapers":37,"cluster":"4","visible":1,"index":241,"weight":4,"x":417.77301790446694,"y":512.7949877251307,"px":420.7363463908836,"py":511.3732729119772,"node":{"Conference":"Vis","Year":"1999","Title":"A fast volume rendering algorithm for time-varying fields using a time-space partitioning (TSP) tree","DOI":"10.1109/VISUAL.1999.809910","Link":"http://dx.doi.org/10.1109/VISUAL.1999.809910","FirstPage":"371","LastPage":"545","PaperType":"C","Abstract":"We present a fast volume rendering algorithm for time-varying fields. We propose a new data structure, called time-space partitioning (TSP) tree, that can effectively capture both the spatial and the temporal coherence from a time-varying field. Using the proposed data structure, the rendering speed is substantially improved. In addition, our data structure helps to maintain the memory access locality and to provide the sparse data traversal so that our algorithm becomes suitable for large-scale out-of-core applications. Finally, our algorithm allows flexible error control for both the temporal and the spatial coherence so that a trade-off between image quality and rendering speed is possible. We demonstrate the utility and speed of our algorithm with data from several time-varying CFD simulations. Our rendering algorithm can achieve substantial speedup while the storage space overhead for the TSP tree is kept at a minimum.","AuthorNamesDeduped":"Han-Wei Shen;Ling-Jan Chiang;Kwan-Liu Ma","AuthorNames":"H.-W. Shen;L.-J. Chiang;K.-L. Ma","AuthorAffiliation":"MRJ Technol. Solutions, NASA Ames Res. Center, Moffett Field, CA, USA","InternalReferences":"10.1109/VISUAL.1998.745713;10.1109/VISUAL.1997.663888;10.1109/VISUAL.1996.567609;10.1109/VISUAL.1998.745298;10.1109/VISUAL.1995.480809","AuthorKeywords":"scalar field visualization, volume visualization, volume rendering, time-varying fields","AminerCitationCount022019":"232","XPloreCitationCount022019":"59","PubsCited":"15","Award":""}},{"name":"Stefan Guthe","value":125,"numPapers":15,"cluster":"4","visible":1,"index":242,"weight":5,"x":303.1664752750396,"y":617.0363667477856,"px":307.46053373462684,"py":612.3490368748086,"node":{"Conference":"Vis","Year":"1998","Title":"Progressive tetrahedralizations","DOI":"10.1109/VISUAL.1998.745329","Link":"http://dx.doi.org/10.1109/VISUAL.1998.745329","FirstPage":"397","LastPage":"402","PaperType":"C","Abstract":"The paper describes some fundamental issues for robust implementations of progressively refined tetrahedralizations generated through sequences of edge collapses. We address the definition of appropriate cost functions and explain on various tests which are necessary to preserve the consistency of the mesh when collapsing edges. Although considered a special case of progressive simplicial complexes (J. Popovic and H. Hoppe, 1997), the results of our method are of high practical importance and can be used in many different applications, such as finite element meshing, scattered data interpolation, or rendering of unstructured volume data.","AuthorNamesDeduped":"Oliver G. Staadt;Markus H. Gross","AuthorNames":"O.G. Staadt;M.H. Gross","AuthorAffiliation":"Comput. Graphics Res. Group, Fed.. Inst. of Technol., Zurich, Switzerland","InternalReferences":"10.1109/VISUAL.1997.663907;10.1109/VISUAL.1997.663901;10.1109/VISUAL.1997.663883","AuthorKeywords":"mesh simplification, multiresolution, level-of-detail, unstructured meshes, mesh generation","AminerCitationCount022019":"175","XPloreCitationCount022019":"37","PubsCited":"16","Award":""}},{"name":"Markus Hadwiger","value":299,"numPapers":140,"cluster":"4","visible":1,"index":243,"weight":40,"x":396.92573203643707,"y":480.64742781694025,"px":400.23515957957767,"py":478.1698288236221,"node":{"Conference":"Vis","Year":"1998","Title":"High quality rendering of attributed volume data","DOI":"10.1109/VISUAL.1998.745311","Link":"http://dx.doi.org/10.1109/VISUAL.1998.745311","FirstPage":"255","LastPage":"262","PaperType":"C","Abstract":"For high quality rendering of objects segmented from tomographic volume data the precise location of the boundaries of adjacent objects in subvoxel resolution is required. We describe a new method that determines the membership of a given sample point to an object by reclassifying the sample point using interpolation of the original intensity values and searching for the best fitting object in the neighbourhood. Using a ray-casting approach we then compute the surface location between successive sample points along the viewing-ray by interpolation or bisection. The accurate calculation of the object boundary enables a much more precise computation of the gray-level-gradient yielding the surface normal. Our new approach significantly improves the quality of reconstructed and shaded surfaces and reduces aliasing artifacts for animations and magnified views. We illustrate the results on different cases including the Visible-Human-Data, where we achieve nearly photo-realistic images.","AuthorNamesDeduped":"Ulf Tiede;Thomas Schiemann;Karl Heinz Höhne","AuthorNames":"U. Tiede;T. Schiemann;K.H. Hohne","AuthorAffiliation":"Inst. of Math. & Comput. Sci. in Med., Eppendorf Univ. Hosp., Hamburg, Germany","InternalReferences":"","AuthorKeywords":"partial-volume-effect, ray-casting, tomographic data,Visible-Human-Project","AminerCitationCount022019":"143","XPloreCitationCount022019":"37","PubsCited":"15","Award":""}},{"name":"Jinzhu Gao","value":36,"numPapers":34,"cluster":"4","visible":1,"index":244,"weight":6,"x":319.02635827590353,"y":525.6964490381463,"px":323.86181130948415,"py":523.2161616524135,"node":{"Conference":"Vis","Year":"2002","Title":"Interactive rendering of large volume data sets","DOI":"10.1109/VISUAL.2002.1183757","Link":"http://dx.doi.org/10.1109/VISUAL.2002.1183757","FirstPage":"53","LastPage":"60","PaperType":"C","Abstract":"We present a new algorithm for rendering very large volume data sets at interactive frame rates on standard PC hardware. The algorithm accepts scalar data sampled on a regular grid as input. The input data is converted into a compressed hierarchical wavelet representation in a preprocessing step. During rendering, the wavelet representation is decompressed on-the-fly and rendered using hardware texture mapping. The level of detail used for rendering is adapted to the local frequency spectrum of the data and its position relative to the viewer. Using a prototype implementation of the algorithm we were able to perform an interactive walkthrough of large data sets such as the visible human on a single off-the-shelf PC.","AuthorNamesDeduped":"Stefan Guthe;Michael Wand;Julius Gonser;Wolfgang Straßer","AuthorNames":"S. Guthe;M. Wand;J. Gonser;W. Strasser","AuthorAffiliation":"WSI/GRIS, Tubingen Univ., Germany;WSI/GRIS, Tubingen Univ., Germany;WSI/GRIS, Tubingen Univ., Germany;WSI/GRIS, Tubingen Univ., Germany","InternalReferences":"10.1109/VISUAL.2001.964531;10.1109/VISUAL.1999.809908;10.1109/VISUAL.1999.809889;10.1109/VISUAL.1993.398845;10.1109/VISUAL.2001.964519","AuthorKeywords":"Compression Algorithms, Level of Detail Algorithms, Scientific Visualization, Volume Rendering, Wavelets","AminerCitationCount022019":"296","XPloreCitationCount022019":"62","PubsCited":"36","Award":""}},{"name":"Jian Huang 0007","value":87,"numPapers":61,"cluster":"4","visible":1,"index":245,"weight":8,"x":322.5763302132931,"y":502.300618872592,"px":326.98487864815877,"py":500.34542636995747,"node":{"Conference":"Vis","Year":"2002","Title":"Interactive rendering of large volume data sets","DOI":"10.1109/VISUAL.2002.1183757","Link":"http://dx.doi.org/10.1109/VISUAL.2002.1183757","FirstPage":"53","LastPage":"60","PaperType":"C","Abstract":"We present a new algorithm for rendering very large volume data sets at interactive frame rates on standard PC hardware. The algorithm accepts scalar data sampled on a regular grid as input. The input data is converted into a compressed hierarchical wavelet representation in a preprocessing step. During rendering, the wavelet representation is decompressed on-the-fly and rendered using hardware texture mapping. The level of detail used for rendering is adapted to the local frequency spectrum of the data and its position relative to the viewer. Using a prototype implementation of the algorithm we were able to perform an interactive walkthrough of large data sets such as the visible human on a single off-the-shelf PC.","AuthorNamesDeduped":"Stefan Guthe;Michael Wand;Julius Gonser;Wolfgang Straßer","AuthorNames":"S. Guthe;M. Wand;J. Gonser;W. Strasser","AuthorAffiliation":"WSI/GRIS, Tubingen Univ., Germany;WSI/GRIS, Tubingen Univ., Germany;WSI/GRIS, Tubingen Univ., Germany;WSI/GRIS, Tubingen Univ., Germany","InternalReferences":"10.1109/VISUAL.2001.964531;10.1109/VISUAL.1999.809908;10.1109/VISUAL.1999.809889;10.1109/VISUAL.1993.398845;10.1109/VISUAL.2001.964519","AuthorKeywords":"Compression Algorithms, Level of Detail Algorithms, Scientific Visualization, Volume Rendering, Wavelets","AminerCitationCount022019":"296","XPloreCitationCount022019":"62","PubsCited":"36","Award":""}},{"name":"James Arthur Kohl","value":31,"numPapers":26,"cluster":"4","visible":1,"index":246,"weight":5,"x":275.82068200051054,"y":560.2097421567937,"px":280.94867346512996,"py":557.6191077130271,"node":{"Conference":"Vis","Year":"2002","Title":"Interactive rendering of large volume data sets","DOI":"10.1109/VISUAL.2002.1183757","Link":"http://dx.doi.org/10.1109/VISUAL.2002.1183757","FirstPage":"53","LastPage":"60","PaperType":"C","Abstract":"We present a new algorithm for rendering very large volume data sets at interactive frame rates on standard PC hardware. The algorithm accepts scalar data sampled on a regular grid as input. The input data is converted into a compressed hierarchical wavelet representation in a preprocessing step. During rendering, the wavelet representation is decompressed on-the-fly and rendered using hardware texture mapping. The level of detail used for rendering is adapted to the local frequency spectrum of the data and its position relative to the viewer. Using a prototype implementation of the algorithm we were able to perform an interactive walkthrough of large data sets such as the visible human on a single off-the-shelf PC.","AuthorNamesDeduped":"Stefan Guthe;Michael Wand;Julius Gonser;Wolfgang Straßer","AuthorNames":"S. Guthe;M. Wand;J. Gonser;W. Strasser","AuthorAffiliation":"WSI/GRIS, Tubingen Univ., Germany;WSI/GRIS, Tubingen Univ., Germany;WSI/GRIS, Tubingen Univ., Germany;WSI/GRIS, Tubingen Univ., Germany","InternalReferences":"10.1109/VISUAL.2001.964531;10.1109/VISUAL.1999.809908;10.1109/VISUAL.1999.809889;10.1109/VISUAL.1993.398845;10.1109/VISUAL.2001.964519","AuthorKeywords":"Compression Algorithms, Level of Detail Algorithms, Scientific Visualization, Volume Rendering, Wavelets","AminerCitationCount022019":"296","XPloreCitationCount022019":"62","PubsCited":"36","Award":""}},{"name":"Jonathan Woodring","value":128,"numPapers":39,"cluster":"4","visible":1,"index":247,"weight":5,"x":304.608578105522,"y":353.3313330713042,"px":310.3609276066434,"py":355.2115045517685,"node":{"Conference":"Vis","Year":"2001","Title":"Interactive volume rendering using multi-dimensional transfer functions and direct manipulation widgets","DOI":"10.1109/VISUAL.2001.964519","Link":"http://dx.doi.org/10.1109/VISUAL.2001.964519","FirstPage":"255","LastPage":"262","PaperType":"C","Abstract":"Most direct volume renderings produced today employ one-dimensional transfer functions, which assign color and opacity to the volume based solely on the single scalar quantity which comprises the dataset. Though they have not received widespread attention, multi-dimensional transfer functions are a very effective way to extract specific material boundaries and convey subtle surface properties. However, identifying good transfer functions is difficult enough in one dimension, let alone two or three dimensions. This paper demonstrates an important class of three-dimensional transfer functions for scalar data (based on data value, gradient magnitude, and a second directional derivative), and describes a set of direct manipulation widgets which make specifying such transfer functions intuitive and convenient. We also describe how to use modem graphics hardware to interactively render with multi-dimensional transfer functions. The transfer functions, widgets, and hardware combine to form a powerful system for interactive volume exploration.","AuthorNamesDeduped":"Joe Michael Kniss;Gordon L. Kindlmann;Charles D. Hansen","AuthorNames":"J. Kniss;G. Kindlmann;C. Hansen","AuthorAffiliation":"Sch. of Comput., Utah Univ., Salt Lake City, UT, USA;Sch. of Comput., Utah Univ., Salt Lake City, UT, USA;Sch. of Comput., Utah Univ., Salt Lake City, UT, USA","InternalReferences":"10.1109/VISUAL.1995.480803;10.1109/VISUAL.1999.809908;10.1109/VISUAL.1999.809889;10.1109/VISUAL.1996.568113;10.1109/VISUAL.1997.663875","AuthorKeywords":"volume visualization, direct volume rendering, multi-dimensional transfer functions, direct manipulation widgets, graphics hardware","AminerCitationCount022019":"514","XPloreCitationCount022019":"123","PubsCited":"34","Award":"BP"}},{"name":"Issei Fujishiro","value":142,"numPapers":25,"cluster":"6","visible":1,"index":248,"weight":2,"x":181.4443014135947,"y":373.4589984192489,"px":187.5045412482385,"py":379.1716543946418,"node":{"Conference":"Vis","Year":"1991","Title":"The asymptotic decider: resolving the ambiguity in marching cubes","DOI":"10.1109/VISUAL.1991.175782","Link":"http://dx.doi.org/10.1109/VISUAL.1991.175782","FirstPage":"83","LastPage":"91, 413","PaperType":"C","Abstract":"A method for computing isovalue or contour surfaces of a trivariate function is discussed. The input data are values of the trivariate function, F/sub ijk/, at the cuberille grid points (x/sub i/, y/sub j/, z/sub k/), and the output of a collection of triangles representing the surface consisting of all points where F(x,y,z) is a constant value. The method is a modification that is intended to correct a problem with a previous method.<<ETX>>","AuthorNamesDeduped":"Gregory M. Nielson;Bernd Hamann","AuthorNames":"G.M. Nielson;B. Hamann","AuthorAffiliation":"Dept. of Comput. Sci., Arizona State Univ., Tempe, AZ, USA;Dept. of Comput. Sci., Arizona State Univ., Tempe, AZ, USA","InternalReferences":"10.1109/VISUAL.1990.146363","AuthorKeywords":"","AminerCitationCount022019":"697","XPloreCitationCount022019":"146","PubsCited":"16","Award":""}},{"name":"Yuriko Takeshima","value":116,"numPapers":14,"cluster":"5","visible":1,"index":249,"weight":1,"x":133.63025918671147,"y":198.63610246233318,"px":138.52877539372253,"py":203.3627107405119,"node":{"Conference":"Vis","Year":"1990","Title":"A problem-oriented classification of visualization techniques","DOI":"10.1109/VISUAL.1990.146375","Link":"http://dx.doi.org/10.1109/VISUAL.1990.146375","FirstPage":"139","LastPage":"143, 469","PaperType":"C","Abstract":"Progress in scientific visualization could be accelerated if workers could more readily find visualization techniques relevant to a given problem. The authors describe an approach to this problem, based on a classification of visualization techniques, that is independent of particular application domains. A user breaks up a problem into subproblems, describes these subproblems in terms of the objects to be represented and the operations to be supported by a representation, locates applicable visualization techniques in a catalog, and combines these representations into a composite representation for the original problem. The catalog and its underlying classification provide a way for workers in different application disciplines to share methods.<<ETX>>","AuthorNamesDeduped":"Stephen Wehrend;Clayton Lewis","AuthorNames":"S. Wehrend;C. Lewis","AuthorAffiliation":"Colorado Univ., Boulder, CO, USA;Colorado Univ., Boulder, CO, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"353","XPloreCitationCount022019":"90","PubsCited":"6","Award":""}},{"name":"Alfred Kobsa","value":52,"numPapers":8,"cluster":"0","visible":1,"index":250,"weight":1,"x":476.69601703478736,"y":-154.60758690124186,"px":476.4723456771776,"py":-151.28954575711543,"node":{"Conference":"InfoVis","Year":"1995","Title":"IVEE: an Information Visualization and Exploration Environment","DOI":"10.1109/INFVIS.1995.528688","Link":"http://dx.doi.org/10.1109/INFVIS.1995.528688","FirstPage":"66","LastPage":"73","PaperType":"C","Abstract":"The Information Visualization and Exploration Environment (NEE) is a system for automatic creation of dynamic queries applications. IVEE imports database relations and automatically creates environments holding visualizations and query devices. IVEE offers multiple visualizations such as maps and starfields, and multiple query devices, such as sliders, alphasliders, and toggles. Arbitrary graphical objects can be attached to database objects in visualizations. Multiple visualizations may be active simultaneously. Users can interactively lay out and change between types of query devices. Users may retrieve details-on-demand by clicking on visualization objects. An HTML file may be provided along with the database, specifying how details-on-demand information should be presented, allowing for presentation of multimedia information in database objects. Finally, multiple IVEE clients running on separate workstations on a network can communicate by letting one user's actions affect the visualization in an another IVEE client.","AuthorNamesDeduped":"Christopher Ahlberg;Erik Wistrand","AuthorNames":"C. Ahlberg;E. Wistrand","AuthorAffiliation":"Dept. of Comput. Sci., Chalmers Univ. of Technol., Goteborg, Sweden;Dept. of Comput. Sci., Chalmers Univ. of Technol., Goteborg, Sweden","InternalReferences":"10.1109/VISUAL.1991.175815;10.1109/VISUAL.1993.398863","AuthorKeywords":"","AminerCitationCount022019":"204","XPloreCitationCount022019":"54","PubsCited":"28","Award":""}},{"name":"Stephen Wehrend","value":82,"numPapers":0,"cluster":"0","visible":1,"index":251,"weight":2,"x":640.4798685122934,"y":67.97206751552838,"px":641.0937656496191,"py":76.13763210027736,"node":{"Conference":"Vis","Year":"1990","Title":"A problem-oriented classification of visualization techniques","DOI":"10.1109/VISUAL.1990.146375","Link":"http://dx.doi.org/10.1109/VISUAL.1990.146375","FirstPage":"139","LastPage":"143, 469","PaperType":"C","Abstract":"Progress in scientific visualization could be accelerated if workers could more readily find visualization techniques relevant to a given problem. The authors describe an approach to this problem, based on a classification of visualization techniques, that is independent of particular application domains. A user breaks up a problem into subproblems, describes these subproblems in terms of the objects to be represented and the operations to be supported by a representation, locates applicable visualization techniques in a catalog, and combines these representations into a composite representation for the original problem. The catalog and its underlying classification provide a way for workers in different application disciplines to share methods.<<ETX>>","AuthorNamesDeduped":"Stephen Wehrend;Clayton Lewis","AuthorNames":"S. Wehrend;C. Lewis","AuthorAffiliation":"Colorado Univ., Boulder, CO, USA;Colorado Univ., Boulder, CO, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"353","XPloreCitationCount022019":"90","PubsCited":"6","Award":""}},{"name":"Clayton Lewis","value":82,"numPapers":0,"cluster":"0","visible":1,"index":252,"weight":2,"x":666.7335215205952,"y":83.17734794285168,"px":668.3896903653049,"py":91.62169264331642,"node":{"Conference":"Vis","Year":"1990","Title":"A problem-oriented classification of visualization techniques","DOI":"10.1109/VISUAL.1990.146375","Link":"http://dx.doi.org/10.1109/VISUAL.1990.146375","FirstPage":"139","LastPage":"143, 469","PaperType":"C","Abstract":"Progress in scientific visualization could be accelerated if workers could more readily find visualization techniques relevant to a given problem. The authors describe an approach to this problem, based on a classification of visualization techniques, that is independent of particular application domains. A user breaks up a problem into subproblems, describes these subproblems in terms of the objects to be represented and the operations to be supported by a representation, locates applicable visualization techniques in a catalog, and combines these representations into a composite representation for the original problem. The catalog and its underlying classification provide a way for workers in different application disciplines to share methods.<<ETX>>","AuthorNamesDeduped":"Stephen Wehrend;Clayton Lewis","AuthorNames":"S. Wehrend;C. Lewis","AuthorAffiliation":"Colorado Univ., Boulder, CO, USA;Colorado Univ., Boulder, CO, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"353","XPloreCitationCount022019":"90","PubsCited":"6","Award":""}},{"name":"Chris Weaver","value":236,"numPapers":64,"cluster":"0","visible":1,"index":253,"weight":21,"x":561.1686709513996,"y":361.05696491460327,"px":563.3278382874296,"py":361.15019615047447,"node":{"Conference":"InfoVis","Year":"2002","Title":"Multiscale visualization using data cubes","DOI":"10.1109/INFVIS.2002.1173141","Link":"http://dx.doi.org/10.1109/INFVIS.2002.1173141","FirstPage":"7","LastPage":"14","PaperType":"C","Abstract":"Most analysts start with an overview of the data before gradually refining their view to be more focused and detailed. Multiscale pan-and-zoom systems are effective because they directly support this approach. However generating abstract overviews of large data sets is difficult, and most systems take advantage of only one type of abstraction: visual abstraction. Furthermore, these existing systems limit the analyst to a single zooming path on their data and thus a single set of abstract views. This paper presents: (1) a formalism for describing multiscale visualizations of data cubes with both data and visual abstraction, and (2) a method for independently zooming along one or more dimensions by traversing a zoom graph with nodes at different levels of detail. As an example of how to design multiscale visualizations using our system, we describe four design patterns using our formalism. These design patterns show the effectiveness of multiscale visualization of general relational databases.","AuthorNamesDeduped":"Chris Stolte;Diane Tang;Pat Hanrahan","AuthorNames":"C. Stolte;D. Tang;P. Hanrahan","AuthorAffiliation":"Stanford Univ., CA, USA;Stanford Univ., CA, USA;Stanford Univ., CA, USA","InternalReferences":"10.1109/INFVIS.2000.885086","AuthorKeywords":"","AminerCitationCount022019":"66","XPloreCitationCount022019":"14","PubsCited":"21","Award":"BP"}},{"name":"Michael J. McGuffin","value":391,"numPapers":60,"cluster":"0","visible":1,"index":254,"weight":18,"x":556.3054230032338,"y":291.78545227831,"px":556.4407103744066,"py":293.7780075405316,"node":{"Conference":"InfoVis","Year":"2002","Title":"SpaceTree: supporting exploration in large node link tree, design evolution and empirical evaluation","DOI":"10.1109/INFVIS.2002.1173148","Link":"http://dx.doi.org/10.1109/INFVIS.2002.1173148","FirstPage":"57","LastPage":"64","PaperType":"C","Abstract":"We present a novel tree browser that builds on the conventional node link tree diagrams. It adds dynamic rescaling of branches of the tree to best fit the available screen space, optimized camera movement, and the use of preview icons summarizing the topology of the branches that cannot be expanded. In addition, it includes integrated search and filter functions. This paper reflects on the evolution of the design and highlights the principles that emerged from it. A controlled experiment showed benefits for navigation to already previously visited nodes and estimation of overall tree topology.","AuthorNamesDeduped":"Catherine Plaisant;Jesse Grosjean;Benjamin B. Bederson","AuthorNames":"C. Plaisant;J. Grosjean;B.B. Bederson","AuthorAffiliation":"Human-Comput. Interaction Lab., Maryland Univ., MD, USA;Human-Comput. Interaction Lab., Maryland Univ., MD, USA;Human-Comput. Interaction Lab., Maryland Univ., MD, USA","InternalReferences":"10.1109/VISUAL.1996.567745","AuthorKeywords":"","AminerCitationCount022019":"423","XPloreCitationCount022019":"80","PubsCited":"23","Award":""}},{"name":"Jesse Grosjean","value":68,"numPapers":1,"cluster":"0","visible":1,"index":255,"weight":1,"x":981.0558021130398,"y":64.36749416640167,"px":979.1447998372693,"py":68.93110954084743,"node":{"Conference":"Vis","Year":"1996","Title":"Cheops: a compact explorer for complex hierarchies","DOI":"10.1109/VISUAL.1996.567745","Link":"http://dx.doi.org/10.1109/VISUAL.1996.567745","FirstPage":"87","LastPage":"92","PaperType":"C","Abstract":"As the amount of electronic information explodes, hierarchies to handle this information become huge and complex. Visualizing and interacting with these hierarchies become daunting tasks. The problem is exacerbated if the visualization is to be done on mass-market personal computers, with limited processing power and visual resolution. Many of the current visualization techniques work effectively for hierarchies of 1000 nodes, but as the number of nodes increases toward 5000, these techniques tend to break down. Hierarchies above 5000 nodes usually require special modifications such as clustering, which can affect visual stability. This paper introduces Cheops, a novel approach to the representation, browsing and exploration of huge, complex information hierarchies such as the Dewey Decimal Classification system, which can contain between a million and a billion nodes. The Cheops approach maintains context within a huge hierarchy, while simultaneously providing easy access to details. This paper presents some preliminary results from usability tests performed on an 8-wide-by-9-deep classification hierarchy, which if fully populated would contain over 19 million nodes.","AuthorNamesDeduped":"Luc Beaudoin;Marc-Antoine Parent;Louis C. Vroomen","AuthorNames":"L. Beaudoin;M.-A. Parent;L.C. Vroomen","AuthorAffiliation":"Centre de Recherche Inf. de Montreal, Que.,, Canada","InternalReferences":"10.1109/INFVIS.1995.528689","AuthorKeywords":"Hierarchical representation, information visualization and exploration, focus+context techniques, graphical browser","AminerCitationCount022019":"71","XPloreCitationCount022019":"15","PubsCited":"10","Award":""}},{"name":"Benjamin B. Bederson","value":140,"numPapers":16,"cluster":"0","visible":1,"index":256,"weight":5,"x":674.2270816906707,"y":186.22380669251646,"px":672.3157191858054,"py":192.2739972430637,"node":{"Conference":"Vis","Year":"1996","Title":"Cheops: a compact explorer for complex hierarchies","DOI":"10.1109/VISUAL.1996.567745","Link":"http://dx.doi.org/10.1109/VISUAL.1996.567745","FirstPage":"87","LastPage":"92","PaperType":"C","Abstract":"As the amount of electronic information explodes, hierarchies to handle this information become huge and complex. Visualizing and interacting with these hierarchies become daunting tasks. The problem is exacerbated if the visualization is to be done on mass-market personal computers, with limited processing power and visual resolution. Many of the current visualization techniques work effectively for hierarchies of 1000 nodes, but as the number of nodes increases toward 5000, these techniques tend to break down. Hierarchies above 5000 nodes usually require special modifications such as clustering, which can affect visual stability. This paper introduces Cheops, a novel approach to the representation, browsing and exploration of huge, complex information hierarchies such as the Dewey Decimal Classification system, which can contain between a million and a billion nodes. The Cheops approach maintains context within a huge hierarchy, while simultaneously providing easy access to details. This paper presents some preliminary results from usability tests performed on an 8-wide-by-9-deep classification hierarchy, which if fully populated would contain over 19 million nodes.","AuthorNamesDeduped":"Luc Beaudoin;Marc-Antoine Parent;Louis C. Vroomen","AuthorNames":"L. Beaudoin;M.-A. Parent;L.C. Vroomen","AuthorAffiliation":"Centre de Recherche Inf. de Montreal, Que.,, Canada","InternalReferences":"10.1109/INFVIS.1995.528689","AuthorKeywords":"Hierarchical representation, information visualization and exploration, focus+context techniques, graphical browser","AminerCitationCount022019":"71","XPloreCitationCount022019":"15","PubsCited":"10","Award":""}},{"name":"Yves Chiricota","value":64,"numPapers":17,"cluster":"0","visible":1,"index":257,"weight":2,"x":765.6100270589214,"y":-77.07207166054204,"px":756.7857168426743,"py":-64.16784778913112,"node":{"Conference":"InfoVis","Year":"2003","Title":"Multiscale Visualization of Small World Networks","DOI":"10.1109/INFVIS.2003.1249011","Link":"http://doi.ieeecomputersociety.org/10.1109/INFVIS.2003.1249011","FirstPage":"75","LastPage":"84","PaperType":"C","Abstract":"Many networks under study in information visualization are \"small world\" networks. These networks first appeared in the study of social networks and were shown to be relevant models in other application domains such as software reverse engineering and biology. Furthermore, many of these networks actually have a multiscale nature: they can be viewed as a network of groups that are themselves small world networks. We describe a metric that has been designed in order to identify the weakest edges in a small world network leading to an easy and low cost filtering procedure that breaks up a graph into smaller and highly connected components. We show how this metric can be exploited through an interactive navigation of the network based on semantic zooming. Once the network is decomposed into a hierarchy of sub-networks, a user can easily find groups and subgroups of actors and understand their dynamics.","AuthorNamesDeduped":"David Auber;Yves Chiricota;Fabien Jourdan;Guy Melançon","AuthorNames":"D. Auber;Y. Chiricota;F. Jourdan;G. Melancon","AuthorAffiliation":"LaBRI, Bordeaux, France","InternalReferences":"","AuthorKeywords":"Small world networks, multiscale graphs,clustering metric, semantic zooming","AminerCitationCount022019":"266","XPloreCitationCount022019":"52","PubsCited":"18","Award":""}},{"name":"Guy Melançon","value":44,"numPapers":10,"cluster":"0","visible":1,"index":258,"weight":1,"x":883.5652367907356,"y":-266.8186375564768,"px":871.243143310299,"py":-244.53075425119738,"node":{"Conference":"InfoVis","Year":"1999","Title":"Dynamic hierarchy specification and visualization","DOI":"10.1109/INFVIS.1999.801859","Link":"http://dx.doi.org/10.1109/INFVIS.1999.801859","FirstPage":"65","LastPage":"72","PaperType":"C","Abstract":"This paper describes concepts that underlie the design and implementation of an information exploration system that allows users to impose arbitrary hierarchical organizations on their data. Such hierarchies allow a user to embed important semantic information into the hierarchy definition. Our goal is to recognize the significance of this implicit information and to utilize it in the hierarchy visualization. The innovative features of our system include the dynamic modification of the hierarchy definitions and the definition and implementation of a set of layout algorithms that utilize semantic information implicit in the tree construction.","AuthorNamesDeduped":"Richard M. Wilson 0002;R. Daniel Bergeron","AuthorNames":"R.M. Wilson;R.D. Bergeron","AuthorAffiliation":"Dept. of Comput. Sci., New Hampshire Univ., Durham, NH, USA","InternalReferences":"10.1109/INFVIS.1995.528689;10.1109/INFVIS.1998.729555;10.1109/VISUAL.1991.175815","AuthorKeywords":"","AminerCitationCount022019":"","XPloreCitationCount022019":"12","PubsCited":"16","Award":""}},{"name":"Christian Panse","value":27,"numPapers":8,"cluster":"2","visible":1,"index":259,"weight":1,"x":632.8890910910519,"y":-77.71912376999522,"px":630.7515794930258,"py":-70.08383390469587,"node":{"Conference":"Vis","Year":"1998","Title":"The Gridfit algorithm: an efficient and effective approach to visualizing large amounts of spatial data","DOI":"10.1109/VISUAL.1998.745301","Link":"http://dx.doi.org/10.1109/VISUAL.1998.745301","FirstPage":"181","LastPage":"188","PaperType":"C","Abstract":"In a large number of applications, data is collected and referenced by their spatial locations. Visualizing large amounts of spatially referenced data on a limited-size screen display often results in poor visualizations due to the high degree of overplotting of neighboring datapoints. We introduce a new approach to visualizing large amounts of spatially referenced data. The basic idea is to intelligently use the unoccupied pixels of the display instead of overplotting data points. After formally describing the problem, we present two solutions which are based on: placing overlapping data points on the nearest unoccupied pixel; and shifting data points along a screen-filling curve (e.g., Hilbert-curve). We then develop a more sophisticated approach called Gridfit, which is based on a hierarchical partitioning of the data space. We evaluate all three approaches with respect to their efficiency and effectiveness and show the superiority of the Gridfit approach. For measuring the effectiveness, we not only present the resulting visualizations but also introduce mathematical effectiveness criteria measuring properties of the generated visualizations with respect to the original data such as distance- and position-preservation.","AuthorNamesDeduped":"Daniel A. Keim;Annemarie Herrmann","AuthorNames":"D.A. Keim;A. Herrmann","AuthorAffiliation":"Inst. of Comput. Sci., Halle-Wittenberg Univ., Halle, Germany","InternalReferences":"10.1109/VISUAL.1995.485139;10.1109/INFVIS.1995.528688;10.1109/VISUAL.1991.175794;10.1109/VISUAL.1990.146387;10.1109/VISUAL.1990.146402;10.1109/VISUAL.1993.398870;10.1109/VISUAL.1995.485140;10.1109/VISUAL.1994.346302;10.1109/INFVIS.1995.528690;10.1109/VISUAL.1990.146386","AuthorKeywords":"visualizing large data sets, visualizing spatially referenced data, visualizing geographical data, interfaces to databases","AminerCitationCount022019":"66","XPloreCitationCount022019":"13","PubsCited":"34","Award":""}},{"name":"Melanie Tory","value":430,"numPapers":136,"cluster":"0","visible":1,"index":260,"weight":28,"x":547.6863839501718,"y":242.65489574780912,"px":549.1485190369341,"py":245.73925535484966,"node":{"Conference":"Vis","Year":"1993","Title":"Texture splats for 3D scalar and vector field visualization","DOI":"10.1109/VISUAL.1993.398877","Link":"http://dx.doi.org/10.1109/VISUAL.1993.398877","FirstPage":"261","LastPage":"266","PaperType":"C","Abstract":"Volume visualization is becoming an important tool for understanding large 3D data sets. A popular technique for volume rendering is known as splatting. With new hardware architectures offering substantial improvements in the performance of rendering texture mapped objects, we present textured splats. An ideal reconstruction function for 3D signals is developed which can be used as a texture map for a splat. Extensions to the basic splatting technique are then developed to additionally represent vector fields.<<ETX>>","AuthorNamesDeduped":"Roger Crawfis;Nelson L. Max","AuthorNames":"R.A. Crawfis;N. Max","AuthorAffiliation":"Lawrence Livermore Nat. Lab., Livermore, CA, USA;Lawrence Livermore Nat. Lab., Livermore, CA, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"1","XPloreCitationCount022019":"73","PubsCited":"6","Award":"TT"}},{"name":"Jock D. Mackinlay","value":391,"numPapers":22,"cluster":"0","visible":1,"index":261,"weight":12,"x":600.6604850320846,"y":229.24525824140068,"px":600.7782028434686,"py":233.73434628243933,"node":{"Conference":"InfoVis","Year":"1996","Title":"On the semantics of interactive visualizations","DOI":"10.1109/INFVIS.1996.559213","Link":"http://dx.doi.org/10.1109/INFVIS.1996.559213","FirstPage":"29","LastPage":"36","PaperType":"C","Abstract":"Interactive techniques are powerful tools for manipulating visualizations to analyze, communicate and acquire information. This is especially true for large data sets or complex 3D visualizations. Although many new types of interaction have been introduced recently, very little work has been done on understanding what their components are, how they are related and how they can be combined. This paper begins to address these issues with a framework for classifying interactive visualizations. Our goal is a framework that will enable us to develop toolkits for assembling visualization interfaces both interactively and automatically.","AuthorNamesDeduped":"Mei C. Chuah;Steven F. Roth","AuthorNames":"M.C. Chuah;S.F. Roth","AuthorAffiliation":"Sch. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA","InternalReferences":"10.1109/INFVIS.1995.528684;10.1109/INFVIS.1996.559210","AuthorKeywords":"information visualization, interactive techniques, user interfaces, automatic presentation systems, graphics","AminerCitationCount022019":"122","XPloreCitationCount022019":"32","PubsCited":"10","Award":""}},{"name":"Matt Williams","value":45,"numPapers":8,"cluster":"15","visible":1,"index":262,"weight":1,"x":1167.966128380776,"y":638.3347739776381,"px":1167.3746121173826,"py":633.6308050317447,"node":{"Conference":"InfoVis","Year":"2002","Title":"Case study: visualizing sets of evolutionary trees","DOI":"10.1109/INFVIS.2002.1173150","Link":"http://dx.doi.org/10.1109/INFVIS.2002.1173150","FirstPage":"71","LastPage":"74","PaperType":"C","Abstract":"We describe a visualization tool which allows a biologist to explore a large set of hypothetical evolutionary trees. Interacting with such a dataset allows the biologist to identify distinct hypotheses about how different species or organisms evolved, which would not have been clear from traditional analyses. Our system integrates a point-set visualization of the distribution of hypothetical trees with detail views of an individual tree, or of a consensus tree summarizing a subset of trees. Efficient algorithms were required for the key tasks of computing distances between trees, finding consensus trees, and laying out the point-set visualization.","AuthorNamesDeduped":"Nina Amenta;Jeff Klingner","AuthorNames":"N. Amenta;J. Klingner","AuthorAffiliation":"Texas Univ., Austin, TX, USA;Texas Univ., Austin, TX, USA","InternalReferences":"10.1109/VISUAL.1996.567787;10.1109/VISUAL.1993.398870","AuthorKeywords":"","AminerCitationCount022019":"103","XPloreCitationCount022019":"14","PubsCited":"15","Award":""}},{"name":"Matthew Chalmers","value":136,"numPapers":16,"cluster":"15","visible":1,"index":263,"weight":5,"x":872.2007036221494,"y":538.6901276179161,"px":863.4339450499718,"py":534.3740373451911,"node":{"Conference":"InfoVis","Year":"1995","Title":"Visualizing the non-visual: spatial analysis and interaction with information from text documents","DOI":"10.1109/INFVIS.1995.528686","Link":"http://dx.doi.org/10.1109/INFVIS.1995.528686","FirstPage":"51","LastPage":"58","PaperType":"C","Abstract":"The paper describes an approach to IV that involves spatializing text content for enhanced visual browsing and analysis. The application arena is large text document corpora such as digital libraries, regulations and procedures, archived reports, etc. The basic idea is that text content from these sources may be transformed to a spatial representation that preserves informational characteristics from the documents. The spatial representation may then be visually browsed and analyzed in ways that avoid language processing and that reduce the analysts mental workload. The result is an interaction with text that more nearly resembles perception and action with the natural world than with the abstractions of written language.","AuthorNamesDeduped":"James A. Wise;James J. Thomas;Kelly Pennock;D. Lantrip;M. Pottier;Anne Schur;V. Crow","AuthorNames":"J.A. Wise;J.J. Thomas;K. Pennock;D. Lantrip;M. Pottier;A. Schur;V. Crow","AuthorAffiliation":"Pacific Northwest Lab., Richland, WA, USA;Pacific Northwest Lab., Richland, WA, USA;Pacific Northwest Lab., Richland, WA, USA;Pacific Northwest Lab., Richland, WA, USA;Pacific Northwest Lab., Richland, WA, USA;Pacific Northwest Lab., Richland, WA, USA;Pacific Northwest Lab., Richland, WA, USA","InternalReferences":"10.1109/VISUAL.1993.398863","AuthorKeywords":"","AminerCitationCount022019":"796","XPloreCitationCount022019":"177","PubsCited":"11","Award":"TT"}},{"name":"Sheelagh Carpendale","value":772,"numPapers":177,"cluster":"0","visible":1,"index":264,"weight":66,"x":545.785626783881,"y":304.5733811391797,"px":547.5420695630642,"py":305.85540542212465,"node":{"Conference":"InfoVis","Year":"1996","Title":"Techniques for non-linear magnification transformations","DOI":"10.1109/INFVIS.1996.559214","Link":"http://dx.doi.org/10.1109/INFVIS.1996.559214","FirstPage":"38","LastPage":"45","PaperType":"C","Abstract":"This paper presents efficient methods for implementing general non-linear magnification transformations. Techniques are provided for: combining linear and non-linear magnifications, constraining the domain of magnifications, combining multiple transformations, and smoothly interpolating between magnified and normal views. In addition, piecewise linear methods are introduced which allow greater efficiency and expressiveness than their continuous counterparts.","AuthorNamesDeduped":"Alan Keahey;Edward L. Robertson","AuthorNames":"T.A. Keahey;E.L. Robertson","AuthorAffiliation":"Dept. of Comput. Sci., Indiana Univ., Bloomington, IN, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"","XPloreCitationCount022019":"38","PubsCited":"17","Award":""}},{"name":"Arnold Köchl","value":54,"numPapers":24,"cluster":"3","visible":1,"index":265,"weight":7,"x":500.07039036783937,"y":640.9150851335881,"px":502.0503466473798,"py":635.6991645386465,"node":{"Conference":"Vis","Year":"2001","Title":"Visualization and interaction techniques for the exploration of vascular structures","DOI":"10.1109/VISUAL.2001.964538","Link":"http://dx.doi.org/10.1109/VISUAL.2001.964538","FirstPage":"395","LastPage":"402","PaperType":"C","Abstract":"We describe a pipeline of image processing steps for deriving symbolic models of vascular structures from radiological data which reflect the branching pattern and diameter of vessels. For the visualization of these symbolic models, concatenated truncated cones are smoothly blended at branching points. We put emphasis on the quality of the visualizations which is achieved by anti-aliasing operations in different stages of the visualization. The methods presented are referred to as HQVV (high quality vessel visualization). Scalable techniques are provided to explore vascular structures of different orders of magnitude. The hierarchy as well as the diameter of the branches of vascular systems are used to restrict visualizations to relevant subtrees and to emphasize parts of vascular systems. Our research is inspired by clear visualizations in textbooks and is targeted toward medical education and therapy planning. We describe the application of vessel visualization techniques for liver surgery planning. For this application it is crucial to recognize the morphology and branching pattern of vascular systems as well as the basic spatial relations between vessels and other anatomic structures.","AuthorNamesDeduped":"Horst K. Hahn;Bernhard Preim;Dirk Selle;Heinz-Otto Peitgen","AuthorNames":"H.K. Hahn;B. Preim;D. Selle;H.-O. Peitgen","AuthorAffiliation":"MeVis-Center for Med. Diagnostic Syst., Bremen, Germany;MeVis-Center for Med. Diagnostic Syst., Bremen, Germany;MeVis-Center for Med. Diagnostic Syst., Bremen, Germany;MeVis-Center for Med. Diagnostic Syst., Bremen, Germany","InternalReferences":"10.1109/VISUAL.1997.663917","AuthorKeywords":"vessel visualization, medical visualization, computer-assisted surgery","AminerCitationCount022019":"139","XPloreCitationCount022019":"36","PubsCited":"22","Award":""}},{"name":"Christoph Garth","value":328,"numPapers":90,"cluster":"6","visible":1,"index":266,"weight":35,"x":312.11956155956756,"y":487.27524762102365,"px":317.00656698196116,"py":485.9519659553662,"node":{"Conference":"Vis","Year":"2003","Title":"Saddle connectors - an approach to visualizing the topological skeleton of complex 3D vector fields","DOI":"10.1109/VISUAL.2003.1250376","Link":"http://dx.doi.org/10.1109/VISUAL.2003.1250376","FirstPage":"225","LastPage":"232","PaperType":"C","Abstract":"One of the reasons that topological methods have a limited popularity for the visualization of complex 3D flow fields is the fact that such topological structures contain a number of separating stream surfaces. Since these stream surfaces tend to hide each other as well as other topological features, for complex 3D topologies the visualizations become cluttered and hardly interpretable. This paper proposes to use particular stream lines called saddle connectors instead of separating stream surfaces and to depict single surfaces only on user demand. We discuss properties and computational issues of saddle connectors and apply these methods to complex flow data. We show that the use of saddle connectors makes topological skeletons available as a valuable visualization tool even for topologically complex 3D flow data.","AuthorNamesDeduped":"Holger Theisel;Tino Weinkauf;Hans-Christian Hege;Hans-Peter Seidel","AuthorNames":"H. Theisel;T. Weinkauf;H.-C. Hege;H.-P. Seidel","AuthorAffiliation":"MPI Informatik Saarbrucken, Germany","InternalReferences":"10.1109/VISUAL.2000.885714;10.1109/VISUAL.1999.809874;10.1109/VISUAL.1998.745284;10.1109/VISUAL.1998.745291;10.1109/VISUAL.1999.809907;10.1109/VISUAL.1992.235211;10.1109/VISUAL.1993.398875;10.1109/VISUAL.2001.964506;10.1109/VISUAL.2000.885716;10.1109/VISUAL.2001.964507","AuthorKeywords":"3D flow visualization, vector field topology, critical points, separatrices","AminerCitationCount022019":"169","XPloreCitationCount022019":"43","PubsCited":"37","Award":""}},{"name":"Chaoli Wang","value":136,"numPapers":62,"cluster":"4","visible":1,"index":267,"weight":12,"x":340.62513949086605,"y":494.5753245597153,"px":345.7152214609731,"py":492.79296000659485,"node":{"Conference":"Vis","Year":"2001","Title":"Interactive volume rendering using multi-dimensional transfer functions and direct manipulation widgets","DOI":"10.1109/VISUAL.2001.964519","Link":"http://dx.doi.org/10.1109/VISUAL.2001.964519","FirstPage":"255","LastPage":"262","PaperType":"C","Abstract":"Most direct volume renderings produced today employ one-dimensional transfer functions, which assign color and opacity to the volume based solely on the single scalar quantity which comprises the dataset. Though they have not received widespread attention, multi-dimensional transfer functions are a very effective way to extract specific material boundaries and convey subtle surface properties. However, identifying good transfer functions is difficult enough in one dimension, let alone two or three dimensions. This paper demonstrates an important class of three-dimensional transfer functions for scalar data (based on data value, gradient magnitude, and a second directional derivative), and describes a set of direct manipulation widgets which make specifying such transfer functions intuitive and convenient. We also describe how to use modem graphics hardware to interactively render with multi-dimensional transfer functions. The transfer functions, widgets, and hardware combine to form a powerful system for interactive volume exploration.","AuthorNamesDeduped":"Joe Michael Kniss;Gordon L. Kindlmann;Charles D. Hansen","AuthorNames":"J. Kniss;G. Kindlmann;C. Hansen","AuthorAffiliation":"Sch. of Comput., Utah Univ., Salt Lake City, UT, USA;Sch. of Comput., Utah Univ., Salt Lake City, UT, USA;Sch. of Comput., Utah Univ., Salt Lake City, UT, USA","InternalReferences":"10.1109/VISUAL.1995.480803;10.1109/VISUAL.1999.809908;10.1109/VISUAL.1999.809889;10.1109/VISUAL.1996.568113;10.1109/VISUAL.1997.663875","AuthorKeywords":"volume visualization, direct volume rendering, multi-dimensional transfer functions, direct manipulation widgets, graphics hardware","AminerCitationCount022019":"514","XPloreCitationCount022019":"123","PubsCited":"34","Award":"BP"}},{"name":"Markus Rütten","value":29,"numPapers":28,"cluster":"6","visible":1,"index":268,"weight":2,"x":134.687047039385,"y":533.8875079420123,"px":143.7375921540607,"py":530.2117701383172,"node":{"Conference":"Vis","Year":"2001","Title":"Interactive volume rendering using multi-dimensional transfer functions and direct manipulation widgets","DOI":"10.1109/VISUAL.2001.964519","Link":"http://dx.doi.org/10.1109/VISUAL.2001.964519","FirstPage":"255","LastPage":"262","PaperType":"C","Abstract":"Most direct volume renderings produced today employ one-dimensional transfer functions, which assign color and opacity to the volume based solely on the single scalar quantity which comprises the dataset. Though they have not received widespread attention, multi-dimensional transfer functions are a very effective way to extract specific material boundaries and convey subtle surface properties. However, identifying good transfer functions is difficult enough in one dimension, let alone two or three dimensions. This paper demonstrates an important class of three-dimensional transfer functions for scalar data (based on data value, gradient magnitude, and a second directional derivative), and describes a set of direct manipulation widgets which make specifying such transfer functions intuitive and convenient. We also describe how to use modem graphics hardware to interactively render with multi-dimensional transfer functions. The transfer functions, widgets, and hardware combine to form a powerful system for interactive volume exploration.","AuthorNamesDeduped":"Joe Michael Kniss;Gordon L. Kindlmann;Charles D. Hansen","AuthorNames":"J. Kniss;G. Kindlmann;C. Hansen","AuthorAffiliation":"Sch. of Comput., Utah Univ., Salt Lake City, UT, USA;Sch. of Comput., Utah Univ., Salt Lake City, UT, USA;Sch. of Comput., Utah Univ., Salt Lake City, UT, USA","InternalReferences":"10.1109/VISUAL.1995.480803;10.1109/VISUAL.1999.809908;10.1109/VISUAL.1999.809889;10.1109/VISUAL.1996.568113;10.1109/VISUAL.1997.663875","AuthorKeywords":"volume visualization, direct volume rendering, multi-dimensional transfer functions, direct manipulation widgets, graphics hardware","AminerCitationCount022019":"514","XPloreCitationCount022019":"123","PubsCited":"34","Award":"BP"}},{"name":"Rebecca M. Brannon","value":7,"numPapers":18,"cluster":"6","visible":1,"index":269,"weight":2,"x":-17.28423653091185,"y":670.9774201427488,"px":-11.295269945901397,"py":665.2972499534118,"node":{"Conference":"Vis","Year":"1997","Title":"Visualization of rotation fields","DOI":"10.1109/VISUAL.1997.663929","Link":"http://dx.doi.org/10.1109/VISUAL.1997.663929","FirstPage":"491","LastPage":"494","PaperType":"C","Abstract":"We define a rotation field by extending the notion of a vector field to rotations. A vector field has a vector as a value at each point of its domain; a rotation field has a rotation as a value at each point of its domain. Rotation fields result from mapping the orientation error of tracking systems. We build upon previous methods for the visualization of vector fields, tensor fields and rotations at a point, to visualize a rotation field resulting from calibration of a commonly-used magnetic tracking system.","AuthorNamesDeduped":"Mark A. Livingston","AuthorNames":"M.A. Livingston","AuthorAffiliation":"Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA","InternalReferences":"10.1109/VISUAL.1992.235211;10.1109/VISUAL.1994.346330;10.1109/VISUAL.1992.235193;10.1109/VISUAL.1992.235227;10.1109/VISUAL.1994.346315;10.1109/VISUAL.1991.175789;10.1109/VISUAL.1993.398867;10.1109/VISUAL.1994.346338;10.1109/VISUAL.1993.398846","AuthorKeywords":"Scientific visualization, tufts, streamlines, stream surfaces","AminerCitationCount022019":"7","XPloreCitationCount022019":"5","PubsCited":"22","Award":""}},{"name":"Eric B. Lum","value":95,"numPapers":15,"cluster":"5","visible":1,"index":270,"weight":2,"x":395.8360180653505,"y":669.2059664760163,"px":398.6688254176358,"py":662.1161200087793,"node":{"Conference":"Vis","Year":"1999","Title":"A fast volume rendering algorithm for time-varying fields using a time-space partitioning (TSP) tree","DOI":"10.1109/VISUAL.1999.809910","Link":"http://dx.doi.org/10.1109/VISUAL.1999.809910","FirstPage":"371","LastPage":"545","PaperType":"C","Abstract":"We present a fast volume rendering algorithm for time-varying fields. We propose a new data structure, called time-space partitioning (TSP) tree, that can effectively capture both the spatial and the temporal coherence from a time-varying field. Using the proposed data structure, the rendering speed is substantially improved. In addition, our data structure helps to maintain the memory access locality and to provide the sparse data traversal so that our algorithm becomes suitable for large-scale out-of-core applications. Finally, our algorithm allows flexible error control for both the temporal and the spatial coherence so that a trade-off between image quality and rendering speed is possible. We demonstrate the utility and speed of our algorithm with data from several time-varying CFD simulations. Our rendering algorithm can achieve substantial speedup while the storage space overhead for the TSP tree is kept at a minimum.","AuthorNamesDeduped":"Han-Wei Shen;Ling-Jan Chiang;Kwan-Liu Ma","AuthorNames":"H.-W. Shen;L.-J. Chiang;K.-L. Ma","AuthorAffiliation":"MRJ Technol. Solutions, NASA Ames Res. Center, Moffett Field, CA, USA","InternalReferences":"10.1109/VISUAL.1998.745713;10.1109/VISUAL.1997.663888;10.1109/VISUAL.1996.567609;10.1109/VISUAL.1998.745298;10.1109/VISUAL.1995.480809","AuthorKeywords":"scalar field visualization, volume visualization, volume rendering, time-varying fields","AminerCitationCount022019":"232","XPloreCitationCount022019":"59","PubsCited":"15","Award":""}},{"name":"Filip Sadlo","value":132,"numPapers":67,"cluster":"8","visible":1,"index":271,"weight":10,"x":284.2479115600777,"y":389.63785256488825,"px":290.2946103923364,"py":390.5712308107124,"node":{"Conference":"Vis","Year":"2003","Title":"Clifford convolution and pattern matching on vector fields","DOI":"10.1109/VISUAL.2003.1250372","Link":"http://dx.doi.org/10.1109/VISUAL.2003.1250372","FirstPage":"193","LastPage":"200","PaperType":"C","Abstract":"The goal of this paper is to define a convolution operation which transfers image processing and pattern matching to vector fields from flow visualization. For this, a multiplication of vectors is necessary. Clifford algebra provides such a multiplication of vectors. We define a Clifford convolution on vector fields with uniform grids. The Clifford convolution works with multivector filter masks. Scalar and vector masks can be easily converted to multivector fields. So, filter masks from image processing on scalar fields can be applied as well as vector and scalar masks. Furthermore, a method for pattern matching with Clifford convolution on vector fields is described. The method is independent of the direction of the structures. This provides an automatic approach to feature detection. The features can be visualized using any known method like glyphs, isosurfaces or streamlines. The features are defined by filter masks instead of analytical properties and thus the approach is more intuitive.","AuthorNamesDeduped":"Julia Ebling;Gerik Scheuermann","AuthorNames":"J. Ebling;G. Scheuermann","AuthorAffiliation":"Kaiserslautern, Germany;Kaiserslautern, Germany","InternalReferences":"10.1109/VISUAL.2000.885716;10.1109/VISUAL.1997.663858","AuthorKeywords":" Flow Visualization, Convolution, Pattern Matching","AminerCitationCount022019":"54","XPloreCitationCount022019":"23","PubsCited":"13","Award":""}},{"name":"Feng Qiu","value":27,"numPapers":12,"cluster":"4","visible":1,"index":272,"weight":2,"x":384.07557517915836,"y":744.3003652846799,"px":386.39009591463196,"py":735.7955423135958,"node":{"Conference":"Vis","Year":"2003","Title":"Voxels on fire","DOI":"10.1109/VISUAL.2003.1250382","Link":"http://dx.doi.org/10.1109/VISUAL.2003.1250382","FirstPage":"271","LastPage":"278","PaperType":"C","Abstract":"We introduce a method for the animation of fire propagation and the burning consumption of objects represented as volumetric data sets. Our method uses a volumetric fire propagation model based on an enhanced distance field. It can simulate the spreading of multiple fire fronts over a specified isosurface without actually having to create that isosurface. The distance field is generated from a specific shell volume that rapidly creates narrow spatial bands around the virtual surface of any given isovalue. The complete distance field is then obtained by propagation from the initial bands. At each step multiple fire fronts can evolve simultaneously on the volumetric object. The flames of the fire are constructed from streams of particles whose movement is regulated by a velocity field generated with the hardware-accelerated Lattice Boltzmann Model (LBM). The LBM provides a physically-based simulation of the air flow around the burning object. The object voxels and the splats associated with the flame particles are rendered in the same pipeline so that the volume data with its external and internal structures can be displayed along with the fire.","AuthorNamesDeduped":"Ye Zhao;Xiaoming Wei;Zhe Fan;Arie E. Kaufman;Hong Qin","AuthorNames":"Ye Zhao;Xiaoming Wei;Zhe Fan;A. Kaufman;Hong Qin","AuthorAffiliation":"Center for Visual Comput., Stony Brook Univ., NY, USA;Center for Visual Comput., Stony Brook Univ., NY, USA;Center for Visual Comput., Stony Brook Univ., NY, USA;Center for Visual Comput., Stony Brook Univ., NY, USA;Center for Visual Comput., Stony Brook Univ., NY, USA","InternalReferences":"10.1109/VISUAL.2002.1183779;10.1109/VISUAL.1993.398879","AuthorKeywords":"Fire Propagation, Distance Field, Lattice Boltzmann Model, Splatting, GPU Acceleration","AminerCitationCount022019":"50","XPloreCitationCount022019":"4","PubsCited":"34","Award":""}},{"name":"Allen R. Sanderson","value":12,"numPapers":27,"cluster":"6","visible":1,"index":273,"weight":3,"x":172.5220772318826,"y":577.3361555997964,"px":178.23433232782207,"py":573.3889924237868,"node":{"Conference":"Vis","Year":"1999","Title":"Simplified representation of vector fields","DOI":"10.1109/VISUAL.1999.809865","Link":"http://dx.doi.org/10.1109/VISUAL.1999.809865","FirstPage":"35","LastPage":"507","PaperType":"C","Abstract":"Vector field visualization remains a difficult task. Many local and global visualization methods for vector fields such as flow data exist, but they usually require extensive user experience on setting the visualization parameters in order to produce images communicating the desired insight. We present a visualization method that produces simplified but suggestive images of the vector field automatically, based on a hierarchical clustering of the input data. The resulting clusters are then visualized with straight or curved arrow icons. The presented method has a few parameters with which users can produce various simplified vector field visualizations that communicate different insights on the vector data.","AuthorNamesDeduped":"Alexandru Telea;Jarke J. van Wijk","AuthorNames":"A. Telea;J.J. Van Wijk","AuthorAffiliation":"Eindhoven Univ. of Technol., Netherlands","InternalReferences":"10.1109/VISUAL.1995.480817;10.1109/VISUAL.1994.346327;10.1109/VISUAL.1991.175789","AuthorKeywords":"Flow Visualization, Simplification, Clustering","AminerCitationCount022019":"182","XPloreCitationCount022019":"51","PubsCited":"14","Award":""}},{"name":"Wei Chen 0001","value":240,"numPapers":200,"cluster":"5","visible":1,"index":274,"weight":37,"x":524.2948942685146,"y":392.5978211179201,"px":526.0212082217535,"py":391.56841815976884,"node":{"Conference":"Vis","Year":"1993","Title":"Texture splats for 3D scalar and vector field visualization","DOI":"10.1109/VISUAL.1993.398877","Link":"http://dx.doi.org/10.1109/VISUAL.1993.398877","FirstPage":"261","LastPage":"266","PaperType":"C","Abstract":"Volume visualization is becoming an important tool for understanding large 3D data sets. A popular technique for volume rendering is known as splatting. With new hardware architectures offering substantial improvements in the performance of rendering texture mapped objects, we present textured splats. An ideal reconstruction function for 3D signals is developed which can be used as a texture map for a splat. Extensions to the basic splatting technique are then developed to additionally represent vector fields.<<ETX>>","AuthorNamesDeduped":"Roger Crawfis;Nelson L. Max","AuthorNames":"R.A. Crawfis;N. Max","AuthorAffiliation":"Lawrence Livermore Nat. Lab., Livermore, CA, USA;Lawrence Livermore Nat. Lab., Livermore, CA, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"1","XPloreCitationCount022019":"73","PubsCited":"6","Award":"TT"}},{"name":"Liu Ren","value":65,"numPapers":89,"cluster":"0","visible":1,"index":275,"weight":10,"x":541.0944191979332,"y":340.2254973706805,"px":543.7908943946992,"py":342.28300087099245,"node":{"Conference":"Vis","Year":"1993","Title":"Texture splats for 3D scalar and vector field visualization","DOI":"10.1109/VISUAL.1993.398877","Link":"http://dx.doi.org/10.1109/VISUAL.1993.398877","FirstPage":"261","LastPage":"266","PaperType":"C","Abstract":"Volume visualization is becoming an important tool for understanding large 3D data sets. A popular technique for volume rendering is known as splatting. With new hardware architectures offering substantial improvements in the performance of rendering texture mapped objects, we present textured splats. An ideal reconstruction function for 3D signals is developed which can be used as a texture map for a splat. Extensions to the basic splatting technique are then developed to additionally represent vector fields.<<ETX>>","AuthorNamesDeduped":"Roger Crawfis;Nelson L. Max","AuthorNames":"R.A. Crawfis;N. Max","AuthorAffiliation":"Lawrence Livermore Nat. Lab., Livermore, CA, USA;Lawrence Livermore Nat. Lab., Livermore, CA, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"1","XPloreCitationCount022019":"73","PubsCited":"6","Award":"TT"}},{"name":"Ivan Viola","value":161,"numPapers":71,"cluster":"3","visible":1,"index":276,"weight":7,"x":474.5208710683109,"y":540.1019904544886,"px":475.948891145261,"py":537.015454088002,"node":{"Conference":"Vis","Year":"2002","Title":"Geometric surface smoothing via anisotropic diffusion of normals","DOI":"10.1109/VISUAL.2002.1183766","Link":"http://dx.doi.org/10.1109/VISUAL.2002.1183766","FirstPage":"125","LastPage":"132","PaperType":"C","Abstract":"This paper introduces a method for smoothing complex, noisy surfaces, while preserving (and enhancing) sharp, geometric features. It has two main advantages over previous approaches to feature preserving surface smoothing. First is the use of level set surface models, which allows us to process very complex shapes of arbitrary and changing topology. This generality makes it well suited for processing surfaces that are derived directly from measured data. The second advantage is that the proposed method derives from a well-founded formulation, which is a natural generalization of anisotropic diffusion, as used in image processing. This formulation is based on the proposition that the generalization of image filtering entails filtering the normals of the surface, rather than processing the positions of points on a mesh.","AuthorNamesDeduped":"Tolga Tasdizen;Ross T. Whitaker;Paul Burchard;Stanley Osher","AuthorNames":"T. Tasdizen;R. Whitaker;P. Burchard;S. Osher","AuthorAffiliation":"Sch. of Comput., Utah Univ., Salt Lake City, UT, USA","InternalReferences":"","AuthorKeywords":"anisotropic diffusion, surface fairing, geometric surface processing, intrinsic Laplacian of curvature, level sets","AminerCitationCount022019":"263","XPloreCitationCount022019":"67","PubsCited":"32","Award":""}},{"name":"Ralf Kähler","value":52,"numPapers":20,"cluster":"4","visible":1,"index":277,"weight":1,"x":456.46204900446907,"y":752.0936399574925,"px":455.7667059656691,"py":745.8938383676586,"node":{"Conference":"Vis","Year":"2002","Title":"Case study: Interactive rendering of adaptive mesh refinement data","DOI":"10.1109/VISUAL.2002.1183820","Link":"http://dx.doi.org/10.1109/VISUAL.2002.1183820","FirstPage":"521","LastPage":"524","PaperType":"C","Abstract":"Adaptive mesh refinement (AMR) is a popular computational simulation technique used in various scientific and engineering fields. Although AMR data is organized in a hierarchical multi-resolution data structure, the traditional volume visualization algorithms such as ray-casting and splatting cannot handle the form without converting it to a sophisticated data structure. In this paper, we present a hierarchical multi-resolution splatting technique using k-d trees and octrees for AMR data that is suitable for implementation on the latest consumer PC graphics hardware. We describe a graphical user interface to set transfer function and viewing/rendering parameters interactively. Experimental results obtained on a general purpose PC equipped with NVIDIA GeForce card are presented to demonstrate that the technique can interactively render AMR data (over 20 frames per second). Our scheme can easily be applied to parallel rendering of time-varying AMR data.","AuthorNamesDeduped":"Sanghun Park;Chandrajit L. Bajaj;Vinay Siddavanahalli","AuthorNames":"Sanghun Park;C.L. Bajaj;V. Siddavanahalli","AuthorAffiliation":"Texas Univ., Austin, TX, USA","InternalReferences":"10.1109/VISUAL.1993.398877","AuthorKeywords":"AMR, K-d trees, Octree, Hierarchical splatting, Texture mapping","AminerCitationCount022019":"25","XPloreCitationCount022019":"5","PubsCited":"10","Award":""}},{"name":"Jürgen Schneider","value":57,"numPapers":19,"cluster":"6","visible":1,"index":278,"weight":1,"x":-53.84540936501749,"y":535.848152538029,"px":-45.06624535924532,"py":533.3281219603674,"node":{"Conference":"Vis","Year":"1999","Title":"Interactive visualization of fluid dynamics simulations in locally refined cartesian grids","DOI":"10.1109/VISUAL.1999.809918","Link":"http://dx.doi.org/10.1109/VISUAL.1999.809918","FirstPage":"413","LastPage":"553","PaperType":"C","Abstract":"The work presents interactive flow visualization techniques specifically adapted for PowerFLOW/sup TM/, a lattice based CFD code from the EXA corporation. Their Digital Physics/sup TM/ fluid simulation technique is performed on a hierarchy of locally refined cartesian grids with a fine voxel resolution in areas of interesting flow features. Among other applications, the PowerFLOW solver is used for aerodynamic simulations in car body development where the advantages of automatic grid generation from CAD models is of great interest. In a joint project with BMW and EXA, we are developing a visualization tool which incorporates virtual reality techniques for the interactive exploration of the large scalar and vector data sets. We describe the specific data structures and interpolation techniques and we report on fast particle tracing, taking into account collisions with the car body geometry. An OpenGL Optimizer based implementation allows for the inspection of the flow with particle probes and slice probes at interactive frame rates.","AuthorNamesDeduped":"Martin Schulz 0005;Frank Reck;Wolf Bartelheimer;Thomas Ertl","AuthorNames":"M. Schulz;F. Reck;W. Bertelheimer;T. Ertl","AuthorAffiliation":"Visualization & Interactive Syst. Group, Stuttgart Univ., Germany","InternalReferences":"10.1109/VISUAL.1997.663911","AuthorKeywords":"","AminerCitationCount022019":"","XPloreCitationCount022019":"6","PubsCited":"7","Award":""}},{"name":"Alireza Entezari","value":89,"numPapers":58,"cluster":"3","visible":1,"index":279,"weight":9,"x":410.9566239075065,"y":560.5265738555568,"px":414.6163528495226,"py":557.2108728194801,"node":{"Conference":"Vis","Year":"1993","Title":"Optimal filter design for volume reconstruction and visualization","DOI":"10.1109/VISUAL.1993.398851","Link":"http://dx.doi.org/10.1109/VISUAL.1993.398851","FirstPage":"54","LastPage":"61","PaperType":"C","Abstract":"Digital filtering is a crucial operation in volume reconstruction and visualization. Lowpass filters are needed for subsampling and minification. Interpolation filters are needed for registration and magnification, and to compensate for geometric distortions introduced by scanners. Interpolation filters are also needed in volume rendering for ray-casting and slicing. In this paper, we describe a method for digital filter design of interpolation filters based on weighted Chebyshev minimization. The accuracy of the resulting filters are compared with some commonly used filters defined by piecewise cubic polynomials. A significant finding of this paper is that although piecewise cubic interpolation has some computational advantages and may yield visually satisfactory results for some data, other data result in artifacts such as blurring. Furthermore, piecewise cubic filters are inferior for operations such as registration. Better results are obtained by the filters derived in this papers at only small increases in computation.<<ETX>>","AuthorNamesDeduped":"Ingrid Carlbom","AuthorNames":"I. Carlbom","AuthorAffiliation":"Digital Equipment Corp., Cambridge, MA, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"43","XPloreCitationCount022019":"20","PubsCited":"26","Award":""}},{"name":"Thomas Theußl","value":30,"numPapers":12,"cluster":"3","visible":1,"index":280,"weight":2,"x":299.6592994115673,"y":714.6160906953896,"px":302.2230741187968,"py":708.2688622274228,"node":{"Conference":"Vis","Year":"1994","Title":"An evaluation of reconstruction filters for volume rendering","DOI":"10.1109/VISUAL.1994.346331","Link":"http://dx.doi.org/10.1109/VISUAL.1994.346331","FirstPage":"100","LastPage":"107, C10","PaperType":"C","Abstract":"To render images from a three-dimensional array of sample values, it is necessary to interpolate between the samples. This paper is concerned with interpolation methods that are equivalent to convolving the samples with a reconstruction filter; this covers all commonly used schemes, including trilinear and cubic interpolation. We first outline the formal basis of interpolation in three-dimensional signal processing theory. We then propose numerical metrics that can be used to measure filter characteristics that are relevant to the appearance of images generated using that filter. We apply those metrics to several previously used filters and relate the results to isosurface images of the interpolations. We show that the choice of interpolation scheme can have a dramatic effect on image quality, and we discuss the cost/benefit tradeoff inherent in choosing a filter.<<ETX>>","AuthorNamesDeduped":"Steve Marschner;Richard Lobb","AuthorNames":"S.R. Marschner;R.J. Lobb","AuthorAffiliation":"Program of Comput. Graphics, Cornell Univ., Ithaca, NY, USA;Program of Comput. Graphics, Cornell Univ., Ithaca, NY, USA","InternalReferences":"10.1109/VISUAL.1993.398851","AuthorKeywords":"","AminerCitationCount022019":"372","XPloreCitationCount022019":"113","PubsCited":"19","Award":""}},{"name":"Wei Qiao","value":51,"numPapers":21,"cluster":"4","visible":1,"index":281,"weight":2,"x":289.31230025750074,"y":212.70695604299618,"px":296.2864209138635,"py":216.70584335761416,"node":{"Conference":"Vis","Year":"2000","Title":"Hardware-accelerated volume and isosurface rendering based on cell-projection","DOI":"10.1109/VISUAL.2000.885683","Link":"http://dx.doi.org/10.1109/VISUAL.2000.885683","FirstPage":"109","LastPage":"116","PaperType":"C","Abstract":"We present two beneficial rendering extensions to the projected tetrahedra (PT) algorithm proposed by Shirley and Tuchman (1990). These extensions are compatible with any cell sorting technique, for example the BSP-XMPVO sorting algorithm for unstructured meshes. Using 3D texture mapping our first extension solves the longstanding problem of hardware-accelerated but accurate rendering of tetrahedral volume cells with arbitrary transfer functions. By employing 2D texture mapping our second extension realizes the hardware-accelerated rendering of multiple shaded isosurfaces within the PT algorithm without reconstructing the isosurfaces. Additionally, two methods are presented to combine projected tetrahedral volumes with isosurfaces. The time complexity of all our algorithms is linear in the number of tetrahedra and does neither depend on the number of isosurfaces nor on the employed transfer functions.","AuthorNamesDeduped":"Stefan Röttger;Martin Kraus;Thomas Ertl","AuthorNames":"S. Rottger;M. Kraus;T. Ertl","AuthorAffiliation":"Visualization & Interactive Syst. Group, Stuttgart Univ., Germany","InternalReferences":"10.1109/VISUAL.1993.398846;10.1109/VISUAL.1994.346320;10.1109/VISUAL.1999.809887;10.1109/VISUAL.1994.346308;10.1109/VISUAL.2000.885688;10.1109/VISUAL.1994.346306;10.1109/VISUAL.1997.663853;10.1109/VISUAL.1999.809878;10.1109/VISUAL.1996.568127;10.1109/VISUAL.1995.480806;10.1109/VISUAL.1998.745300;10.1109/VISUAL.1996.568121;10.1109/VISUAL.1998.745713","AuthorKeywords":"Volume Rendering, Isosurfaces, Unstructured Meshes, Cell Projection, Graphics Hardware, Texture Mapping, Compositing","AminerCitationCount022019":"214","XPloreCitationCount022019":"52","PubsCited":"35","Award":""}},{"name":"Fernanda B. Viégas","value":553,"numPapers":36,"cluster":"0","visible":1,"index":282,"weight":35,"x":652.4367061923797,"y":287.88205752651027,"px":651.1824698230682,"py":289.80622015903657,"node":{"Conference":"InfoVis","Year":"2004","Title":"Artifacts of the Presence Era: Using Information Visualization to Create an Evocative Souvenir","DOI":"10.1109/INFVIS.2004.8","Link":"http://dx.doi.org/10.1109/INFVIS.2004.8","FirstPage":"105","LastPage":"111","PaperType":"C","Abstract":"We present Artifacts of the Presence Era, a digital installation that uses a geological metaphor to visualize the events in a physical space over time. The piece captures video and audio from a museum and constructs an impressionistic visualization of the evolving history in the space. Instead of creating a visualization tool for data analysis, we chose to produce a piece that functions as a souvenir of a particular time and place. We describe the design choices we made in creating this installation, the visualization techniques we developed, and the reactions we observed from users and the media. We suggest that the same approach can be applied to a more general set of visualization contexts, ranging from email archives to newsgroups conversations","AuthorNamesDeduped":"Fernanda B. Viégas;Ethan Perry;Ethan Howe;Judith S. Donath","AuthorNames":"F.B. Viegas;E. Perry;E. Howe;J. Donath","AuthorAffiliation":"Massachusetts Institute of Technology","InternalReferences":"","AuthorKeywords":"visualization, history, public space","AminerCitationCount022019":"50","XPloreCitationCount022019":"12","PubsCited":"15","Award":""}},{"name":"Jeffrey Heer","value":1579,"numPapers":147,"cluster":"0","visible":1,"index":283,"weight":130,"x":563.044283024605,"y":330.7851302334234,"px":562.7574355256089,"py":328.73806321950514,"node":{"Conference":"InfoVis","Year":"2004","Title":"A Comparison of the Readability of Graphs Using Node-Link and Matrix-Based Representations","DOI":"10.1109/INFVIS.2004.1","Link":"http://dx.doi.org/10.1109/INFVIS.2004.1","FirstPage":"17","LastPage":"24","PaperType":"C","Abstract":"In this paper, we describe a taxonomy of generic graph related tasks and an evaluation aiming at assessing the readability of two representations of graphs: matrix-based representations and node-link diagrams. This evaluation bears on seven generic tasks and leads to important recommendations with regard to the representation of graphs according to their size and density. For instance, we show that when graphs are bigger than twenty vertices, the matrix-based visualization performs better than node-link diagrams on most tasks. Only path finding is consistently in favor of node-link diagrams throughout the evaluation","AuthorNamesDeduped":"Robert A. Amar;John T. Stasko","AuthorNames":"M. Ghoniem;J.-D. Fekete;P. Castagliola","AuthorAffiliation":"Ecole des Mines de Nantes","InternalReferences":"10.1109/INFVIS.2003.1249030","AuthorKeywords":"Visualization of graphs, adjacency matrices, node-link representation, readability, evaluation","AminerCitationCount022019":"337","XPloreCitationCount022019":"118","PubsCited":"14","Award":""}},{"name":"Oliver Deussen","value":149,"numPapers":107,"cluster":"15","visible":1,"index":284,"weight":12,"x":634.7417034777671,"y":261.8281156569138,"px":632.6384862998823,"py":265.85078657015674,"node":{"Conference":"Vis","Year":"1997","Title":"ROAMing terrain: Real-time Optimally Adapting Meshes","DOI":"10.1109/VISUAL.1997.663860","Link":"http://dx.doi.org/10.1109/VISUAL.1997.663860","FirstPage":"81","LastPage":"88","PaperType":"C","Abstract":"Terrain visualization is a difficult problem for applications requiring accurate images of large datasets at high frame rates, such as flight simulation and ground-based aircraft testing using synthetic sensor simulation. On current graphics hardware, the problem is to maintain dynamic, view-dependent triangle meshes and texture maps that produce good images at the required frame rate. We present an algorithm for constructing triangle meshes that optimizes flexible view-dependent error metrics, produces guaranteed error bounds, achieves specified triangle counts directly and uses frame-to-frame coherence to operate at high frame rates for thousands of triangles per frame. Our method, dubbed Real-time Optimally Adapting Meshes (ROAM), uses two priority queues to drive split and merge operations that maintain continuous triangulations built from pre-processed bintree triangles. We introduce two additional performance optimizations: incremental triangle stripping and priority-computation deferral lists. ROAM's execution time is proportional to the number of triangle changes per frame, which is typically a few percent of the output mesh size; hence ROAM's performance is insensitive to the resolution and extent of the input terrain. Dynamic terrain and simple vertex morphing are supported.","AuthorNamesDeduped":"Mark A. Duchaineau;Murray Wolinsky;David E. Sigeti;Mark C. Miller;Charles Aldrich;Mark B. Mineev-Weinstein","AuthorNames":"M. Duchaineau;M. Wolinsky;D.E. Sigeti;M.C. Miller;C. Aldrich;M.B. Mineev-Weinstein","AuthorAffiliation":"Los Alamos Nat. Lab., NM, USA","InternalReferences":"10.1109/VISUAL.1996.567600;10.1109/VISUAL.1996.568126;10.1109/VISUAL.1996.568125;10.1109/VISUAL.1995.480813;10.1109/VISUAL.1995.480805","AuthorKeywords":"triangle bintree, view-dependent mesh, frame-to-frame coherence, greedy algorithms","AminerCitationCount022019":"1260","XPloreCitationCount022019":"170","PubsCited":"19","Award":""}},{"name":"Jimmy Johansson","value":249,"numPapers":46,"cluster":"2","visible":1,"index":285,"weight":4,"x":387.4531495264017,"y":313.6698593376275,"px":391.5251455058295,"py":315.38897663412774,"node":{"Conference":"Vis","Year":"1990","Title":"Parallel coordinates: a tool for visualizing multi-dimensional geometry","DOI":"10.1109/VISUAL.1990.146402","Link":"http://dx.doi.org/10.1109/VISUAL.1990.146402","FirstPage":"361","LastPage":"378","PaperType":"C","Abstract":"A methodology for visualizing analytic and synthetic geometry in R/sup N/ is presented. It is based on a system of parallel coordinates which induces a nonprojective mapping between N-dimensional and two-dimensional sets. Hypersurfaces are represented by their planar images which have some geometrical properties analogous to the properties of the hypersurface that they represent. A point from to line duality when N=2 generalizes to lines and hyperplanes enabling the representation of polyhedra in R/sup N/. The representation of a class of convex and non-convex hypersurfaces is discussed, together with an algorithm for constructing and displaying any interior point. The display shows some local properties of the hypersurface and provides information on the point's proximity to the boundary. Applications are discussed.<<ETX>>","AuthorNamesDeduped":"Alfred Inselberg;Bernard Dimsdale","AuthorNames":"A. Inselberg;B. Dimsdale","AuthorAffiliation":"IBM Sci. Center, Los Angeles, CA, USA;IBM Sci. Center, Los Angeles, CA, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"920","XPloreCitationCount022019":"308","PubsCited":"47","Award":""}},{"name":"Robert Kosara","value":280,"numPapers":31,"cluster":"2","visible":1,"index":286,"weight":7,"x":667.0687371117715,"y":282.65478706271125,"px":663.5740876629976,"py":284.46238191136143,"node":{"Conference":"Vis","Year":"2000","Title":"FastSplats: optimized splatting on rectilinear grids","DOI":"10.1109/VISUAL.2000.885698","Link":"http://dx.doi.org/10.1109/VISUAL.2000.885698","FirstPage":"219","LastPage":"226","PaperType":"C","Abstract":"Splatting is widely applied in many areas, including volume, point-based and image-based rendering. Improvements to splatting, such as eliminating popping and color bleeding, occasion-based acceleration, post-rendering classification and shading, have all been recently accomplished. These improvements share a common need for efficient frame-buffer accesses. We present an optimized software splatting package, using a newly designed primitive, called FastSplat, to scan-convert footprints. Our approach does not use texture mapping hardware, but supports the whole pipeline in memory. In such an integrated pipeline, we are then able to study the optimization strategies and address image quality issues. While this research is meant for a study of the inherent trade-off of splatting, our renderer, purely in software, achieves 3- to 5-fold speedups over a top-end texture hardware implementation (for opaque data sets). We further propose a method of efficient occlusion culling using a summed area table of opacity. 3D solid texturing and bump mapping capabilities are demonstrated to show the flexibility of such an integrated rendering pipeline. A detailed numerical error analysis, in addition to the performance and storage issues, is also presented. Our approach requires low storage and uses simple operations. Thus, it is easily implementable in hardware.","AuthorNamesDeduped":"Jian Huang;Roger Crawfis;Naeem Shareef;Klaus Mueller","AuthorNames":"Jian Huang;K. Mueller;N. Shareef;R. Crawfis","AuthorAffiliation":"Dept. of Comput. & Inf. Sci., Ohio State Univ., Columbus, OH, USA","InternalReferences":"10.1109/VISUAL.1999.809909;10.1109/VISUAL.1993.398877;10.1109/VISUAL.1999.809872","AuthorKeywords":"","AminerCitationCount022019":"77","XPloreCitationCount022019":"9","PubsCited":"22","Award":""}},{"name":"Helmut Doleisch","value":217,"numPapers":53,"cluster":"3","visible":1,"index":287,"weight":11,"x":380.29659802004574,"y":400.96827188087565,"px":383.3129807991555,"py":402.1219165854558,"node":{"Conference":"InfoVis","Year":"1996","Title":"Selection: 524,288 ways to say \"this is interesting\"","DOI":"10.1109/INFVIS.1996.559216","Link":"http://dx.doi.org/10.1109/INFVIS.1996.559216","FirstPage":"54","LastPage":"60, 120","PaperType":"C","Abstract":"Visualization is a critical technology for understanding complex, data-rich systems. Effective visualizations make important features of the data immediately recognizable and enable the user to discover interesting and useful results by highlighting patterns. A key element of such systems is the ability to interact with displays of data by selecting a subset for further investigation. This operation is needed for use in linked-views systems and in drill-down analysis. It is a common manipulation in many other systems. It is as ubiquitous as selecting icons in a desktop GUI. It is therefore surprising to note that little research has been done on how selection can be implemented. This paper addresses this omission, presenting a taxonomy for selection mechanisms and discussing the interactions between branches of the taxonomy. Our suggestion of 524,288 possible systems [2/sup 16/ operation systems/spl times/2 (memory/memoryless)/spl times/2 (data-dependent/independent)/spl times/2 (brush/lasso)] is more in fun than serious, as within the taxonomy there are many different choices that can be made. This framework is the result of considering both the current state of the art and historical antecedents.","AuthorNamesDeduped":"Graham J. Wills","AuthorNames":"G.J. Wills","AuthorAffiliation":"AT&T Bell Labs., Naperville, IL, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"102","XPloreCitationCount022019":"32","PubsCited":"14","Award":""}},{"name":"Elena Fanea","value":24,"numPapers":13,"cluster":"2","visible":1,"index":288,"weight":2,"x":358.15904909382954,"y":195.0634794938321,"px":364.5358662619344,"py":198.75412770791033,"node":{"Conference":"Vis","Year":"1995","Title":"High Dimensional Brushing for Interactive Exploration of Multivariate Data","DOI":"10.1109/VISUAL.1995.485139","Link":"http://dx.doi.org/10.1109/VISUAL.1995.485139","FirstPage":"271","LastPage":"","PaperType":"C","Abstract":"","AuthorNamesDeduped":"Allen R. Martin;Matthew O. Ward","AuthorNames":"A.R. Martin;M.O. Ward","AuthorAffiliation":"","InternalReferences":"10.1109/VISUAL.1990.146386;10.1109/VISUAL.1990.146402;10.1109/VISUAL.1994.346302","AuthorKeywords":"","AminerCitationCount022019":"224","XPloreCitationCount022019":"72","PubsCited":"9","Award":""}},{"name":"M. Sheelagh T. Carpendale","value":24,"numPapers":13,"cluster":"2","visible":1,"index":289,"weight":2,"x":350.21991692697156,"y":179.84082564137847,"px":356.2004566153171,"py":183.94075618197724,"node":{"Conference":"Vis","Year":"1995","Title":"High Dimensional Brushing for Interactive Exploration of Multivariate Data","DOI":"10.1109/VISUAL.1995.485139","Link":"http://dx.doi.org/10.1109/VISUAL.1995.485139","FirstPage":"271","LastPage":"","PaperType":"C","Abstract":"","AuthorNamesDeduped":"Allen R. Martin;Matthew O. Ward","AuthorNames":"A.R. Martin;M.O. Ward","AuthorAffiliation":"","InternalReferences":"10.1109/VISUAL.1990.146386;10.1109/VISUAL.1990.146402;10.1109/VISUAL.1994.346302","AuthorKeywords":"","AminerCitationCount022019":"224","XPloreCitationCount022019":"72","PubsCited":"9","Award":""}},{"name":"Tobias Isenberg 0001","value":305,"numPapers":100,"cluster":"3","visible":1,"index":290,"weight":24,"x":536.1550336867542,"y":431.5723101866967,"px":536.9981493534402,"py":429.8829509584428,"node":{"Conference":"Vis","Year":"1995","Title":"High Dimensional Brushing for Interactive Exploration of Multivariate Data","DOI":"10.1109/VISUAL.1995.485139","Link":"http://dx.doi.org/10.1109/VISUAL.1995.485139","FirstPage":"271","LastPage":"","PaperType":"C","Abstract":"","AuthorNamesDeduped":"Allen R. Martin;Matthew O. Ward","AuthorNames":"A.R. Martin;M.O. Ward","AuthorAffiliation":"","InternalReferences":"10.1109/VISUAL.1990.146386;10.1109/VISUAL.1990.146402;10.1109/VISUAL.1994.346302","AuthorKeywords":"","AminerCitationCount022019":"224","XPloreCitationCount022019":"72","PubsCited":"9","Award":""}},{"name":"Michelle X. Zhou","value":347,"numPapers":53,"cluster":"0","visible":1,"index":291,"weight":13,"x":684.1606360282132,"y":293.6433696580674,"px":680.369504222841,"py":295.58669289721735,"node":{"Conference":"Vis","Year":"1990","Title":"A problem-oriented classification of visualization techniques","DOI":"10.1109/VISUAL.1990.146375","Link":"http://dx.doi.org/10.1109/VISUAL.1990.146375","FirstPage":"139","LastPage":"143, 469","PaperType":"C","Abstract":"Progress in scientific visualization could be accelerated if workers could more readily find visualization techniques relevant to a given problem. The authors describe an approach to this problem, based on a classification of visualization techniques, that is independent of particular application domains. A user breaks up a problem into subproblems, describes these subproblems in terms of the objects to be represented and the operations to be supported by a representation, locates applicable visualization techniques in a catalog, and combines these representations into a composite representation for the original problem. The catalog and its underlying classification provide a way for workers in different application disciplines to share methods.<<ETX>>","AuthorNamesDeduped":"Stephen Wehrend;Clayton Lewis","AuthorNames":"S. Wehrend;C. Lewis","AuthorAffiliation":"Colorado Univ., Boulder, CO, USA;Colorado Univ., Boulder, CO, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"353","XPloreCitationCount022019":"90","PubsCited":"6","Award":""}},{"name":"Tobias Schreck","value":329,"numPapers":114,"cluster":"2","visible":1,"index":292,"weight":28,"x":513.3775391912259,"y":270.2545657517491,"px":517.0850208455699,"py":272.70772364011617,"node":{"Conference":"InfoVis","Year":"1999","Title":"A Java-based visual mining infrastructure and applications","DOI":"10.1109/INFVIS.1999.801867","Link":"http://dx.doi.org/10.1109/INFVIS.1999.801867","FirstPage":"124","LastPage":"127, 153","PaperType":"C","Abstract":"Many real-world KDD (Knowledge Discovery & Data Mining) applications involve the navigation of large volumes of information on the web, such as, Internet resources, hot topics, and telecom phone switches. Quite often users feel lost, confused and overwhelmed with displays that contain too much information. This paper discusses a new content-driven visual mining infrastructure called VisMine, that uses several innovative techniques: (1) hidden visual structure and relationships for uncluttering displays; (2) simultaneous visual presentations for high-dimensional knowledge discovery; and (3) a new visual interface to plug in existing graphic toolkits for expanding its use in a wide variety of visual applications. We have applied this infrastructure to three data mining visualization applications-topic hierarchy for document navigation, web-based trouble shooting, and telecom switch mining.","AuthorNamesDeduped":"Ming C. Hao;Umeshwar Dayal;Meichun Hsu;Jim Baker;Bob Deletto","AuthorNames":"M.C. Hao;U. Dayal;M. Hsu;J. Baker;R. D'Eletto","AuthorAffiliation":"Hewlett Packard Res. Labs., USA","InternalReferences":"10.1109/VISUAL.1998.745301;10.1109/VISUAL.1993.398870","AuthorKeywords":"","AminerCitationCount022019":"50","XPloreCitationCount022019":"4","PubsCited":"9","Award":""}},{"name":"Chris North","value":418,"numPapers":121,"cluster":"1","visible":1,"index":293,"weight":45,"x":530.27898149612,"y":188.03338706098447,"px":532.6716130368802,"py":193.72776092322152,"node":{"Conference":"InfoVis","Year":"1995","Title":"IVEE: an Information Visualization and Exploration Environment","DOI":"10.1109/INFVIS.1995.528688","Link":"http://dx.doi.org/10.1109/INFVIS.1995.528688","FirstPage":"66","LastPage":"73","PaperType":"C","Abstract":"The Information Visualization and Exploration Environment (NEE) is a system for automatic creation of dynamic queries applications. IVEE imports database relations and automatically creates environments holding visualizations and query devices. IVEE offers multiple visualizations such as maps and starfields, and multiple query devices, such as sliders, alphasliders, and toggles. Arbitrary graphical objects can be attached to database objects in visualizations. Multiple visualizations may be active simultaneously. Users can interactively lay out and change between types of query devices. Users may retrieve details-on-demand by clicking on visualization objects. An HTML file may be provided along with the database, specifying how details-on-demand information should be presented, allowing for presentation of multimedia information in database objects. Finally, multiple IVEE clients running on separate workstations on a network can communicate by letting one user's actions affect the visualization in an another IVEE client.","AuthorNamesDeduped":"Christopher Ahlberg;Erik Wistrand","AuthorNames":"C. Ahlberg;E. Wistrand","AuthorAffiliation":"Dept. of Comput. Sci., Chalmers Univ. of Technol., Goteborg, Sweden;Dept. of Comput. Sci., Chalmers Univ. of Technol., Goteborg, Sweden","InternalReferences":"10.1109/VISUAL.1991.175815;10.1109/VISUAL.1993.398863","AuthorKeywords":"","AminerCitationCount022019":"204","XPloreCitationCount022019":"54","PubsCited":"28","Award":""}},{"name":"Robert A. Amar","value":359,"numPapers":12,"cluster":"0","visible":1,"index":294,"weight":8,"x":589.3936053629272,"y":191.1278709034603,"px":589.2022368496346,"py":196.77260273692207,"node":{"Conference":"InfoVis","Year":"2003","Title":"Using multilevel call matrices in large software projects","DOI":"10.1109/INFVIS.2003.1249030","Link":"http://dx.doi.org/10.1109/INFVIS.2003.1249030","FirstPage":"227","LastPage":"232","PaperType":"C","Abstract":"Traditionally, node link diagrams are the prime choice when it comes to visualizing software architectures. However, node link diagrams often fall short when used to visualize large graph structures. In this paper we investigate the use of call matrices as visual aids in the management of large software projects. We argue that call matrices have a number of advantages over traditional node link diagrams when the main object of interest is the link instead of the node. Matrix visualizations can provide stable and crisp layouts of large graphs and are inherently well suited for large multilevel visualizations because of their recursive structure. We discuss a number of visualization issues, using a very large software project currently under development at Philips Medical Systems as a running example.","AuthorNamesDeduped":"Frank van Ham","AuthorNames":"F. van Ham","AuthorAffiliation":"Dept. of Math. & Comput. Sci., Technische Universiteit Eindhoven, Netherlands","InternalReferences":"10.1109/INFVIS.2002.1173141;10.1109/INFVIS.2003.1249004;10.1109/VISUAL.1991.175815","AuthorKeywords":"software visualization, multilevel visualization, call matrix","AminerCitationCount022019":"","XPloreCitationCount022019":"28","PubsCited":"14","Award":""}},{"name":"Mario Hlawitschka","value":92,"numPapers":20,"cluster":"6","visible":1,"index":295,"weight":1,"x":-48.77407266132626,"y":561.5635574977805,"px":-41.31556616355156,"py":559.605718212388,"node":{"Conference":"Vis","Year":"2004","Title":"Topological lines in 3D tensor fields","DOI":"10.1109/VISUAL.2004.105","Link":"http://dx.doi.org/10.1109/VISUAL.2004.105","FirstPage":"313","LastPage":"320","PaperType":"C","Abstract":"Visualization of 3D tensor fields continues to be a major challenge in terms of providing intuitive and uncluttered images that allow the users to better understand their data. The primary focus of this paper is on finding a formulation that lends itself to a stable numerical algorithm for extracting stable and persistent topological features from 2nd order real symmetric 3D tensors. While features in 2D tensors can be identified as either wedge or trisector points, in 3D, the corresponding stable features are lines, not just points. These topological feature lines provide a compact representation of the 3D tensor field and are essential in helping scientists and engineers understand their complex nature. Existing techniques work by finding degenerate points and are not numerically stable, and worse, produce both false positive and false negative feature points. This work seeks to address this problem with a robust algorithm that can extract these features in a numerically stable, accurate, and complete manner.","AuthorNamesDeduped":"Xiaoqiang Zheng;Alex T. Pang","AuthorNames":"X. Zheng;A. Pang","AuthorAffiliation":"Dept. of Comput. Sci., California Univ., Santa Cruz, CA, USA;Dept. of Comput. Sci., California Univ., Santa Cruz, CA, USA","InternalReferences":"10.1109/VISUAL.1998.745316;10.1109/VISUAL.1999.809894;10.1109/VISUAL.1993.398849;10.1109/VISUAL.2003.1250379;10.1109/VISUAL.2002.1183798;10.1109/VISUAL.1994.346326;10.1109/VISUAL.1999.809905;10.1109/VISUAL.1998.745294;10.1109/VISUAL.1999.809886","AuthorKeywords":"hyperstreamlines, real symmetric tensors, degenerate tensors, tensor topology, topological lines","AminerCitationCount022019":"63","XPloreCitationCount022019":"20","PubsCited":"22","Award":""}},{"name":"Steven P. Callahan","value":184,"numPapers":27,"cluster":"4","visible":1,"index":296,"weight":9,"x":388.60848338016274,"y":363.3573289161961,"px":392.2252221400266,"py":364.612743070462,"node":{"Conference":"Vis","Year":"1998","Title":"Interactive out-of-core isosurface extraction","DOI":"10.1109/VISUAL.1998.745299","Link":"http://dx.doi.org/10.1109/VISUAL.1998.745299","FirstPage":"167","LastPage":"174","PaperType":"C","Abstract":"We present a novel out-of-core technique for the interactive computation of isosurfaces from volume data. Our algorithm minimizes the main memory and disk space requirements on the visualization workstation, while speeding up isosurface extraction queries. Our overall approach is a two-level indexing scheme. First, by our meta-cell technique, we partition the original dataset into clusters of cells, called meta-cells. Secondly, we produce meta-intervals associated with the meta-cells, and build an indexing data structure on the meta-intervals. We separate the cell information, kept only in meta-cells on disk, from the indexing structure, which is also on disk and only contains pointers to meta-cells. Our meta-cell technique is an I/O-efficient approach for computing a k-d-tree-like partition of the dataset. Our indexing data structure, the binary blocked I/O interval tree, is a new I/O-optimal data structure to perform stabbing queries that report from a set of meta-intervals (or intervals) those containing a query value q. Our tree is simpler to implement, and is also more space-efficient in practice than existing structures. To perform an isosurface query, we first query the indexing structure, and then use the reported meta-cell pointers to read from disk the active meta-cells intersected by the isosurface. The isosurface itself can then be generated from active meta-cells. Rather than being a single cost indexing approach, our technique exhibits a smooth trade-off between query time and disk space.","AuthorNamesDeduped":"Yi-Jen Chiang;Cláudio T. Silva;William J. Schroeder","AuthorNames":"Y.-J. Chiang;C.T. Silva;W.J. Schroeder","AuthorAffiliation":"","InternalReferences":"10.1109/VISUAL.1997.663888;10.1109/VISUAL.1997.663895;10.1109/VISUAL.1996.568121","AuthorKeywords":"Isosurface Extraction, Marching Cubes, Out-Of-Core Computation, Interval Tree, Scientific Visualization","AminerCitationCount022019":"178","XPloreCitationCount022019":"42","PubsCited":"28","Award":""}},{"name":"Carlos Eduardo Scheidegger","value":369,"numPapers":111,"cluster":"0","visible":1,"index":297,"weight":17,"x":437.0064537501747,"y":375.6205110561334,"px":441.64803835270175,"py":377.3735156539781,"node":{"Conference":"Vis","Year":"1998","Title":"Interactive out-of-core isosurface extraction","DOI":"10.1109/VISUAL.1998.745299","Link":"http://dx.doi.org/10.1109/VISUAL.1998.745299","FirstPage":"167","LastPage":"174","PaperType":"C","Abstract":"We present a novel out-of-core technique for the interactive computation of isosurfaces from volume data. Our algorithm minimizes the main memory and disk space requirements on the visualization workstation, while speeding up isosurface extraction queries. Our overall approach is a two-level indexing scheme. First, by our meta-cell technique, we partition the original dataset into clusters of cells, called meta-cells. Secondly, we produce meta-intervals associated with the meta-cells, and build an indexing data structure on the meta-intervals. We separate the cell information, kept only in meta-cells on disk, from the indexing structure, which is also on disk and only contains pointers to meta-cells. Our meta-cell technique is an I/O-efficient approach for computing a k-d-tree-like partition of the dataset. Our indexing data structure, the binary blocked I/O interval tree, is a new I/O-optimal data structure to perform stabbing queries that report from a set of meta-intervals (or intervals) those containing a query value q. Our tree is simpler to implement, and is also more space-efficient in practice than existing structures. To perform an isosurface query, we first query the indexing structure, and then use the reported meta-cell pointers to read from disk the active meta-cells intersected by the isosurface. The isosurface itself can then be generated from active meta-cells. Rather than being a single cost indexing approach, our technique exhibits a smooth trade-off between query time and disk space.","AuthorNamesDeduped":"Yi-Jen Chiang;Cláudio T. Silva;William J. Schroeder","AuthorNames":"Y.-J. Chiang;C.T. Silva;W.J. Schroeder","AuthorAffiliation":"","InternalReferences":"10.1109/VISUAL.1997.663888;10.1109/VISUAL.1997.663895;10.1109/VISUAL.1996.568121","AuthorKeywords":"Isosurface Extraction, Marching Cubes, Out-Of-Core Computation, Interval Tree, Scientific Visualization","AminerCitationCount022019":"178","XPloreCitationCount022019":"42","PubsCited":"28","Award":""}},{"name":"Juliana Freire","value":401,"numPapers":56,"cluster":"5","visible":1,"index":298,"weight":16,"x":509.99835056882483,"y":475.483658584717,"px":511.36130400836265,"py":472.43212494821574,"node":{"Conference":"Vis","Year":"1998","Title":"Interactive out-of-core isosurface extraction","DOI":"10.1109/VISUAL.1998.745299","Link":"http://dx.doi.org/10.1109/VISUAL.1998.745299","FirstPage":"167","LastPage":"174","PaperType":"C","Abstract":"We present a novel out-of-core technique for the interactive computation of isosurfaces from volume data. Our algorithm minimizes the main memory and disk space requirements on the visualization workstation, while speeding up isosurface extraction queries. Our overall approach is a two-level indexing scheme. First, by our meta-cell technique, we partition the original dataset into clusters of cells, called meta-cells. Secondly, we produce meta-intervals associated with the meta-cells, and build an indexing data structure on the meta-intervals. We separate the cell information, kept only in meta-cells on disk, from the indexing structure, which is also on disk and only contains pointers to meta-cells. Our meta-cell technique is an I/O-efficient approach for computing a k-d-tree-like partition of the dataset. Our indexing data structure, the binary blocked I/O interval tree, is a new I/O-optimal data structure to perform stabbing queries that report from a set of meta-intervals (or intervals) those containing a query value q. Our tree is simpler to implement, and is also more space-efficient in practice than existing structures. To perform an isosurface query, we first query the indexing structure, and then use the reported meta-cell pointers to read from disk the active meta-cells intersected by the isosurface. The isosurface itself can then be generated from active meta-cells. Rather than being a single cost indexing approach, our technique exhibits a smooth trade-off between query time and disk space.","AuthorNamesDeduped":"Yi-Jen Chiang;Cláudio T. Silva;William J. Schroeder","AuthorNames":"Y.-J. Chiang;C.T. Silva;W.J. Schroeder","AuthorAffiliation":"","InternalReferences":"10.1109/VISUAL.1997.663888;10.1109/VISUAL.1997.663895;10.1109/VISUAL.1996.568121","AuthorKeywords":"Isosurface Extraction, Marching Cubes, Out-Of-Core Computation, Interval Tree, Scientific Visualization","AminerCitationCount022019":"178","XPloreCitationCount022019":"42","PubsCited":"28","Award":""}},{"name":"Martin Isenburg","value":53,"numPapers":17,"cluster":"6","visible":1,"index":299,"weight":2,"x":-102.07445465927131,"y":277.06342878885687,"px":-92.68903561505019,"py":275.13090027820846,"node":{"Conference":"Vis","Year":"1999","Title":"Progressive Compression of Arbitrary Triangular Meshes","DOI":"10.1109/VIS.1999.10000","Link":"http://doi.ieeecomputersociety.org/10.1109/VIS.1999.10000","FirstPage":"67","LastPage":"72","PaperType":"C","Abstract":"","AuthorNamesDeduped":"Daniel Cohen-Or;David Levin;Offir Remez","AuthorNames":"","AuthorAffiliation":"","InternalReferences":"10.1109/VISUAL.1996.568125","AuthorKeywords":"compression, streaming, progressive meshes, simplification","AminerCitationCount022019":"219","XPloreCitationCount022019":"","PubsCited":"","Award":""}},{"name":"Marcus A. Magnor","value":178,"numPapers":29,"cluster":"15","visible":1,"index":300,"weight":14,"x":348.06285049358024,"y":217.38811289232405,"px":352.7898593001848,"py":221.60658637629894,"node":{"Conference":"Vis","Year":"2003","Title":"Acceleration techniques for GPU-based volume rendering","DOI":"10.1109/VISUAL.2003.1250384","Link":"http://dx.doi.org/10.1109/VISUAL.2003.1250384","FirstPage":"287","LastPage":"292","PaperType":"C","Abstract":"Nowadays, direct volume rendering via 3D textures has positioned itself as an efficient tool for the display and visual analysis of volumetric scalar fields. It is commonly accepted, that for reasonably sized data sets appropriate quality at interactive rates can be achieved by means of this technique. However, despite these benefits one important issue has received little attention throughout the ongoing discussion of texture based volume rendering: the integration of acceleration techniques to reduce per-fragment operations. In this paper, we address the integration of early ray termination and empty-space skipping into texture based volume rendering on graphical processing units (GPU). Therefore, we describe volume ray-casting on programmable graphics hardware as an alternative to object-order approaches. We exploit the early z-test to terminate fragment processing once sufficient opacity has been accumulated, and to skip empty space along the rays of sight. We demonstrate performance gains up to a factor of 3 for typical renditions of volumetric data sets on the ATI 9700 graphics card.","AuthorNamesDeduped":"Jens H. Krüger;Rüdiger Westermann","AuthorNames":"J. Kruger;R. Westermann","AuthorAffiliation":"Comput. Graphics & Visualization Group, Tech. Univ. Munich, Germany;Comput. Graphics & Visualization Group, Tech. Univ. Munich, Germany","InternalReferences":"10.1109/VISUAL.1999.809889;10.1109/VISUAL.1997.663880;10.1109/VISUAL.1993.398852;10.1109/VISUAL.2002.1183764","AuthorKeywords":"Volume Rendering, Programmable Graphics Hardware, Ray-Casting","AminerCitationCount022019":"982","XPloreCitationCount022019":"201","PubsCited":"16","Award":"TT"}},{"name":"Hui Zhang 0006","value":27,"numPapers":12,"cluster":"15","visible":1,"index":301,"weight":2,"x":20.074784209268426,"y":-43.64950707090121,"px":24.24950373261275,"py":-38.44413329342617,"node":{"Conference":"Vis","Year":"1995","Title":"Space walking","DOI":"10.1109/VISUAL.1995.480804","Link":"http://dx.doi.org/10.1109/VISUAL.1995.480804","FirstPage":"126","LastPage":"133, 445","PaperType":"C","Abstract":"Proposes an interactive method for exploring topological spaces based on the natural local geometry of the space. Examples of spaces appropriate for this visualization approach occur in abundance in mathematical visualization, surface and volume visualization problems, and scientific applications such as general relativity. Our approach is based on using a controller to choose a direction in which to \"walk\" a manifold along a local geodesic path. The method automatically generates orientation changes that produce a maximal viewable region with each step of the walk. The proposed interaction framework has many natural properties to help the user develop a useful cognitive map of a space and is well-suited to haptic interfaces that may be incorporated into desktop virtual reality systems.","AuthorNamesDeduped":"Andrew J. Hanson;Hui Ma","AuthorNames":"A.J. Hanson;Hui Ma","AuthorAffiliation":"Dept. of Comput. Sci., Indiana Univ., Bloomington, IN, USA;Dept. of Comput. Sci., Indiana Univ., Bloomington, IN, USA","InternalReferences":"10.1109/VISUAL.1994.346324;10.1109/VISUAL.1992.235222","AuthorKeywords":"","AminerCitationCount022019":"50","XPloreCitationCount022019":"5","PubsCited":"19","Award":""}},{"name":"Fernando Vega Higuera","value":0,"numPapers":10,"cluster":"4","visible":1,"index":302,"weight":1,"x":395.62990453577606,"y":879.748026904929,"px":396.33804625558344,"py":871.801961866389,"node":{"Conference":"Vis","Year":"2004","Title":"Hardware-accelerated adaptive EWA volume splatting","DOI":"10.1109/VISUAL.2004.38","Link":"http://dx.doi.org/10.1109/VISUAL.2004.38","FirstPage":"67","LastPage":"74","PaperType":"C","Abstract":"We present a hardware-accelerated adaptive EWA (elliptical weighted average) volume splatting algorithm. EWA splatting combines a Gaussian reconstruction kernel with a low-pass image filter for high image quality without aliasing artifacts or excessive blurring. We introduce a novel adaptive filtering scheme to reduce the computational cost of EWA splatting. We show how this algorithm can be efficiently implemented on modern graphics processing units (GPUs). Our implementation includes interactive classification and fast lighting. To accelerate the rendering we store splat geometry and 3D volume data locally in GPU memory. We present results for several rectilinear volume datasets that demonstrate the high image quality and interactive rendering speed of our method.","AuthorNamesDeduped":"Wei Chen 0001;Liu Ren;Matthias Zwicker;Hanspeter Pfister","AuthorNames":"Wei Chen;Liu Ren;M. Zwicker;H. Pfister","AuthorAffiliation":"Zhejiang Univ., Hangzhou, China","InternalReferences":"10.1109/VISUAL.1993.398877;10.1109/VISUAL.1997.663882;10.1109/VISUAL.2003.1250403;10.1109/VISUAL.1998.745309;10.1109/VISUAL.1996.567608;10.1109/VISUAL.1999.809909;10.1109/VISUAL.1995.480797;10.1109/VISUAL.2001.964490;10.1109/VISUAL.2000.885698","AuthorKeywords":"Direct volume rendering, volume splatting, EWA filter, hardware acceleration","AminerCitationCount022019":"73","XPloreCitationCount022019":"8","PubsCited":"35","Award":""}},{"name":"Rudolf Fahlbusch","value":0,"numPapers":10,"cluster":"4","visible":1,"index":303,"weight":1,"x":385.72024347796037,"y":831.0848305040116,"px":386.6062067397471,"py":821.1200386382563,"node":{"Conference":"Vis","Year":"2004","Title":"Hardware-accelerated adaptive EWA volume splatting","DOI":"10.1109/VISUAL.2004.38","Link":"http://dx.doi.org/10.1109/VISUAL.2004.38","FirstPage":"67","LastPage":"74","PaperType":"C","Abstract":"We present a hardware-accelerated adaptive EWA (elliptical weighted average) volume splatting algorithm. EWA splatting combines a Gaussian reconstruction kernel with a low-pass image filter for high image quality without aliasing artifacts or excessive blurring. We introduce a novel adaptive filtering scheme to reduce the computational cost of EWA splatting. We show how this algorithm can be efficiently implemented on modern graphics processing units (GPUs). Our implementation includes interactive classification and fast lighting. To accelerate the rendering we store splat geometry and 3D volume data locally in GPU memory. We present results for several rectilinear volume datasets that demonstrate the high image quality and interactive rendering speed of our method.","AuthorNamesDeduped":"Wei Chen 0001;Liu Ren;Matthias Zwicker;Hanspeter Pfister","AuthorNames":"Wei Chen;Liu Ren;M. Zwicker;H. Pfister","AuthorAffiliation":"Zhejiang Univ., Hangzhou, China","InternalReferences":"10.1109/VISUAL.1993.398877;10.1109/VISUAL.1997.663882;10.1109/VISUAL.2003.1250403;10.1109/VISUAL.1998.745309;10.1109/VISUAL.1996.567608;10.1109/VISUAL.1999.809909;10.1109/VISUAL.1995.480797;10.1109/VISUAL.2001.964490;10.1109/VISUAL.2000.885698","AuthorKeywords":"Direct volume rendering, volume splatting, EWA filter, hardware acceleration","AminerCitationCount022019":"73","XPloreCitationCount022019":"8","PubsCited":"35","Award":""}},{"name":"Günther Greiner","value":13,"numPapers":18,"cluster":"4","visible":1,"index":304,"weight":1,"x":85.37883611629846,"y":549.125351127617,"px":92.12844134373998,"py":542.3602390499262,"node":{"Conference":"Vis","Year":"2004","Title":"Hardware-accelerated adaptive EWA volume splatting","DOI":"10.1109/VISUAL.2004.38","Link":"http://dx.doi.org/10.1109/VISUAL.2004.38","FirstPage":"67","LastPage":"74","PaperType":"C","Abstract":"We present a hardware-accelerated adaptive EWA (elliptical weighted average) volume splatting algorithm. EWA splatting combines a Gaussian reconstruction kernel with a low-pass image filter for high image quality without aliasing artifacts or excessive blurring. We introduce a novel adaptive filtering scheme to reduce the computational cost of EWA splatting. We show how this algorithm can be efficiently implemented on modern graphics processing units (GPUs). Our implementation includes interactive classification and fast lighting. To accelerate the rendering we store splat geometry and 3D volume data locally in GPU memory. We present results for several rectilinear volume datasets that demonstrate the high image quality and interactive rendering speed of our method.","AuthorNamesDeduped":"Wei Chen 0001;Liu Ren;Matthias Zwicker;Hanspeter Pfister","AuthorNames":"Wei Chen;Liu Ren;M. Zwicker;H. Pfister","AuthorAffiliation":"Zhejiang Univ., Hangzhou, China","InternalReferences":"10.1109/VISUAL.1993.398877;10.1109/VISUAL.1997.663882;10.1109/VISUAL.2003.1250403;10.1109/VISUAL.1998.745309;10.1109/VISUAL.1996.567608;10.1109/VISUAL.1999.809909;10.1109/VISUAL.1995.480797;10.1109/VISUAL.2001.964490;10.1109/VISUAL.2000.885698","AuthorKeywords":"Direct volume rendering, volume splatting, EWA filter, hardware acceleration","AminerCitationCount022019":"73","XPloreCitationCount022019":"8","PubsCited":"35","Award":""}},{"name":"Balázs Csébfalvi","value":24,"numPapers":13,"cluster":"3","visible":1,"index":305,"weight":1,"x":330.8111895177197,"y":764.4036031816155,"px":331.2350184962226,"py":759.7269749259992,"node":{"Conference":"Vis","Year":"2001","Title":"RTVR-a flexible Java library for interactive volume rendering","DOI":"10.1109/VISUAL.2001.964522","Link":"http://dx.doi.org/10.1109/VISUAL.2001.964522","FirstPage":"279","LastPage":"286","PaperType":"C","Abstract":"This paper presents several distinguishing design features of RTVR-a Java-based library for real-time volume rendering. We describe, how the careful design of data structures, which in our case are based on voxel enumeration, and an intelligent use of lookup tables enable interactive volume rendering even on low-end PC hardware. By assigning voxels to distinct objects within the volume and by using an individual setup and combination of look-up tables for each object, object-aware rendering is performed: different transfer functions, shading models, and also compositing modes can be mixed within a single scene to depict each object in the most appropriate way, while still providing rendering results in real-time. While providing frame rates similar to volume visualization using 3D consumer hardware, the approach utilized by RTVR offers much more flexibility and extensibility due to its pure software nature. Furthermore, due to the memory-efficiency of the data representation and the implementation in Java, RTVR can be used to provide volume viewing facilities over low-bandwidth networks, with almost full control over rendering and visualization mapping parameters (clipping, shading, compositing, transfer function) for the user. This paper also addresses specific problems which arise by the use of Java for interactive visualization.","AuthorNamesDeduped":"Lukas Mroz;Helwig Hauser","AuthorNames":"L. Mroz;H. Hauser","AuthorAffiliation":"VRVis Research Center, Vienna, Austria;VRVis Research Center, Vienna, Austria","InternalReferences":"10.1109/VISUAL.2000.885726;10.1109/VISUAL.1998.745311;10.1109/VISUAL.2000.885694;10.1109/VISUAL.2000.885729;10.1109/VISUAL.1994.346340;10.1109/VISUAL.1999.809878;10.1109/VISUAL.2000.885697","AuthorKeywords":"interactive volume visualization,Internet-based visualization, Java","AminerCitationCount022019":"50","XPloreCitationCount022019":"5","PubsCited":"23","Award":""}},{"name":"Ramsay Dyer","value":27,"numPapers":5,"cluster":"3","visible":1,"index":306,"weight":1,"x":377.5887418137229,"y":974.1598070795445,"px":377.6605443110494,"py":967.3504323047273,"node":{"Conference":"Vis","Year":"1993","Title":"Optimal filter design for volume reconstruction and visualization","DOI":"10.1109/VISUAL.1993.398851","Link":"http://dx.doi.org/10.1109/VISUAL.1993.398851","FirstPage":"54","LastPage":"61","PaperType":"C","Abstract":"Digital filtering is a crucial operation in volume reconstruction and visualization. Lowpass filters are needed for subsampling and minification. Interpolation filters are needed for registration and magnification, and to compensate for geometric distortions introduced by scanners. Interpolation filters are also needed in volume rendering for ray-casting and slicing. In this paper, we describe a method for digital filter design of interpolation filters based on weighted Chebyshev minimization. The accuracy of the resulting filters are compared with some commonly used filters defined by piecewise cubic polynomials. A significant finding of this paper is that although piecewise cubic interpolation has some computational advantages and may yield visually satisfactory results for some data, other data result in artifacts such as blurring. Furthermore, piecewise cubic filters are inferior for operations such as registration. Better results are obtained by the filters derived in this papers at only small increases in computation.<<ETX>>","AuthorNamesDeduped":"Ingrid Carlbom","AuthorNames":"I. Carlbom","AuthorAffiliation":"Digital Equipment Corp., Cambridge, MA, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"43","XPloreCitationCount022019":"20","PubsCited":"26","Award":""}},{"name":"Carlos D. Correa","value":348,"numPapers":73,"cluster":"6","visible":1,"index":307,"weight":25,"x":419.74549575888864,"y":454.1762288257419,"px":422.84941227593515,"py":453.6449712269382,"node":{"Conference":"Vis","Year":"2003","Title":"Empty space skipping and occlusion clipping for texture-based volume rendering","DOI":"10.1109/VISUAL.2003.1250388","Link":"http://dx.doi.org/10.1109/VISUAL.2003.1250388","FirstPage":"317","LastPage":"324","PaperType":"C","Abstract":"We propose methods to accelerate texture-based volume rendering by skipping invisible voxels. We partition the volume into sub-volumes, each containing voxels with similar properties. Sub-volumes composed of only voxels mapped to empty by the transfer function are skipped. To render the adaptively partitioned sub-volumes in visibility order, we reorganize them into an orthogonal BSP tree. We also present an algorithm that computes incrementally the intersection of the volume with the slicing planes, which avoids the overhead of the intersection and texture coordinates computation introduced by the partitioning. Rendering with empty space skipping is 2 to 5 times faster than without it. To skip occluded voxels, we introduce the concept of orthogonal opacity map, that simplifies the transformation between the volume coordinates and the opacity map coordinates, which is intensively used for occlusion detection. The map is updated efficiently by the GPU. The sub-volumes are then culled and clipped against the opacity map. We also present a method that adaptively adjusts the optimal number of the opacity map updates. With occlusion clipping, about 60% of non-empty voxels can be skipped and an additional 80% speedup on average is gained for iso-surface-like rendering.","AuthorNamesDeduped":"Wei Li 0004;Klaus Mueller;Arie E. Kaufman","AuthorNames":"Wei Li;K. Mueller;A. Kaufman","AuthorAffiliation":"Dept. of Comput. Sci., Stony Brook Univ., NY, USA;Dept. of Comput. Sci., Stony Brook Univ., NY, USA;Dept. of Comput. Sci., Stony Brook Univ., NY, USA","InternalReferences":"10.1109/VISUAL.1992.235231;10.1109/VISUAL.2001.964519;10.1109/VISUAL.2003.1250384;10.1109/VISUAL.1999.809908;10.1109/VISUAL.2002.1183776","AuthorKeywords":"Graphics hardware, texture-based volume rendering, empty space skipping, occlusion clipping, orthogonal opacity map","AminerCitationCount022019":"187","XPloreCitationCount022019":"16","PubsCited":"25","Award":""}},{"name":"Shigeo Takahashi","value":90,"numPapers":23,"cluster":"6","visible":1,"index":308,"weight":3,"x":191.73393944836766,"y":359.54718516726916,"px":198.967325987183,"py":362.9638843590503,"node":{"Conference":"Vis","Year":"2005","Title":"A feature-driven approach to locating optimal viewpoints for volume visualization","DOI":"10.1109/VISUAL.2005.1532834","Link":"http://dx.doi.org/10.1109/VISUAL.2005.1532834","FirstPage":"495","LastPage":"502","PaperType":"C","Abstract":"Optimal viewpoint selection is an important task because it considerably influences the amount of information contained in the 2D projected images of 3D objects, and thus dominates their first impressions from a psychological point of view. Although several methods have been proposed that calculate the optimal positions of viewpoints especially for 3D surface meshes, none has been done for solid objects such as volumes. This paper presents a new method of locating such optimal viewpoints when visualizing volumes using direct volume rendering. The major idea behind our method is to decompose an entire volume into a set of feature components, and then find a globally optimal viewpoint by finding a compromise between locally optimal viewpoints for the components. As the feature components, the method employs interval volumes and their combinations that characterize the topological transitions of isosurfaces according to the scalar field. Furthermore, opacity transfer functions are also utilized to assign different weights to the decomposed components so that users can emphasize features of specific interest in the volumes. Several examples of volume datasets together with their optimal positions of viewpoints are exhibited in order to demonstrate that the method can effectively guide naive users to find optimal projections of volumes.","AuthorNamesDeduped":"Shigeo Takahashi;Issei Fujishiro;Yuriko Takeshima;Tomoyuki Nishita","AuthorNames":"S. Takahashi;I. Fujishiro;Y. Takeshima;T. Nishita","AuthorAffiliation":"Tokyo Univ., Japan","InternalReferences":"10.1109/VISUAL.1995.480789;10.1109/VISUAL.2004.96;10.1109/VISUAL.2002.1183774;10.1109/VISUAL.2005.1532833;10.1109/VISUAL.1997.663875;10.1109/VISUAL.2002.1183785","AuthorKeywords":"viewpoint selection, viewpoint entropy, direct volume rendering, interval volumes, level-set graphs","AminerCitationCount022019":"170","XPloreCitationCount022019":"27","PubsCited":"34","Award":""}},{"name":"Tomoyuki Nishita","value":67,"numPapers":8,"cluster":"4","visible":1,"index":309,"weight":1,"x":203.77374045354208,"y":784.0268429801357,"px":203.9349057743809,"py":776.5541715326929,"node":{"Conference":"Vis","Year":"2005","Title":"A feature-driven approach to locating optimal viewpoints for volume visualization","DOI":"10.1109/VISUAL.2005.1532834","Link":"http://dx.doi.org/10.1109/VISUAL.2005.1532834","FirstPage":"495","LastPage":"502","PaperType":"C","Abstract":"Optimal viewpoint selection is an important task because it considerably influences the amount of information contained in the 2D projected images of 3D objects, and thus dominates their first impressions from a psychological point of view. Although several methods have been proposed that calculate the optimal positions of viewpoints especially for 3D surface meshes, none has been done for solid objects such as volumes. This paper presents a new method of locating such optimal viewpoints when visualizing volumes using direct volume rendering. The major idea behind our method is to decompose an entire volume into a set of feature components, and then find a globally optimal viewpoint by finding a compromise between locally optimal viewpoints for the components. As the feature components, the method employs interval volumes and their combinations that characterize the topological transitions of isosurfaces according to the scalar field. Furthermore, opacity transfer functions are also utilized to assign different weights to the decomposed components so that users can emphasize features of specific interest in the volumes. Several examples of volume datasets together with their optimal positions of viewpoints are exhibited in order to demonstrate that the method can effectively guide naive users to find optimal projections of volumes.","AuthorNamesDeduped":"Shigeo Takahashi;Issei Fujishiro;Yuriko Takeshima;Tomoyuki Nishita","AuthorNames":"S. Takahashi;I. Fujishiro;Y. Takeshima;T. Nishita","AuthorAffiliation":"Tokyo Univ., Japan","InternalReferences":"10.1109/VISUAL.1995.480789;10.1109/VISUAL.2004.96;10.1109/VISUAL.2002.1183774;10.1109/VISUAL.2005.1532833;10.1109/VISUAL.1997.663875;10.1109/VISUAL.2002.1183785","AuthorKeywords":"viewpoint selection, viewpoint entropy, direct volume rendering, interval volumes, level-set graphs","AminerCitationCount022019":"170","XPloreCitationCount022019":"27","PubsCited":"34","Award":""}},{"name":"Attila Gyulassy","value":237,"numPapers":54,"cluster":"6","visible":1,"index":310,"weight":28,"x":184.80301059890624,"y":428.3083834836187,"px":192.46388710086376,"py":428.5663174102508,"node":{"Conference":"Vis","Year":"1999","Title":"Collapsing Flow Topology Using Area Metrics","DOI":"10.1109/VISUAL.1999.809907","Link":"http://doi.ieeecomputersociety.org/10.1109/VISUAL.1999.809907","FirstPage":"349","LastPage":"354","PaperType":"C","Abstract":"Visualization of topological information of a vector field can provide useful information on the structure of the field. However, in turbulent flows standard critical point visualization will result in a cluttered image which is difficult to interpret. This paper presents a technique for collapsing topologies. The governing idea is to classify the importance of the critical points in the topology. By only displaying the more important critical points, a simplified depiction of the topology can be provided. Flow consistency is maintained when collapsing the topology, resulting in a visualization which is consistent with the original topology. We apply the collapsing topology technique to a turbulent flow field.","AuthorNamesDeduped":"Wim C. de Leeuw;Robert van Liere","AuthorNames":"W. De Leeuw;R. Van Liere","AuthorAffiliation":"Center for Math. & Comput. Sci., CWI, Amsterdam, Netherlands","InternalReferences":"10.1109/VISUAL.1991.175773","AuthorKeywords":"multi-level visualization techniques, flow visualization, flow topology","AminerCitationCount022019":"102","XPloreCitationCount022019":"25","PubsCited":"0","Award":""}},{"name":"Paolo Cignoni","value":123,"numPapers":26,"cluster":"6","visible":1,"index":311,"weight":3,"x":79.89076733825172,"y":472.85023897525963,"px":88.6233863707279,"py":470.5122445599031,"node":{"Conference":"Vis","Year":"1993","Title":"Geometric optimization","DOI":"10.1109/VISUAL.1993.398868","Link":"http://dx.doi.org/10.1109/VISUAL.1993.398868","FirstPage":"189","LastPage":"195","PaperType":"C","Abstract":"An algorithm is presented which describes an application independent method for reducing the number of polygonal primitives required to faithfully represent an object. Reducing polygon count without a corresponding reduction in object detail is important for: achieving interactive frame rates in scientific visualization, reducing mass storage requirements, and facilitating the transmission of large, multi-timestep geometric data sets. This paper shows how coplanar and nearly coplanar polygons can be merged into larger complex polygons and re-triangulated into fewer simple polygons than originally required. The notable contributions of this paper are: (1) a method for quickly grouping polygons into nearly coplanar sets, (2) a fast approach for merging coplanar polygon sets and, (3) a simple, robust triangulation method for polygons created by 1 and 2. The central idea of the algorithm is the notion of treating polygonal data as a collection of segments and removing redundant segments to quickly form polygon hulls which represent the merged coplanar sets.<<ETX>>","AuthorNamesDeduped":"Paul A. Hinker;Charles D. Hansen","AuthorNames":"P. Hinker;C. Hansen","AuthorAffiliation":"Los Alamos Nat. Lab., NM, USA;Los Alamos Nat. Lab., NM, USA","InternalReferences":"10.1109/VISUAL.1992.235223","AuthorKeywords":"","AminerCitationCount022019":"211","XPloreCitationCount022019":"39","PubsCited":"8","Award":""}},{"name":"D. Constanza","value":37,"numPapers":4,"cluster":"6","visible":1,"index":312,"weight":3,"x":70.87155985230916,"y":421.2608945317956,"px":79.3114608150174,"py":420.9385254865538,"node":{"Conference":"Vis","Year":"1998","Title":"Simplification of tetrahedral meshes","DOI":"10.1109/VISUAL.1998.745315","Link":"http://dx.doi.org/10.1109/VISUAL.1998.745315","FirstPage":"287","LastPage":"295","PaperType":"C","Abstract":"We present a method for the construction of multiple levels of tetrahedral meshes approximating a trivariate function at different levels of detail. Starting with an initial, high-resolution triangulation of a three-dimensional region, we construct coarser representation levels by collapsing tetrahedra. Each triangulation defines a linear spline function, where the function values associated with the vertices are the spline coefficients. Based on predicted errors, we collapse tetrahedron in the grid that do not cause the maximum error to exceed a use-specified threshold. Bounds are stored for individual tetrahedra and are updated as the mesh is simplified. We continue the simplification process until a certain error is reached. The result is a hierarchical data description suited for the efficient visualization of large data sets at varying levels of detail.","AuthorNamesDeduped":"Issac J. Trotts;Bernd Hamann;Kenneth I. Joy;David F. Wiley","AuthorNames":"I.J. Trotts;B. Hamann;K.I. Joy;D.F. Wiley","AuthorAffiliation":"Center for Image Process. & Integrated Comput., California Univ., Davis, CA, USA","InternalReferences":"10.1109/VISUAL.1996.568126;10.1109/VISUAL.1996.568124;10.1109/VISUAL.1997.663906","AuthorKeywords":"approximation, hierarchical representation, mesh generation, multiresolution method, scattered data, spline, triangulation, visualization","AminerCitationCount022019":"95","XPloreCitationCount022019":"20","PubsCited":"18","Award":""}},{"name":"Claudio Montani","value":110,"numPapers":8,"cluster":"6","visible":1,"index":313,"weight":3,"x":85.1707470398243,"y":460.2415346259573,"px":92.91884962192391,"py":459.0417777626048,"node":{"Conference":"Vis","Year":"1992","Title":"Massively parallel isosurface extraction","DOI":"10.1109/VISUAL.1992.235223","Link":"http://dx.doi.org/10.1109/VISUAL.1992.235223","FirstPage":"77","LastPage":"83","PaperType":"C","Abstract":"Experiences during the investigation of parallel methods for faster isosurface generation on SIMD (single instruction stream, multiple data stream) machines are described. A sequential version of a well-known isosurfacing algorithm is algorithmically enhanced for a particular type of SIMD architecture. The SIMD implementation takes full advantage of the data parallel nature of the algorithm, and experiments have proven the implementation to be highly scalable. A parallel tool, which can generate 170 K polygons/s, gives scientists the means to explore large 3D scalar or vector fields interactively.<<ETX>>","AuthorNamesDeduped":"Charles D. Hansen;Paul A. Hinker","AuthorNames":"C.D. Hansen;P. Hinker","AuthorAffiliation":"Los Alamos Nat. Lab., NM, USA;Los Alamos Nat. Lab., NM, USA","InternalReferences":"10.1109/VISUAL.1991.175782","AuthorKeywords":"","AminerCitationCount022019":"93","XPloreCitationCount022019":"27","PubsCited":"7","Award":""}},{"name":"Claudio Rocchini","value":48,"numPapers":5,"cluster":"6","visible":1,"index":314,"weight":3,"x":74.09211779197861,"y":448.4964393301998,"px":82.99460118167306,"py":446.1265820354513,"node":{"Conference":"Vis","Year":"1993","Title":"Geometric optimization","DOI":"10.1109/VISUAL.1993.398868","Link":"http://dx.doi.org/10.1109/VISUAL.1993.398868","FirstPage":"189","LastPage":"195","PaperType":"C","Abstract":"An algorithm is presented which describes an application independent method for reducing the number of polygonal primitives required to faithfully represent an object. Reducing polygon count without a corresponding reduction in object detail is important for: achieving interactive frame rates in scientific visualization, reducing mass storage requirements, and facilitating the transmission of large, multi-timestep geometric data sets. This paper shows how coplanar and nearly coplanar polygons can be merged into larger complex polygons and re-triangulated into fewer simple polygons than originally required. The notable contributions of this paper are: (1) a method for quickly grouping polygons into nearly coplanar sets, (2) a fast approach for merging coplanar polygon sets and, (3) a simple, robust triangulation method for polygons created by 1 and 2. The central idea of the algorithm is the notion of treating polygonal data as a collection of segments and removing redundant segments to quickly form polygon hulls which represent the merged coplanar sets.<<ETX>>","AuthorNamesDeduped":"Paul A. Hinker;Charles D. Hansen","AuthorNames":"P. Hinker;C. Hansen","AuthorAffiliation":"Los Alamos Nat. Lab., NM, USA;Los Alamos Nat. Lab., NM, USA","InternalReferences":"10.1109/VISUAL.1992.235223","AuthorKeywords":"","AminerCitationCount022019":"211","XPloreCitationCount022019":"39","PubsCited":"8","Award":""}},{"name":"Roberto Scopigno","value":99,"numPapers":25,"cluster":"6","visible":1,"index":315,"weight":3,"x":96.64362852602268,"y":480.2101682208212,"px":104.08807781446303,"py":478.211327631716,"node":{"Conference":"Vis","Year":"1992","Title":"Massively parallel isosurface extraction","DOI":"10.1109/VISUAL.1992.235223","Link":"http://dx.doi.org/10.1109/VISUAL.1992.235223","FirstPage":"77","LastPage":"83","PaperType":"C","Abstract":"Experiences during the investigation of parallel methods for faster isosurface generation on SIMD (single instruction stream, multiple data stream) machines are described. A sequential version of a well-known isosurfacing algorithm is algorithmically enhanced for a particular type of SIMD architecture. The SIMD implementation takes full advantage of the data parallel nature of the algorithm, and experiments have proven the implementation to be highly scalable. A parallel tool, which can generate 170 K polygons/s, gives scientists the means to explore large 3D scalar or vector fields interactively.<<ETX>>","AuthorNamesDeduped":"Charles D. Hansen;Paul A. Hinker","AuthorNames":"C.D. Hansen;P. Hinker","AuthorAffiliation":"Los Alamos Nat. Lab., NM, USA;Los Alamos Nat. Lab., NM, USA","InternalReferences":"10.1109/VISUAL.1991.175782","AuthorKeywords":"","AminerCitationCount022019":"93","XPloreCitationCount022019":"27","PubsCited":"7","Award":""}},{"name":"Jack Snoeyink","value":108,"numPapers":14,"cluster":"6","visible":1,"index":316,"weight":5,"x":119.70917451010294,"y":423.73802081690303,"px":127.4118913001818,"py":422.3319093366261,"node":{"Conference":"Vis","Year":"1997","Title":"Computing the separating surface for segmented data","DOI":"10.1109/VISUAL.1997.663887","Link":"http://dx.doi.org/10.1109/VISUAL.1997.663887","FirstPage":"229","LastPage":"233","PaperType":"C","Abstract":"An algorithm for computing a triangulated surface which separates a collection of data points that have been segmented into a number of different classes is presented. The problem generalizes the concept of an isosurface which separates data points that have been segmented into only two classes: those for which data function values are above the threshold and those which are below the threshold value. The algorithm is very simple, easy to implement and applies without limit to the number of classes.","AuthorNamesDeduped":"Gregory M. Nielson;Richard Franke","AuthorNames":"G.M. Nielson;R. Franke","AuthorAffiliation":"Dept. of Comput. Sci. & Eng., Arizona State Univ., Tempe, AZ, USA","InternalReferences":"10.1109/VISUAL.1991.175782","AuthorKeywords":"","AminerCitationCount022019":"59","XPloreCitationCount022019":"20","PubsCited":"5","Award":""}},{"name":"Michiel van de Panne","value":84,"numPapers":2,"cluster":"6","visible":1,"index":317,"weight":5,"x":120.99162399703367,"y":450.1176944364715,"px":129.0839228881619,"py":447.45005133551894,"node":{"Conference":"Vis","Year":"2001","Title":"Simplicial subdivisions and sampling artifacts","DOI":"10.1109/VISUAL.2001.964499","Link":"http://dx.doi.org/10.1109/VISUAL.2001.964499","FirstPage":"99","LastPage":"106","PaperType":"C","Abstract":"We review several schemes for dividing cubical cells into simplices (tetrahedra) in 3-D for interpolating from sampled data to R/sup 3/ or for computing isosurfaces by barycentric interpolation. We present test data that reveal the geometric artifacts that these subdivision schemes generate, and discuss how these artifacts relate to the filter kernels that correspond to the subdivision schemes.","AuthorNamesDeduped":"Hamish A. Carr;Torsten Möller;Jack Snoeyink","AuthorNames":"H. Carr;T. Moller;J. Snoeyink","AuthorAffiliation":"Dept. of Comput. Sci., British Columbia Univ., Vancouver, BC, Canada","InternalReferences":"10.1109/VISUAL.1997.663887;10.1109/VISUAL.1996.568103;10.1109/VISUAL.1991.175782;10.1109/VISUAL.1997.663869;10.1109/VISUAL.1997.663885;10.1109/VISUAL.1997.663886","AuthorKeywords":"","AminerCitationCount022019":"37","XPloreCitationCount022019":"10","PubsCited":"27","Award":""}},{"name":"Vijay Natarajan","value":232,"numPapers":37,"cluster":"6","visible":1,"index":318,"weight":13,"x":222.8587029651457,"y":428.80624184065164,"px":229.8232498545842,"py":429.4999419377936,"node":{"Conference":"Vis","Year":"1999","Title":"Collapsing Flow Topology Using Area Metrics","DOI":"10.1109/VISUAL.1999.809907","Link":"http://doi.ieeecomputersociety.org/10.1109/VISUAL.1999.809907","FirstPage":"349","LastPage":"354","PaperType":"C","Abstract":"Visualization of topological information of a vector field can provide useful information on the structure of the field. However, in turbulent flows standard critical point visualization will result in a cluttered image which is difficult to interpret. This paper presents a technique for collapsing topologies. The governing idea is to classify the importance of the critical points in the topology. By only displaying the more important critical points, a simplified depiction of the topology can be provided. Flow consistency is maintained when collapsing the topology, resulting in a visualization which is consistent with the original topology. We apply the collapsing topology technique to a turbulent flow field.","AuthorNamesDeduped":"Wim C. de Leeuw;Robert van Liere","AuthorNames":"W. De Leeuw;R. Van Liere","AuthorAffiliation":"Center for Math. & Comput. Sci., CWI, Amsterdam, Netherlands","InternalReferences":"10.1109/VISUAL.1991.175773","AuthorKeywords":"multi-level visualization techniques, flow visualization, flow topology","AminerCitationCount022019":"102","XPloreCitationCount022019":"25","PubsCited":"0","Award":""}},{"name":"Frans A. Gerritsen","value":66,"numPapers":10,"cluster":"3","visible":1,"index":319,"weight":1,"x":625.023377402285,"y":876.5506171279599,"px":623.0566896819344,"py":867.2719698757649,"node":{"Conference":"Vis","Year":"2000","Title":"Interactive visualization of protein dynamics","DOI":"10.1109/VISUAL.2000.885733","Link":"http://dx.doi.org/10.1109/VISUAL.2000.885733","FirstPage":"465","LastPage":"468","PaperType":"C","Abstract":"The study of time dependent characteristics of proteins is important for gaining insight into many biological processes. However, visualizing protein dynamics by animating atom trajectories does not provide satisfactory results. When the trajectory is sampled with large times steps, the impression of smooth motion will be destroyed due to the effects of temporal aliasing. Sampling with small time steps will result in the camouflage of interesting motions. In this case study, we discuss techniques for the interactive 3D visualization of the dynamics of the photoactive yellow protein. We use essential dynamics methods to filter out uninteresting atom motions from the larger concerted motions. In this way, clear and concise 3D animations of protein motions can be produced. In addition, we discuss various interactive techniques that allow exploration of the essential subspace of the protein. We discuss the merits of these techniques when applied to the analysis of the yellow protein.","AuthorNamesDeduped":"Henk Huitema;Robert van Liere","AuthorNames":"H. Huitema;R. Van Liere","AuthorAffiliation":"Center for Math. & Comput. Sci., Amsterdam, Netherlands","InternalReferences":"","AuthorKeywords":"molecular graphics, essential dynamics,animation, interactive exploration","AminerCitationCount022019":"25","XPloreCitationCount022019":"6","PubsCited":"7","Award":""}},{"name":"Alexander Wiebel","value":165,"numPapers":53,"cluster":"6","visible":1,"index":320,"weight":11,"x":317.717252478044,"y":460.91513206644544,"px":322.9555436025412,"py":460.48451921930393,"node":{"Conference":"Vis","Year":"2001","Title":"Lagrangian-Eulerian Advection for Unsteady Flow Visualization","DOI":"10.1109/VISUAL.2001.964493","Link":"http://doi.ieeecomputersociety.org/10.1109/VISUAL.2001.964492","FirstPage":"53","LastPage":"60","PaperType":"C","Abstract":"In this paper, we propose a new technique to visualize dense representations of time-dependent vector fields based on a Lagrangian-Eulerian Advection (LEA) scheme. The algorithm produces animations with high spatio-temporal correlation at interactive rates. With this technique, every still frame depicts the instantaneous structure of the flow, whereas an animated sequence of frames reveals the motion a dense collection of particles would take when released into the flow. The simplicity of both the resulting data structures and the implementation suggest that LEA could become a useful component of any scientific visualization toolkit concerned with the display of unsteady flows.","AuthorNamesDeduped":"Bruno Jobard;Gordon Erlebacher;M. Yousuff Hussaini","AuthorNames":"B. Jobard;G. Erlebacher;M. Yousuff Hussaini","AuthorAffiliation":"Sch. of Computational Sci. & Inf. Technol., Florida State Univ., Tallahassee, FL, USA;Sch. of Computational Sci. & Inf. Technol., Florida State Univ., Tallahassee, FL, USA;Sch. of Computational Sci. & Inf. Technol., Florida State Univ., Tallahassee, FL, USA","InternalReferences":"10.1109/VISUAL.2000.885689;10.1109/VISUAL.1994.346311;10.1109/VISUAL.1995.485146;10.1109/VISUAL.2000.885689","AuthorKeywords":"","AminerCitationCount022019":"93","XPloreCitationCount022019":"19","PubsCited":"13","Award":""}},{"name":"Eduard Deines","value":67,"numPapers":14,"cluster":"6","visible":1,"index":321,"weight":5,"x":86.33877006146504,"y":644.5041056898721,"px":94.31625291227554,"py":641.5957197039162,"node":{"Conference":"Vis","Year":"2001","Title":"Interactive volume rendering using multi-dimensional transfer functions and direct manipulation widgets","DOI":"10.1109/VISUAL.2001.964519","Link":"http://dx.doi.org/10.1109/VISUAL.2001.964519","FirstPage":"255","LastPage":"262","PaperType":"C","Abstract":"Most direct volume renderings produced today employ one-dimensional transfer functions, which assign color and opacity to the volume based solely on the single scalar quantity which comprises the dataset. Though they have not received widespread attention, multi-dimensional transfer functions are a very effective way to extract specific material boundaries and convey subtle surface properties. However, identifying good transfer functions is difficult enough in one dimension, let alone two or three dimensions. This paper demonstrates an important class of three-dimensional transfer functions for scalar data (based on data value, gradient magnitude, and a second directional derivative), and describes a set of direct manipulation widgets which make specifying such transfer functions intuitive and convenient. We also describe how to use modem graphics hardware to interactively render with multi-dimensional transfer functions. The transfer functions, widgets, and hardware combine to form a powerful system for interactive volume exploration.","AuthorNamesDeduped":"Joe Michael Kniss;Gordon L. Kindlmann;Charles D. Hansen","AuthorNames":"J. Kniss;G. Kindlmann;C. Hansen","AuthorAffiliation":"Sch. of Comput., Utah Univ., Salt Lake City, UT, USA;Sch. of Comput., Utah Univ., Salt Lake City, UT, USA;Sch. of Comput., Utah Univ., Salt Lake City, UT, USA","InternalReferences":"10.1109/VISUAL.1995.480803;10.1109/VISUAL.1999.809908;10.1109/VISUAL.1999.809889;10.1109/VISUAL.1996.568113;10.1109/VISUAL.1997.663875","AuthorKeywords":"volume visualization, direct volume rendering, multi-dimensional transfer functions, direct manipulation widgets, graphics hardware","AminerCitationCount022019":"514","XPloreCitationCount022019":"123","PubsCited":"34","Award":"BP"}},{"name":"Jan Sahner","value":65,"numPapers":11,"cluster":"6","visible":1,"index":322,"weight":4,"x":211.89372331331953,"y":649.6959194266271,"px":218.66126613317664,"py":644.5100991230196,"node":{"Conference":"Vis","Year":"2004","Title":"Stream line and path line oriented topology for 2D time-dependent vector fields","DOI":"10.1109/VISUAL.2004.99","Link":"http://dx.doi.org/10.1109/VISUAL.2004.99","FirstPage":"321","LastPage":"328","PaperType":"C","Abstract":"Topological methods aim at the segmentation of a vector field into areas of different flow behavior. For 2D time-dependent vector fields, two such segmentations are possible: either concerning the behavior of stream lines, or of path lines. While stream line oriented topology is well established, we introduce path line oriented topology as a new visualization approach in this paper. As a contribution to stream line oriented topology we introduce new methods to detect global bifurcations like saddle connections and cyclic fold bifurcations. To get the path line oriented topology we segment the vector field into areas of attracting, repelling and saddle-like behavior of the path lines. We compare both kinds of topologies and apply them to a number of data sets.","AuthorNamesDeduped":"Holger Theisel;Tino Weinkauf;Hans-Christian Hege;Hans-Peter Seidel","AuthorNames":"H. Theisel;T. Weinkauf;H.-C. Hege;H.-P. Seidel","AuthorAffiliation":"Max-Planck-Inst. fur Inf., Saarbrucken, Germany","InternalReferences":"10.1109/VISUAL.1999.809907;10.1109/VISUAL.2000.885714;10.1109/VISUAL.1993.398849;10.1109/VISUAL.1991.175773;10.1109/VISUAL.1996.567777;10.1109/VISUAL.2000.885716;10.1109/VISUAL.2001.964507;10.1109/VISUAL.2003.1250376","AuthorKeywords":"flow visualization, vector field topology, bifurcations, stream lines, path lines","AminerCitationCount022019":"0","XPloreCitationCount022019":"16","PubsCited":"28","Award":""}},{"name":"Stefan Bruckner","value":599,"numPapers":187,"cluster":"3","visible":1,"index":323,"weight":56,"x":480.66432333556884,"y":451.6008571074784,"px":482.8505112858712,"py":449.88226094845396,"node":{"Conference":"Vis","Year":"2000","Title":"Volume illustration: non-photorealistic rendering of volume models","DOI":"10.1109/VISUAL.2000.885694","Link":"http://dx.doi.org/10.1109/VISUAL.2000.885694","FirstPage":"195","LastPage":"202","PaperType":"C","Abstract":"Accurately and automatically conveying the structure of a volume model is a problem that has not been fully solved by existing volume rendering approaches. Physics-based volume rendering approaches create images which may match the appearance of translucent materials in nature but may not embody important structural details. Transfer function approaches allow flexible design of the volume appearance but generally require substantial hand-tuning for each new data set in order to be effective. We introduce the volume illustration approach, combining the familiarity of a physics-based illumination model with the ability to enhance important features using non-photorealistic rendering techniques. Since the features to be enhanced are defined on the basis of local volume characteristics rather than volume sample values, the application of volume illustration techniques requires less manual tuning than the design of a good transfer function. Volume illustration provides a flexible unified framework for enhancing structural perception of volume models through the amplification of features and the addition of illumination effects.","AuthorNamesDeduped":"David S. Ebert;Penny Rheingans","AuthorNames":"D. Ebert;P. Rheingans","AuthorAffiliation":"Dept. of Comput. Sci. & Electr. Eng., Maryland Univ., Baltimore, MD, USA","InternalReferences":"10.1109/VISUAL.1996.568111;10.1109/VISUAL.1998.745294;10.1109/VISUAL.1995.480795;10.1109/VISUAL.2000.885696;10.1109/VISUAL.1998.745319;10.1109/VISUAL.1999.809905;10.1109/VISUAL.1999.809932;10.1109/VISUAL.1990.146391","AuthorKeywords":"Volume rendering, non-photorealistic rendering,illustration, lighting models, shading, visualization","AminerCitationCount022019":"160","XPloreCitationCount022019":"61","PubsCited":"30","Award":""}},{"name":"Alark Joshi","value":61,"numPapers":19,"cluster":"2","visible":1,"index":324,"weight":2,"x":537.200900929774,"y":664.6445391301761,"px":536.3542390037279,"py":658.3811809335343,"node":{"Conference":"Vis","Year":"2001","Title":"Texture Hardware Assisted Rendering of Time-Varying Volume Data","DOI":"10.1109/VISUAL.2001.964520","Link":"http://doi.ieeecomputersociety.org/10.1109/VISUAL.2001.964520","FirstPage":"263","LastPage":"270","PaperType":"C","Abstract":"In this paper we present a hardware-assisted rendering technique coupled with a compression scheme for the interactive visual exploration of time-varying scalar volume data. A palette-based decoding technique and an adaptive bit allocation scheme are developed to fully utilize the texturing capability of a commodity 3-D graphics card. Using a single PC equipped with a modest amount of memory, a texture capable graphics card, and an inexpensive disk array, we are able to render hundreds of time steps of regularly gridded volume data (up to 45 millions voxels each time step) at interactive rates, permitting the visual exploration of large scientific data sets in both the temporal and spatial domain.","AuthorNamesDeduped":"Eric B. Lum;Kwan-Liu Ma;John P. Clyne","AuthorNames":"E.B. Lum;Kwan-Liu Ma;J. Clyne","AuthorAffiliation":"Dept. of Comput. Sci., California Univ., Davis, CA, USA;Dept. of Comput. Sci., California Univ., Davis, CA, USA","InternalReferences":"10.1109/VISUAL.1999.809910;10.1109/VISUAL.1994.346321;10.1109/VISUAL.1995.480809;10.1109/VISUAL.1994.346341;10.1109/VISUAL.1999.809879","AuthorKeywords":"Compression, high performance computing, out-of-core processing, PC, scientific visualization, texture hardware, time-varying data, transform encoding, volume rendering","AminerCitationCount022019":"115","XPloreCitationCount022019":"24","PubsCited":"23","Award":""}},{"name":"Yun Jang","value":188,"numPapers":65,"cluster":"2","visible":1,"index":325,"weight":9,"x":588.6388846081322,"y":429.3721841276207,"px":589.300573941575,"py":426.6391336664391,"node":{"Conference":"Vis","Year":"2005","Title":"Illustration and photography inspired visualization of flows and volumes","DOI":"10.1109/VISUAL.2005.1532858","Link":"http://dx.doi.org/10.1109/VISUAL.2005.1532858","FirstPage":"687","LastPage":"694","PaperType":"C","Abstract":"Understanding and analyzing complex volumetrically varying data is a difficult problem. Many computational visualization techniques have had only limited success in succinctly portraying the structure of three-dimensional turbulent flow. Motivated by both the extensive history and success of illustration and photographic flow visualization techniques, we have developed a new interactive volume rendering and visualization system for flows and volumes that simulates and enhances traditional illustration, experimental advection, and photographic flow visualization techniques. Our system uses a combination of varying focal and contextual illustrative styles, new advanced two-dimensional transfer functions, enhanced Schlieren and shadowgraphy shaders, and novel oriented structure enhancement techniques to allow interactive visualization, exploration, and comparative analysis of scalar, vector, and time-varying volume datasets. Both traditional illustration techniques and photographic flow visualization techniques effectively reduce visual clutter by using compact oriented structure information to convey three-dimensional structures. Therefore, a key to the effectiveness of our system is using one-dimensional (Schlieren and shadowgraphy) and two-dimensional (silhouette) oriented structural information to reduce visual clutter, while still providing enough three-dimensional structural information for the user's visual system to understand complex three-dimensional flow data. By combining these oriented feature visualization techniques with flexible transfer function controls, we can visualize scalar and vector data, allow comparative visualization of flow properties in a succinct, informative manner, and provide continuity for visualizing time-varying datasets.","AuthorNamesDeduped":"Nikolai A. Svakhine;Yun Jang;David S. Ebert;Kelly P. Gaither","AuthorNames":"N.A. Svakhine;Y. Jang;D. Ebert;K. Gaither","AuthorAffiliation":"Purdue Univ., West Lafayette, IN, USA;Purdue Univ., West Lafayette, IN, USA;Purdue Univ., West Lafayette, IN, USA","InternalReferences":"10.1109/VISUAL.1995.485141;10.1109/VISUAL.1993.398846;10.1109/VISUAL.2003.1250378;10.1109/VISUAL.1996.567777;10.1109/VISUAL.1997.663912;10.1109/VISUAL.2003.1250361;10.1109/VISUAL.1999.809905;10.1109/VISUAL.2000.885694;10.1109/VISUAL.2000.885689;10.1109/VISUAL.2005.1532857;10.1109/VISUAL.2000.885696;10.1109/VISUAL.1993.398877","AuthorKeywords":"interactive volume illustration, flow visualization, non-photorealistic rendering, photographic techniques","AminerCitationCount022019":"65","XPloreCitationCount022019":"15","PubsCited":"35","Award":""}},{"name":"Adam Perer","value":317,"numPapers":62,"cluster":"0","visible":1,"index":326,"weight":11,"x":685.8916335477481,"y":235.62241711147482,"px":682.7133533833551,"py":239.6644452108806,"node":{"Conference":"InfoVis","Year":"2003","Title":"Multiscale Visualization of Small World Networks","DOI":"10.1109/INFVIS.2003.1249011","Link":"http://doi.ieeecomputersociety.org/10.1109/INFVIS.2003.1249011","FirstPage":"75","LastPage":"84","PaperType":"C","Abstract":"Many networks under study in information visualization are \"small world\" networks. These networks first appeared in the study of social networks and were shown to be relevant models in other application domains such as software reverse engineering and biology. Furthermore, many of these networks actually have a multiscale nature: they can be viewed as a network of groups that are themselves small world networks. We describe a metric that has been designed in order to identify the weakest edges in a small world network leading to an easy and low cost filtering procedure that breaks up a graph into smaller and highly connected components. We show how this metric can be exploited through an interactive navigation of the network based on semantic zooming. Once the network is decomposed into a hierarchy of sub-networks, a user can easily find groups and subgroups of actors and understand their dynamics.","AuthorNamesDeduped":"David Auber;Yves Chiricota;Fabien Jourdan;Guy Melançon","AuthorNames":"D. Auber;Y. Chiricota;F. Jourdan;G. Melancon","AuthorAffiliation":"LaBRI, Bordeaux, France","InternalReferences":"","AuthorKeywords":"Small world networks, multiscale graphs,clustering metric, semantic zooming","AminerCitationCount022019":"266","XPloreCitationCount022019":"52","PubsCited":"18","Award":""}},{"name":"Geoffrey P. Ellis","value":276,"numPapers":45,"cluster":"2","visible":1,"index":327,"weight":10,"x":504.41735871705794,"y":245.49055119338146,"px":508.2828762328484,"py":249.14549645269952,"node":{"Conference":"Vis","Year":"2004","Title":"Anisotropic volume rendering for extremely dense, thin line data","DOI":"10.1109/VISUAL.2004.5","Link":"http://dx.doi.org/10.1109/VISUAL.2004.5","FirstPage":"107","LastPage":"114","PaperType":"C","Abstract":"Many large scale physics-based simulations which take place on PC clusters or supercomputers produce huge amounts of data including vector fields. While these vector data such as electromagnetic fields, fluid flow fields, or particle paths can be represented by lines, the sheer number of the lines overwhelms the memory and computation capability of a high-end PC used for visualization. Further, very dense or intertwined lines, rendered with traditional visualization techniques, can produce unintelligible results with unclear depth relationships between the lines and no sense of global structure. Our approach is to apply a lighting model to the lines and sample them into an anisotropic voxel representation based on spherical harmonics as a preprocessing step. Then we evaluate and render these voxels for a given view using traditional volume rendering. For extremely large line based datasets, conversion to anisotropic voxels reduces the overall storage and rendering for O(n) lines to O(1) with a large constant that is still small enough to allow meaningful visualization of the entire dataset at nearly interactive rates on a single commodity PC.","AuthorNamesDeduped":"David Ellsworth;Bryan Green;Patrick J. Moran","AuthorNames":"G. Schussman;K.-L. Ma","AuthorAffiliation":"Stanford Linear Accelerator Center, Menlo Park, CA, USA","InternalReferences":"","AuthorKeywords":"anisotropic lighting, line data, scientific visualization, vector field, volume rendering","AminerCitationCount022019":"28","XPloreCitationCount022019":"13","PubsCited":"17","Award":""}},{"name":"Alan J. Dix","value":166,"numPapers":20,"cluster":"5","visible":1,"index":328,"weight":4,"x":610.4530072909066,"y":441.4405024542704,"px":610.4049129588072,"py":438.7730087448671,"node":{"Conference":"Vis","Year":"2004","Title":"Anisotropic volume rendering for extremely dense, thin line data","DOI":"10.1109/VISUAL.2004.5","Link":"http://dx.doi.org/10.1109/VISUAL.2004.5","FirstPage":"107","LastPage":"114","PaperType":"C","Abstract":"Many large scale physics-based simulations which take place on PC clusters or supercomputers produce huge amounts of data including vector fields. While these vector data such as electromagnetic fields, fluid flow fields, or particle paths can be represented by lines, the sheer number of the lines overwhelms the memory and computation capability of a high-end PC used for visualization. Further, very dense or intertwined lines, rendered with traditional visualization techniques, can produce unintelligible results with unclear depth relationships between the lines and no sense of global structure. Our approach is to apply a lighting model to the lines and sample them into an anisotropic voxel representation based on spherical harmonics as a preprocessing step. Then we evaluate and render these voxels for a given view using traditional volume rendering. For extremely large line based datasets, conversion to anisotropic voxels reduces the overall storage and rendering for O(n) lines to O(1) with a large constant that is still small enough to allow meaningful visualization of the entire dataset at nearly interactive rates on a single commodity PC.","AuthorNamesDeduped":"David Ellsworth;Bryan Green;Patrick J. Moran","AuthorNames":"G. Schussman;K.-L. Ma","AuthorAffiliation":"Stanford Linear Accelerator Center, Menlo Park, CA, USA","InternalReferences":"","AuthorKeywords":"anisotropic lighting, line data, scientific visualization, vector field, volume rendering","AminerCitationCount022019":"28","XPloreCitationCount022019":"13","PubsCited":"17","Award":""}},{"name":"Tim Dwyer","value":346,"numPapers":86,"cluster":"15","visible":1,"index":329,"weight":39,"x":696.0588012992705,"y":286.0807252094511,"px":692.1506618793416,"py":288.9011571411336,"node":{"Conference":"InfoVis","Year":"2005","Title":"Dig-CoLa: directed graph layout through constrained energy minimization","DOI":"10.1109/INFVIS.2005.1532130","Link":"http://dx.doi.org/10.1109/INFVIS.2005.1532130","FirstPage":"65","LastPage":"72","PaperType":"C","Abstract":"We describe a new method for visualization of directed graphs. The method combines constraint programming techniques with a high performance force directed placement (FDP) algorithm so that the directed nature of the graph is highlighted while useful properties of FDP - such as emphasis of symmetries and preservation of proximity relations - are retained. Our algorithm automatically identifies those parts of the digraph that contain hierarchical information and draws them accordingly. Additionally, those parts that do not contain hierarchy are drawn at the same quality expected from a nonhierarchical, undirected layout algorithm. An interesting application of our algorithm is directional multidimensional scaling (DMDS). DMDS deals with low dimensional embedding of multivariate data where we want to emphasize the overall flow in the data (e.g. chronological progress) along one of the axes.","AuthorNamesDeduped":"Tim Dwyer;Yehuda Koren","AuthorNames":"T. Dwyer;Y. Koren","AuthorAffiliation":"Sch. of Comput. Sci. & Software Eng., Monash Univ., Australia","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"51","XPloreCitationCount022019":"8","PubsCited":"25","Award":"BP"}},{"name":"Yehuda Koren","value":277,"numPapers":6,"cluster":"15","visible":1,"index":330,"weight":10,"x":799.6184279856528,"y":206.0439388677625,"px":797.1141062581262,"py":210.79023848124191,"node":{"Conference":"InfoVis","Year":"2002","Title":"ACE: a fast multiscale eigenvectors computation for drawing huge graphs","DOI":"10.1109/INFVIS.2002.1173159","Link":"http://dx.doi.org/10.1109/INFVIS.2002.1173159","FirstPage":"137","LastPage":"144","PaperType":"C","Abstract":"We present an extremely fast graph drawing algorithm for very large graphs, which we term ACE (for Algebraic multigrid Computation of Eigenvectors). ACE exhibits an improvement of something like two orders of magnitude over the fastest algorithms we are aware of; it draws graphs of millions of nodes in less than a minute. ACE finds an optimal drawing by minimizing a quadratic energy function. The minimization problem is expressed as a generalized eigenvalue problem, which is rapidly solved using a novel algebraic multigrid technique. The same generalized eigenvalue problem seems to come up also in other fields, hence ACE appears to be applicable outside of graph drawing too.","AuthorNamesDeduped":"Yehuda Koren;Liran Carmel;David Harel","AuthorNames":"Yehuda Koren;L. Carmel;D. Harel","AuthorAffiliation":"Dept. of Comput. Sci. & Appl. Math., Weizmann Inst. of Sci., Rehovot, Israel;Dept. of Comput. Sci. & Appl. Math., Weizmann Inst. of Sci., Rehovot, Israel;Dept. of Comput. Sci. & Appl. Math., Weizmann Inst. of Sci., Rehovot, Israel","InternalReferences":"","AuthorKeywords":"algebraic multigrid, multiscale/multilevel optimization, graph drawing, generalized eigenvalue problem, Fiedler vector, force directed layout, the Hall energy","AminerCitationCount022019":"158","XPloreCitationCount022019":"26","PubsCited":"22","Award":""}},{"name":"Kim Marriott","value":262,"numPapers":68,"cluster":"15","visible":1,"index":331,"weight":22,"x":715.139737425626,"y":268.1081124344984,"px":711.5137845610213,"py":270.35997444279025,"node":{"Conference":"InfoVis","Year":"2005","Title":"Dig-CoLa: directed graph layout through constrained energy minimization","DOI":"10.1109/INFVIS.2005.1532130","Link":"http://dx.doi.org/10.1109/INFVIS.2005.1532130","FirstPage":"65","LastPage":"72","PaperType":"C","Abstract":"We describe a new method for visualization of directed graphs. The method combines constraint programming techniques with a high performance force directed placement (FDP) algorithm so that the directed nature of the graph is highlighted while useful properties of FDP - such as emphasis of symmetries and preservation of proximity relations - are retained. Our algorithm automatically identifies those parts of the digraph that contain hierarchical information and draws them accordingly. Additionally, those parts that do not contain hierarchy are drawn at the same quality expected from a nonhierarchical, undirected layout algorithm. An interesting application of our algorithm is directional multidimensional scaling (DMDS). DMDS deals with low dimensional embedding of multivariate data where we want to emphasize the overall flow in the data (e.g. chronological progress) along one of the axes.","AuthorNamesDeduped":"Tim Dwyer;Yehuda Koren","AuthorNames":"T. Dwyer;Y. Koren","AuthorAffiliation":"Sch. of Comput. Sci. & Software Eng., Monash Univ., Australia","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"51","XPloreCitationCount022019":"8","PubsCited":"25","Award":"BP"}},{"name":"Nathalie Henry Riche","value":646,"numPapers":130,"cluster":"0","visible":1,"index":332,"weight":52,"x":604.7477930842279,"y":285.5382171332126,"px":603.8315340361012,"py":287.20154961951084,"node":{"Conference":"InfoVis","Year":"2004","Title":"The InfoVis Toolkit","DOI":"10.1109/INFVIS.2004.64","Link":"http://dx.doi.org/10.1109/INFVIS.2004.64","FirstPage":"167","LastPage":"174","PaperType":"C","Abstract":"This article presents the InfoVis toolkit, designed to support the creation, extension and integration of advanced 2D information visualization components into interactive Java swing applications. The InfoVis toolkit provides specific data structures to achieve a fast action/feedback loop required by dynamic queries. It comes with a large set of components such as range sliders and tailored control panels required to control and configure the visualizations. These components are integrated into a coherent framework that simplifies the management of rich data structures and the design and extension of visualizations. Supported data structures currently include tables, trees and graphs. Supported visualizations include scatter plots, time series, parallel coordinates, treemaps, icicle trees, node-link diagrams for trees and graphs and adjacency matrices for graphs. All visualizations can use fisheye lenses and dynamic labeling. The InfoVis toolkit supports hardware acceleration when available through Agile2D, an implementation of the Java graphics API based on OpenGL, achieving speedups of 10 to 200 times. The article also shows how new visualizations can be added and extended to become components, enriching visualizations as well as general applications","AuthorNamesDeduped":"Jean-Daniel Fekete","AuthorNames":"J.-D. Fekete","AuthorAffiliation":"INRIA Futurs/LRI","InternalReferences":"10.1109/INFVIS.2003.1249008;10.1109/INFVIS.2000.885086;10.1109/INFVIS.2002.1173156;10.1109/INFVIS.1995.528688;10.1109/INFVIS.2002.1173148","AuthorKeywords":"Information Visualization, Toolkit, Graphics, Integration","AminerCitationCount022019":"353","XPloreCitationCount022019":"91","PubsCited":"27","Award":""}},{"name":"Maneesh Agrawala","value":465,"numPapers":36,"cluster":"0","visible":1,"index":333,"weight":17,"x":586.232923587688,"y":211.22647112421035,"px":587.1933047216286,"py":216.19361996705513,"node":{"Conference":"Vis","Year":"2003","Title":"Conveying shape and features with image-based relighting","DOI":"10.1109/VISUAL.2003.1250392","Link":"http://dx.doi.org/10.1109/VISUAL.2003.1250392","FirstPage":"349","LastPage":"354","PaperType":"C","Abstract":"Hand-crafted illustrations are often more effective than photographs for conveying the shape and important features of an object, but they require expertise and time to produce. We describe an image compositing system and user interface that allow an artist to quickly and easily create technical illustrations from a set of photographs of an object taken from the same point of view under variable lighting conditions. Our system uses a novel compositing process in which images are combined using spatially-varying light mattes, enabling the final lighting in each area of the composite to be manipulated independently. We describe an interface that provides for the painting of local lighting effects (e.g. shadows, highlights, and tangential lighting to reveal texture) directly onto the composite. We survey some of the techniques used in illustration and lighting design to convey the shape and features of objects and describe how our system can be used to apply these techniques.","AuthorNamesDeduped":"David Akers;Frank Losasso;Jeff Klingner;Maneesh Agrawala;John Rick;Pat Hanrahan","AuthorNames":"D. Akers;F. Losasso;J. Klingner;M. Agrawala;J. Rick;P. Hanrahan","AuthorAffiliation":"Stanford Univ., USA;Stanford Univ., USA;Stanford Univ., USA","InternalReferences":"","AuthorKeywords":"Visualization, Relighting, Image Composition, Scientfic Illustration, Technical Illustration, Photography, Lighting Design","AminerCitationCount022019":"86","XPloreCitationCount022019":"18","PubsCited":"33","Award":""}},{"name":"Mike Sips","value":63,"numPapers":24,"cluster":"2","visible":1,"index":334,"weight":1,"x":651.4265229438015,"y":-70.27254136396435,"px":648.9186692682852,"py":-62.30805510451796,"node":{"Conference":"Vis","Year":"1998","Title":"Continuous cartogram construction","DOI":"10.1109/VISUAL.1998.745303","Link":"http://dx.doi.org/10.1109/VISUAL.1998.745303","FirstPage":"197","LastPage":"204","PaperType":"C","Abstract":"Area cartograms are used for visualizing geographically distributed data by attaching measurements to regions of a map and scaling the regions such that their areas are proportional to the measured quantities. A continuous area cartogram is a cartogram that is constructed without changing the underlying map topology. We present a new algorithm for the construction of continuous area cartograms that was developed by viewing their construction as a constrained optimization problem. The algorithm uses a relaxation method that exploits hierarchical resolution, constrained dynamics, and a scheme that alternates goals of achieving correct region areas and adjusting region shapes. It is compared favorably to existing methods in its ability to preserve region shape recognition cues, while still achieving high accuracy.","AuthorNamesDeduped":"Donald H. House;Christopher J. Kocmoud","AuthorNames":"D.H. House;C.J. Kocmoud","AuthorAffiliation":"Visualization Lab., Texas A&M Univ., College Station, TX, USA","InternalReferences":"","AuthorKeywords":"cartogram, value-by-area map, map transformation,anamorphosis, thematic cartography, constrained optimization","AminerCitationCount022019":"76","XPloreCitationCount022019":"11","PubsCited":"0","Award":""}},{"name":"Leland Wilkinson","value":168,"numPapers":34,"cluster":"2","visible":1,"index":335,"weight":7,"x":424.51850043886844,"y":168.7876785535526,"px":429.4050398750921,"py":173.9120102603836,"node":{"Conference":"InfoVis","Year":"2003","Title":"Exploring high-D spaces with multiform matrices and small multiples","DOI":"10.1109/INFVIS.2003.1249006","Link":"http://dx.doi.org/10.1109/INFVIS.2003.1249006","FirstPage":"31","LastPage":"38","PaperType":"C","Abstract":"We introduce an approach to visual analysis of multivariate data that integrates several methods from information visualization, exploratory data analysis (EDA), and geovisualization. The approach leverages the component-based architecture implemented in GeoVISTA Studio to construct a flexible, multiview, tightly (but generically) coordinated, EDA toolkit. This toolkit builds upon traditional ideas behind both small multiples and scatterplot matrices in three fundamental ways. First, we develop a general, multiform, bivariate matrix and a complementary multiform, bivariate small multiple plot in which different bivariate representation forms can be used in combination. We demonstrate the flexibility of this approach with matrices and small multiples that depict multivariate data through combinations of: scatterplots, bivariate maps, and space-filling displays. Second, we apply a measure of conditional entropy to (a) identify variables from a high-dimensional data set that are likely to display interesting relationships and (b) generate a default order of these variables in the matrix or small multiple display. Third, we add conditioning, a kind of dynamic query/filtering in which supplementary (undisplayed) variables are used to constrain the view onto variables that are displayed. Conditioning allows the effects of one or more well understood variables to be removed form the analysis, making relationships among remaining variables easier to explore. We illustrate the individual and combined functionality enabled by this approach through application to analysis of cancer diagnosis and mortality data and their associated covariates and risk factors.","AuthorNamesDeduped":"Alan M. MacEachren;Xiping Dai;Frank Hardisty;Diansheng Guo;Eugene Lengerich","AuthorNames":"A. MacEachren;D. Xiping;F. Hardisty;Diansheng Guo;G. Lengerich","AuthorAffiliation":"Dept. of Geogr., Pennsylvania State Univ., University Park, VA, USA;Dept. of Geogr., Pennsylvania State Univ., University Park, VA, USA;Dept. of Geogr., Pennsylvania State Univ., University Park, VA, USA;Dept. of Geogr., Pennsylvania State Univ., University Park, VA, USA","InternalReferences":"10.1109/VISUAL.1991.175815;10.1109/INFVIS.1998.729559","AuthorKeywords":"geovisualization, EDA, scatterplot matrix,bivariate map, space-filling visualization, conditional entropy, small multiples, conditioning, GeoVISTA Studio ","AminerCitationCount022019":"107","XPloreCitationCount022019":"22","PubsCited":"49","Award":""}},{"name":"Anushka Anand","value":271,"numPapers":38,"cluster":"2","visible":1,"index":336,"weight":14,"x":431.037738922356,"y":225.99884632941348,"px":435.6877863750504,"py":230.31649910995327,"node":{"Conference":"InfoVis","Year":"2003","Title":"Exploring high-D spaces with multiform matrices and small multiples","DOI":"10.1109/INFVIS.2003.1249006","Link":"http://dx.doi.org/10.1109/INFVIS.2003.1249006","FirstPage":"31","LastPage":"38","PaperType":"C","Abstract":"We introduce an approach to visual analysis of multivariate data that integrates several methods from information visualization, exploratory data analysis (EDA), and geovisualization. The approach leverages the component-based architecture implemented in GeoVISTA Studio to construct a flexible, multiview, tightly (but generically) coordinated, EDA toolkit. This toolkit builds upon traditional ideas behind both small multiples and scatterplot matrices in three fundamental ways. First, we develop a general, multiform, bivariate matrix and a complementary multiform, bivariate small multiple plot in which different bivariate representation forms can be used in combination. We demonstrate the flexibility of this approach with matrices and small multiples that depict multivariate data through combinations of: scatterplots, bivariate maps, and space-filling displays. Second, we apply a measure of conditional entropy to (a) identify variables from a high-dimensional data set that are likely to display interesting relationships and (b) generate a default order of these variables in the matrix or small multiple display. Third, we add conditioning, a kind of dynamic query/filtering in which supplementary (undisplayed) variables are used to constrain the view onto variables that are displayed. Conditioning allows the effects of one or more well understood variables to be removed form the analysis, making relationships among remaining variables easier to explore. We illustrate the individual and combined functionality enabled by this approach through application to analysis of cancer diagnosis and mortality data and their associated covariates and risk factors.","AuthorNamesDeduped":"Alan M. MacEachren;Xiping Dai;Frank Hardisty;Diansheng Guo;Eugene Lengerich","AuthorNames":"A. MacEachren;D. Xiping;F. Hardisty;Diansheng Guo;G. Lengerich","AuthorAffiliation":"Dept. of Geogr., Pennsylvania State Univ., University Park, VA, USA;Dept. of Geogr., Pennsylvania State Univ., University Park, VA, USA;Dept. of Geogr., Pennsylvania State Univ., University Park, VA, USA;Dept. of Geogr., Pennsylvania State Univ., University Park, VA, USA","InternalReferences":"10.1109/VISUAL.1991.175815;10.1109/INFVIS.1998.729559","AuthorKeywords":"geovisualization, EDA, scatterplot matrix,bivariate map, space-filling visualization, conditional entropy, small multiples, conditioning, GeoVISTA Studio ","AminerCitationCount022019":"107","XPloreCitationCount022019":"22","PubsCited":"49","Award":""}},{"name":"Jianping Fan 0001","value":32,"numPapers":13,"cluster":"2","visible":1,"index":337,"weight":2,"x":815.4287189140804,"y":68.89326204522747,"px":812.5327343702908,"py":77.23064430886873,"node":{"Conference":"InfoVis","Year":"1999","Title":"Evaluating a visualisation of image similarity as a tool for image browsing","DOI":"10.1109/INFVIS.1999.801855","Link":"http://dx.doi.org/10.1109/INFVIS.1999.801855","FirstPage":"36","LastPage":"43, 143","PaperType":"C","Abstract":"A similarity metric based on the low-level content of images can be used to create a visualisation in which visually similar images are displayed close to each other. We are carrying out a series of experiments to evaluate the usefulness of this type of visualisation as an image browsing aid. The initial experiment, described, considered whether people would find a given photograph more quickly in a visualisation than in a randomly arranged grid of images. The results show that the subjects were faster with the visualisation, although in post-experiment interviews many of them said that they preferred the clarity and regularity of the grid. We describe an algorithm with which the best aspects of the two layout types can be combined.","AuthorNamesDeduped":"Kerry Rodden;Wojciech Basalaj;David Sinclair;Kenneth R. Wood","AuthorNames":"K. Rodden;W. Basalaj;D. Sinclair;K. Wood","AuthorAffiliation":"Comput. Lab., Cambridge Univ., UK","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"","XPloreCitationCount022019":"28","PubsCited":"17","Award":""}},{"name":"Hangzai Luo","value":32,"numPapers":13,"cluster":"2","visible":1,"index":338,"weight":2,"x":815.4023880818049,"y":117.0403992746484,"px":810.9655312790717,"py":125.50575076781396,"node":{"Conference":"InfoVis","Year":"1999","Title":"Evaluating a visualisation of image similarity as a tool for image browsing","DOI":"10.1109/INFVIS.1999.801855","Link":"http://dx.doi.org/10.1109/INFVIS.1999.801855","FirstPage":"36","LastPage":"43, 143","PaperType":"C","Abstract":"A similarity metric based on the low-level content of images can be used to create a visualisation in which visually similar images are displayed close to each other. We are carrying out a series of experiments to evaluate the usefulness of this type of visualisation as an image browsing aid. The initial experiment, described, considered whether people would find a given photograph more quickly in a visualisation than in a randomly arranged grid of images. The results show that the subjects were faster with the visualisation, although in post-experiment interviews many of them said that they preferred the clarity and regularity of the grid. We describe an algorithm with which the best aspects of the two layout types can be combined.","AuthorNamesDeduped":"Kerry Rodden;Wojciech Basalaj;David Sinclair;Kenneth R. Wood","AuthorNames":"K. Rodden;W. Basalaj;D. Sinclair;K. Wood","AuthorAffiliation":"Comput. Lab., Cambridge Univ., UK","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"","XPloreCitationCount022019":"28","PubsCited":"17","Award":""}},{"name":"William Ribarsky","value":572,"numPapers":117,"cluster":"2","visible":1,"index":339,"weight":55,"x":624.1266980949412,"y":274.4147476289752,"px":622.6479612328496,"py":277.0073776505513,"node":{"Conference":"Vis","Year":"1995","Title":"Virtual GIS: a real-time 3D geographic information system","DOI":"10.1109/VISUAL.1995.480800","Link":"http://dx.doi.org/10.1109/VISUAL.1995.480800","FirstPage":"94","LastPage":"100, 443","PaperType":"C","Abstract":"Advances in computer graphics hardware and algorithms, visualization, and interactive techniques for analysis offer the components for a highly integrated, efficient real-time 3D Geographic Information System. We have developed \"Virtual GIS\", a system with truly immersive capability for navigating and understanding complex and dynamic terrain-based databases. The system provides the means for visualizing terrain models consisting of elevation and imagery data, along with GIS raster layers, protruding features, buildings, vehicles, and other objects. We have implemented window-based and virtual reality versions and in both cases provide a direct manipulation, visual interface for accessing the GIS data. Unique terrain data structures and algorithms allow rendering of large, high resolution datasets at interactive rates.","AuthorNamesDeduped":"David Koller;Peter Lindstrom;William Ribarsky;Larry F. Hodges;Nickolas Faust;Gregory A. Turner","AuthorNames":"D. Koller;P. Lindstrom;W. Ribarsky;L.F. Hodges;N. Faust;G. Turner","AuthorAffiliation":"Coll. of Comput., Georgia Inst. of Technol., Atlanta, GA, USA;Coll. of Comput., Georgia Inst. of Technol., Atlanta, GA, USA;Coll. of Comput., Georgia Inst. of Technol., Atlanta, GA, USA;Coll. of Comput., Georgia Inst. of Technol., Atlanta, GA, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"269","XPloreCitationCount022019":"31","PubsCited":"19","Award":""}},{"name":"Bongshin Lee","value":515,"numPapers":91,"cluster":"0","visible":1,"index":340,"weight":27,"x":579.8593915476034,"y":311.15166863327795,"px":579.383777935209,"py":312.5839143996208,"node":{"Conference":"VAST","Year":"2006","Title":"NetLens: Iterative Exploration of Content-Actor Network Data","DOI":"10.1109/VAST.2006.261426","Link":"http://dx.doi.org/10.1109/VAST.2006.261426","FirstPage":"91","LastPage":"98","PaperType":"C","Abstract":"Networks have remained a challenge for information retrieval and visualization because of the rich set of tasks that users want to accomplish. This paper offers an abstract content-actor network data model, a classification of tasks, and a tool to support them. The NetLens interface was designed around the abstract content-actor network data model to allow users to pose a series of elementary queries and iteratively refine visual overviews and sorted lists. This enables the support of complex queries that are traditionally hard to specify. NetLens is general and scalable in that it applies to any dataset that can be represented with our abstract data model. This paper describes NetLens applying a subset of the ACM Digital Library consisting of about 4,000 papers from the CM I conference written by about 6,000 authors. In addition, we are now working on a collection of half a million emails, and a dataset of legal cases","AuthorNamesDeduped":"Hyunmo Kang;Catherine Plaisant;Bongshin Lee;Benjamin B. Bederson","AuthorNames":"Hyunmo Kang;Catherine Plaisant;Bongshin Lee;Benjamin B. Bederson","AuthorAffiliation":"University of Maryland Institute for Advanced Computer Studies, kang@cs.umd.edu;University of Maryland Institute for Advanced Computer Studies, plaisant@cs.umd.edu;Human-Computer Interaction Laboratory, Computer Science Department, bongshin@cs.umd.edu;Human-Computer Interaction Laboratory, Computer Science Department; University of Maryland Institute for Advanced Computer Studies, bederson@cs.umd.edu","InternalReferences":"10.1109/INFVIS.2004.1;10.1109/INFVIS.1996.559210;10.1109/INFVIS.2005.1532136","AuthorKeywords":"Human-Computer Interaction, information visualization, network visualization, content-actor network data, iterative query refinement, incremental data exploration, user interfaces, digital library, piccolo","AminerCitationCount022019":"85","XPloreCitationCount022019":"11","PubsCited":"29","Award":""}},{"name":"David Gotz","value":539,"numPapers":94,"cluster":"0","visible":1,"index":341,"weight":32,"x":633.7591127976258,"y":237.84586199949385,"px":632.3882333351559,"py":243.2276534180821,"node":{"Conference":"Vis","Year":"2000","Title":"Automatic alignment of high-resolution multi-projector displays using an uncalibrated camera","DOI":"10.1109/VISUAL.2000.885685","Link":"http://dx.doi.org/10.1109/VISUAL.2000.885685","FirstPage":"125","LastPage":"130","PaperType":"C","Abstract":"A scalable, high-resolution display may be constructed by tiling many projected images over a single display surface. One fundamental challenge for such a display is to avoid visible seams due to misalignment among the projectors. Traditional methods for avoiding seams involve sophisticated mechanical devices and expensive CRT projectors, coupled with extensive human effort for fine-tuning the projectors. The paper describes an automatic alignment method that relies on an inexpensive, uncalibrated camera to measure the relative mismatches between neighboring projectors, and then correct the projected imagery to avoid seams without significant human effort.","AuthorNamesDeduped":"Yuqun Chen;Douglas W. Clark;Adam Finkelstein;Timothy C. Housel;Kai Li 0001","AuthorNames":"Yuqun Chen;D.W. Clark;A. Finkelstein;T.C. Housel;Kai Li","AuthorAffiliation":"Dept. of Comput. Sci., Princeton Univ., NJ, USA","InternalReferences":"10.1109/VISUAL.1999.809883","AuthorKeywords":"seamless tiling, automatic alignment, projective mapping, simulated annealing ","AminerCitationCount022019":"141","XPloreCitationCount022019":"16","PubsCited":"19","Award":""}},{"name":"E. Wes Bethel","value":124,"numPapers":22,"cluster":"12","visible":1,"index":342,"weight":5,"x":-121.29782614778233,"y":401.7322834985288,"px":-113.88457068947434,"py":400.61225224862415,"node":{"Conference":"Vis","Year":"1999","Title":"Large field visualization with demand-driven calculation","DOI":"10.1109/VISUAL.1999.809864","Link":"http://dx.doi.org/10.1109/VISUAL.1999.809864","FirstPage":"27","LastPage":"506","PaperType":"C","Abstract":"Presents a system designed for the interactive definition and visualization of fields derived from large data sets: the Demand-Driven Visualizer (DDV). The system allows the user to write arbitrary expressions to define new fields, and then apply a variety of visualization techniques to the result. Expressions can include differential operators and numerous other built-in functions. Determination of field values, both in space and in time, is directed automatically by the demands of the visualization techniques. The payoff of following a demand-driven design philosophy throughout the visualization system becomes particularly evident when working with large time-series data, where the costs of eager evaluation alternatives can be prohibitive.","AuthorNamesDeduped":"Patrick J. Moran;Chris Henze","AuthorNames":"P.J. Moran;C. Henze","AuthorAffiliation":"MRI Technol. Solutions, NASA Ames Res. Center, Moffett Field, CA, USA","InternalReferences":"10.1109/VISUAL.1992.235219;10.1109/VISUAL.1997.663888;10.1109/VISUAL.1996.568115;10.1109/VISUAL.1994.346311;10.1109/VISUAL.1993.398860;10.1109/VISUAL.1990.146360;10.1109/VISUAL.1997.663898;10.1109/VISUAL.1995.480821","AuthorKeywords":"large scale visualization, scientific visualization, interactive visualization, demand-driven evaluation, lazy evaluation, interpreted systems, Python","AminerCitationCount022019":"28","XPloreCitationCount022019":"10","PubsCited":"21","Award":""}},{"name":"Kurt Stockinger","value":73,"numPapers":6,"cluster":"12","visible":1,"index":343,"weight":1,"x":-317.7498342296077,"y":432.79594405600136,"px":-312.22396339025795,"py":428.7023914107757,"node":{"Conference":"Vis","Year":"1999","Title":"Large field visualization with demand-driven calculation","DOI":"10.1109/VISUAL.1999.809864","Link":"http://dx.doi.org/10.1109/VISUAL.1999.809864","FirstPage":"27","LastPage":"506","PaperType":"C","Abstract":"Presents a system designed for the interactive definition and visualization of fields derived from large data sets: the Demand-Driven Visualizer (DDV). The system allows the user to write arbitrary expressions to define new fields, and then apply a variety of visualization techniques to the result. Expressions can include differential operators and numerous other built-in functions. Determination of field values, both in space and in time, is directed automatically by the demands of the visualization techniques. The payoff of following a demand-driven design philosophy throughout the visualization system becomes particularly evident when working with large time-series data, where the costs of eager evaluation alternatives can be prohibitive.","AuthorNamesDeduped":"Patrick J. Moran;Chris Henze","AuthorNames":"P.J. Moran;C. Henze","AuthorAffiliation":"MRI Technol. Solutions, NASA Ames Res. Center, Moffett Field, CA, USA","InternalReferences":"10.1109/VISUAL.1992.235219;10.1109/VISUAL.1997.663888;10.1109/VISUAL.1996.568115;10.1109/VISUAL.1994.346311;10.1109/VISUAL.1993.398860;10.1109/VISUAL.1990.146360;10.1109/VISUAL.1997.663898;10.1109/VISUAL.1995.480821","AuthorKeywords":"large scale visualization, scientific visualization, interactive visualization, demand-driven evaluation, lazy evaluation, interpreted systems, Python","AminerCitationCount022019":"28","XPloreCitationCount022019":"10","PubsCited":"21","Award":""}},{"name":"Kesheng Wu","value":73,"numPapers":6,"cluster":"12","visible":1,"index":344,"weight":1,"x":-313.2059593105327,"y":400.60298267711875,"px":-306.7648870775008,"py":398.8837364120657,"node":{"Conference":"Vis","Year":"1999","Title":"Large field visualization with demand-driven calculation","DOI":"10.1109/VISUAL.1999.809864","Link":"http://dx.doi.org/10.1109/VISUAL.1999.809864","FirstPage":"27","LastPage":"506","PaperType":"C","Abstract":"Presents a system designed for the interactive definition and visualization of fields derived from large data sets: the Demand-Driven Visualizer (DDV). The system allows the user to write arbitrary expressions to define new fields, and then apply a variety of visualization techniques to the result. Expressions can include differential operators and numerous other built-in functions. Determination of field values, both in space and in time, is directed automatically by the demands of the visualization techniques. The payoff of following a demand-driven design philosophy throughout the visualization system becomes particularly evident when working with large time-series data, where the costs of eager evaluation alternatives can be prohibitive.","AuthorNamesDeduped":"Patrick J. Moran;Chris Henze","AuthorNames":"P.J. Moran;C. Henze","AuthorAffiliation":"MRI Technol. Solutions, NASA Ames Res. Center, Moffett Field, CA, USA","InternalReferences":"10.1109/VISUAL.1992.235219;10.1109/VISUAL.1997.663888;10.1109/VISUAL.1996.568115;10.1109/VISUAL.1994.346311;10.1109/VISUAL.1993.398860;10.1109/VISUAL.1990.146360;10.1109/VISUAL.1997.663898;10.1109/VISUAL.1995.480821","AuthorKeywords":"large scale visualization, scientific visualization, interactive visualization, demand-driven evaluation, lazy evaluation, interpreted systems, Python","AminerCitationCount022019":"28","XPloreCitationCount022019":"10","PubsCited":"21","Award":""}},{"name":"Joachim Georgii","value":37,"numPapers":20,"cluster":"4","visible":1,"index":345,"weight":2,"x":386.0022468076355,"y":640.7047488675684,"px":391.2051443241092,"py":635.0526163343321,"node":{"Conference":"Vis","Year":"2003","Title":"Hardware-based ray casting for tetrahedral meshes","DOI":"10.1109/VISUAL.2003.1250390","Link":"http://dx.doi.org/10.1109/VISUAL.2003.1250390","FirstPage":"333","LastPage":"340","PaperType":"C","Abstract":"We present the first implementation of a volume ray casting algorithm for tetrahedral meshes running on off-the-shelf programmable graphics hardware. Our implementation avoids the memory transfer bottleneck of the graphics bus since the complete mesh data is stored in the local memory of the graphics adapter and all computations, in particular ray traversal and ray integration, are performed by the graphics processing unit. Analogously to other ray casting algorithms, our algorithm does not require an expensive cell sorting. Provided that the graphics adapter offers enough texture memory, our implementation performs comparable to the fastest published volume rendering algorithms for unstructured meshes. Our approach works with cyclic and/or non-convex meshes and supports early ray termination. Accurate ray integration is guaranteed by applying pre-integrated volume rendering. In order to achieve almost interactive modifications of transfer functions, we propose a new method for computing three-dimensional pre-integration tables.","AuthorNamesDeduped":"Manfred Weiler;Martin Kraus;Markus Merz;Thomas Ertl","AuthorNames":"M. Weiler;M. Kraus;M. Merz;T. Ertl","AuthorAffiliation":"Visualization & Interactive Syst. Group, Univ. of Stutgart, Germany;Visualization & Interactive Syst. Group, Univ. of Stutgart, Germany;Visualization & Interactive Syst. Group, Univ. of Stutgart, Germany;Visualization & Interactive Syst. Group, Univ. of Stutgart, Germany","InternalReferences":"10.1109/VISUAL.2000.885683","AuthorKeywords":"ray casting, pixel shading, programmable graphics hardware, cell projection, tetrahedral meshes, unstructured meshes, volume visualization, pre-integrated volume rendering","AminerCitationCount022019":"196","XPloreCitationCount022019":"40","PubsCited":"14","Award":""}},{"name":"Andreas König 0002","value":51,"numPapers":2,"cluster":"4","visible":1,"index":346,"weight":1,"x":391.3266857602904,"y":928.1985605120295,"px":389.44252787411756,"py":920.7726325349884,"node":{"Conference":"InfoVis","Year":"1997","Title":"Nonlinear magnification fields","DOI":"10.1109/INFVIS.1997.636786","Link":"http://dx.doi.org/10.1109/INFVIS.1997.636786","FirstPage":"51","LastPage":"58","PaperType":"C","Abstract":"We introduce nonlinear magnification fields as an abstract representation of nonlinear magnification, providing methods for converting transformation routines to magnification fields and vice-versa. This new representation provides ease of manipulation and power of expression. By removing the restrictions of explicit foci and allowing precise specification of magnification values, we can achieve magnification effects which were not previously possible. Of particular interest are techniques we introduce for expressing complex and subtle magnification effects through magnification brushing, and allowing intrinsic properties of the data being visualized to create data-driven magnifications.","AuthorNamesDeduped":"Alan Keahey;Edward L. Robertson","AuthorNames":"T.A. Keahey;E.L. Robertson","AuthorAffiliation":"Dept. of Comput. Sci., Indiana Univ., Bloomington, IN, USA","InternalReferences":"10.1109/INFVIS.1996.559214","AuthorKeywords":"information visualization, nonlinear magnification, data-driven magnification, fisheye views, magnification brushing, data-mining","AminerCitationCount022019":"","XPloreCitationCount022019":"23","PubsCited":"20","Award":""}},{"name":"Wei Hong","value":22,"numPapers":11,"cluster":"4","visible":1,"index":347,"weight":1,"x":376.6161410546349,"y":934.2758165152637,"px":375.17570308776465,"py":927.4253264761333,"node":{"Conference":"Vis","Year":"1994","Title":"Discretized Marching Cubes","DOI":"10.1109/VISUAL.1994.346308","Link":"http://dx.doi.org/10.1109/VISUAL.1994.346308","FirstPage":"281","LastPage":"287, C32","PaperType":"C","Abstract":"Since the introduction of standard techniques for isosurface extraction from volumetric datasets, one of the hardest problems has been to reduce the number of triangles (or polygons) generated. The paper presents an algorithm that considerably reduces the number of polygons generated by a Marching Cubes-like scheme (W. Lorensen and H. Cline, 1987) without excessively increasing the overall computational complexity. The algorithm assumes discretization of the dataset space and replaces cell edge interpolation by midpoint selection. Under these assumptions, the extracted surfaces are composed of polygons lying within a finite number of incidences, thus allowing simple merging of the output facets into large coplanar polygons. An experimental evaluation of the proposed approach on datasets related to biomedical imaging and chemical modelling is reported.<<ETX>>","AuthorNamesDeduped":"Claudio Montani;Riccardo Scateni;Roberto Scopigno","AuthorNames":"C. Montani;R. Scateni;R. Scopigno","AuthorAffiliation":"CNR, Pisa, Italy","InternalReferences":"10.1109/VISUAL.1992.235223","AuthorKeywords":"","AminerCitationCount022019":"274","XPloreCitationCount022019":"44","PubsCited":"16","Award":""}},{"name":"Ezekiel S. Bhasker","value":25,"numPapers":11,"cluster":"7","visible":1,"index":348,"weight":7,"x":952.4831705238712,"y":-428.981232285398,"px":948.1004721314254,"py":-423.8908581238747,"node":{"Conference":"Vis","Year":"2002","Title":"Scalable alignment of large-format multi-projector displays using camera homography trees","DOI":"10.1109/VISUAL.2002.1183793","Link":"http://dx.doi.org/10.1109/VISUAL.2002.1183793","FirstPage":"339","LastPage":"346","PaperType":"C","Abstract":"This paper presents a vision-based geometric alignment system for aligning the projectors in an arbitrarily large display wall. Existing algorithms typically rely on a single camera view and degrade in accuracy as the display resolution exceeds the camera resolution by several orders of magnitude. Naive approaches to integrating multiple zoomed camera views fail since small errors in aligning adjacent views propagate quickly over the display surface to create glaring discontinuities. Our algorithm builds and refines a camera homography tree to automatically register any number of uncalibrated camera images; the resulting system is both faster and significantly more accurate than competing approaches, reliably achieving alignment errors of 0.55 pixels on a 24-projector display in under 9 minutes. Detailed experiments compare our system to two recent display wall alignment algorithms, both on our 18 Megapixel display wall and in simulation. These results indicate that our approach achieves sub-pixel accuracy even on displays with hundreds of projectors.","AuthorNamesDeduped":"Han Chen;Rahul Sukthankar;Grant Wallace;Kai Li 0001","AuthorNames":"Han Chen;R. Sukthankar;G. Wallace;Kai Li","AuthorAffiliation":"Comput. Sci., Princeton Univ., NJ, USA","InternalReferences":"10.1109/VISUAL.1999.809883;10.1109/VISUAL.2001.964508;10.1109/VISUAL.2000.885685","AuthorKeywords":"large-format tiled projection display, display wall, camera-projector systems, camera-based registration and calibration, automatic alignment, scalability, simulation, evaluation","AminerCitationCount022019":"205","XPloreCitationCount022019":"71","PubsCited":"13","Award":""}},{"name":"Kai Li 0001","value":46,"numPapers":4,"cluster":"7","visible":1,"index":349,"weight":2,"x":956.8239426726988,"y":-363.912545942011,"px":952.8016789642103,"py":-359.4999356720375,"node":{"Conference":"Vis","Year":"1999","Title":"Multi-projector displays using camera-based registration","DOI":"10.1109/VISUAL.1999.809883","Link":"http://dx.doi.org/10.1109/VISUAL.1999.809883","FirstPage":"161","LastPage":"522","PaperType":"C","Abstract":"Conventional projector-based display systems are typically designed around precise and regular configurations of projectors and display surfaces. While this results in rendering simplicity and speed, it also means painstaking construction and ongoing maintenance. In previously published work, we introduced a vision of projector-based displays constructed from a collection of casually-arranged projectors and display surfaces. In this paper, we present flexible yet practical methods for realizing this vision, enabling low-cost mega-pixel display systems with large physical dimensions, higher resolution, or both. The techniques afford new opportunities to build personal 3D visualization systems in offices, conference rooms, theaters, or even your living room. As a demonstration of the simplicity and effectiveness of the methods that we continue to perfect, we show in the included video that a 10-year old child can construct and calibrate a two-camera, two-projector, head-tracked display system, all in about 15 minutes.","AuthorNamesDeduped":"Ramesh Raskar;Michael S. Brown;Ruigang Yang;Wei-Chao Chen;Greg Welch;Herman Towles;W. Brent Seales;Henry Fuchs","AuthorNames":"R. Raskar;M.S. Brown;Ruigang Yang;Wei-Chao Chen;G. Welch;H. Towles;B. Scales;H. Fuchs","AuthorAffiliation":"Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA","InternalReferences":"","AuthorKeywords":"display, projection, spatially immersive display, panoramic image display, virtual environments, intensity blending, image-based modeling, depth, calibration, auto-calibration, structured light, camera-based registration","AminerCitationCount022019":"0","XPloreCitationCount022019":"125","PubsCited":"21","Award":""}},{"name":"Aditi Majumder","value":51,"numPapers":32,"cluster":"7","visible":1,"index":350,"weight":22,"x":914.962067335927,"y":-258.06746849101376,"px":910.2247890541557,"py":-253.91967850153142,"node":{"Conference":"Vis","Year":"1999","Title":"A distributed graphics system for large tiled displays","DOI":"10.1109/VISUAL.1999.809890","Link":"http://dx.doi.org/10.1109/VISUAL.1999.809890","FirstPage":"215","LastPage":"527","PaperType":"C","Abstract":"Recent interest in large displays has led to renewed development of tiled displays, which are comprised of several individual displays arranged in an array and used as one large logical display. Stanford's \"Interactive Mural\" is an example of such a display, using an overlapping four by two array of projectors that back-project onto a diffuse screen to form a 6' by 2' display area with a resolution of over 60 dpi. Writing software to make effective use of the large display space is a challenge because normal window system interaction metaphors break down. One promising approach is to switch to immersive applications; another approach, the one we are investigating, is to emulate office, conference room or studio environments which use the space to display a collection of visual material to support group activities. We describe a virtual graphics system that is designed to support multiple simultaneous rendering streams from both local and remote sites. The system abstracts the physical number of computers, graphics subsystems and projectors used to create the display. We provide performance measurements to show that the system scales well and thus supports a variety of different hardware configurations. The system is also interesting because it uses transparent \"layers\", instead of windows, to manage the screen.","AuthorNamesDeduped":"Greg Humphreys;Pat Hanrahan","AuthorNames":"G. Humphreys;P. Hanrahan","AuthorAffiliation":"Dept. of Comput. Sci., Stanford Univ., CA, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"217","XPloreCitationCount022019":"43","PubsCited":"26","Award":""}},{"name":"Han Chen","value":22,"numPapers":3,"cluster":"7","visible":1,"index":351,"weight":1,"x":1037.9963580228855,"y":-303.150271237424,"px":1031.7080056620687,"py":-301.6224249666727,"node":{"Conference":"Vis","Year":"1999","Title":"Multi-projector displays using camera-based registration","DOI":"10.1109/VISUAL.1999.809883","Link":"http://dx.doi.org/10.1109/VISUAL.1999.809883","FirstPage":"161","LastPage":"522","PaperType":"C","Abstract":"Conventional projector-based display systems are typically designed around precise and regular configurations of projectors and display surfaces. While this results in rendering simplicity and speed, it also means painstaking construction and ongoing maintenance. In previously published work, we introduced a vision of projector-based displays constructed from a collection of casually-arranged projectors and display surfaces. In this paper, we present flexible yet practical methods for realizing this vision, enabling low-cost mega-pixel display systems with large physical dimensions, higher resolution, or both. The techniques afford new opportunities to build personal 3D visualization systems in offices, conference rooms, theaters, or even your living room. As a demonstration of the simplicity and effectiveness of the methods that we continue to perfect, we show in the included video that a 10-year old child can construct and calibrate a two-camera, two-projector, head-tracked display system, all in about 15 minutes.","AuthorNamesDeduped":"Ramesh Raskar;Michael S. Brown;Ruigang Yang;Wei-Chao Chen;Greg Welch;Herman Towles;W. Brent Seales;Henry Fuchs","AuthorNames":"R. Raskar;M.S. Brown;Ruigang Yang;Wei-Chao Chen;G. Welch;H. Towles;B. Scales;H. Fuchs","AuthorAffiliation":"Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA","InternalReferences":"","AuthorKeywords":"display, projection, spatially immersive display, panoramic image display, virtual environments, intensity blending, image-based modeling, depth, calibration, auto-calibration, structured light, camera-based registration","AminerCitationCount022019":"0","XPloreCitationCount022019":"125","PubsCited":"21","Award":""}},{"name":"Rahul Sukthankar","value":22,"numPapers":3,"cluster":"7","visible":1,"index":352,"weight":1,"x":919.9872843097595,"y":-409.199541420708,"px":910.2223378107926,"py":-405.82869131101273,"node":{"Conference":"Vis","Year":"1999","Title":"Multi-projector displays using camera-based registration","DOI":"10.1109/VISUAL.1999.809883","Link":"http://dx.doi.org/10.1109/VISUAL.1999.809883","FirstPage":"161","LastPage":"522","PaperType":"C","Abstract":"Conventional projector-based display systems are typically designed around precise and regular configurations of projectors and display surfaces. While this results in rendering simplicity and speed, it also means painstaking construction and ongoing maintenance. In previously published work, we introduced a vision of projector-based displays constructed from a collection of casually-arranged projectors and display surfaces. In this paper, we present flexible yet practical methods for realizing this vision, enabling low-cost mega-pixel display systems with large physical dimensions, higher resolution, or both. The techniques afford new opportunities to build personal 3D visualization systems in offices, conference rooms, theaters, or even your living room. As a demonstration of the simplicity and effectiveness of the methods that we continue to perfect, we show in the included video that a 10-year old child can construct and calibrate a two-camera, two-projector, head-tracked display system, all in about 15 minutes.","AuthorNamesDeduped":"Ramesh Raskar;Michael S. Brown;Ruigang Yang;Wei-Chao Chen;Greg Welch;Herman Towles;W. Brent Seales;Henry Fuchs","AuthorNames":"R. Raskar;M.S. Brown;Ruigang Yang;Wei-Chao Chen;G. Welch;H. Towles;B. Scales;H. Fuchs","AuthorAffiliation":"Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA","InternalReferences":"","AuthorKeywords":"display, projection, spatially immersive display, panoramic image display, virtual environments, intensity blending, image-based modeling, depth, calibration, auto-calibration, structured light, camera-based registration","AminerCitationCount022019":"0","XPloreCitationCount022019":"125","PubsCited":"21","Award":""}},{"name":"Grant Wallace","value":22,"numPapers":3,"cluster":"7","visible":1,"index":353,"weight":1,"x":1001.8065355782297,"y":-329.74806558225725,"px":997.1417145522406,"py":-327.8807992715413,"node":{"Conference":"Vis","Year":"1999","Title":"Multi-projector displays using camera-based registration","DOI":"10.1109/VISUAL.1999.809883","Link":"http://dx.doi.org/10.1109/VISUAL.1999.809883","FirstPage":"161","LastPage":"522","PaperType":"C","Abstract":"Conventional projector-based display systems are typically designed around precise and regular configurations of projectors and display surfaces. While this results in rendering simplicity and speed, it also means painstaking construction and ongoing maintenance. In previously published work, we introduced a vision of projector-based displays constructed from a collection of casually-arranged projectors and display surfaces. In this paper, we present flexible yet practical methods for realizing this vision, enabling low-cost mega-pixel display systems with large physical dimensions, higher resolution, or both. The techniques afford new opportunities to build personal 3D visualization systems in offices, conference rooms, theaters, or even your living room. As a demonstration of the simplicity and effectiveness of the methods that we continue to perfect, we show in the included video that a 10-year old child can construct and calibrate a two-camera, two-projector, head-tracked display system, all in about 15 minutes.","AuthorNamesDeduped":"Ramesh Raskar;Michael S. Brown;Ruigang Yang;Wei-Chao Chen;Greg Welch;Herman Towles;W. Brent Seales;Henry Fuchs","AuthorNames":"R. Raskar;M.S. Brown;Ruigang Yang;Wei-Chao Chen;G. Welch;H. Towles;B. Scales;H. Fuchs","AuthorAffiliation":"Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA","InternalReferences":"","AuthorKeywords":"display, projection, spatially immersive display, panoramic image display, virtual environments, intensity blending, image-based modeling, depth, calibration, auto-calibration, structured light, camera-based registration","AminerCitationCount022019":"0","XPloreCitationCount022019":"125","PubsCited":"21","Award":""}},{"name":"Zhu He","value":18,"numPapers":1,"cluster":"7","visible":1,"index":354,"weight":1,"x":905.6930274431472,"y":-397.04830396067234,"px":902.3608669133215,"py":-394.01782986133907,"node":{"Conference":"Vis","Year":"1999","Title":"A distributed graphics system for large tiled displays","DOI":"10.1109/VISUAL.1999.809890","Link":"http://dx.doi.org/10.1109/VISUAL.1999.809890","FirstPage":"215","LastPage":"527","PaperType":"C","Abstract":"Recent interest in large displays has led to renewed development of tiled displays, which are comprised of several individual displays arranged in an array and used as one large logical display. Stanford's \"Interactive Mural\" is an example of such a display, using an overlapping four by two array of projectors that back-project onto a diffuse screen to form a 6' by 2' display area with a resolution of over 60 dpi. Writing software to make effective use of the large display space is a challenge because normal window system interaction metaphors break down. One promising approach is to switch to immersive applications; another approach, the one we are investigating, is to emulate office, conference room or studio environments which use the space to display a collection of visual material to support group activities. We describe a virtual graphics system that is designed to support multiple simultaneous rendering streams from both local and remote sites. The system abstracts the physical number of computers, graphics subsystems and projectors used to create the display. We provide performance measurements to show that the system scales well and thus supports a variety of different hardware configurations. The system is also interesting because it uses transparent \"layers\", instead of windows, to manage the screen.","AuthorNamesDeduped":"Greg Humphreys;Pat Hanrahan","AuthorNames":"G. Humphreys;P. Hanrahan","AuthorAffiliation":"Dept. of Comput. Sci., Stanford Univ., CA, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"217","XPloreCitationCount022019":"43","PubsCited":"26","Award":""}},{"name":"Ruigang Yang","value":58,"numPapers":4,"cluster":"7","visible":1,"index":355,"weight":3,"x":888.4436941652198,"y":-413.9772276428967,"px":885.2687579248307,"py":-408.73747319757916,"node":{"Conference":"Vis","Year":"1999","Title":"Multi-projector displays using camera-based registration","DOI":"10.1109/VISUAL.1999.809883","Link":"http://dx.doi.org/10.1109/VISUAL.1999.809883","FirstPage":"161","LastPage":"522","PaperType":"C","Abstract":"Conventional projector-based display systems are typically designed around precise and regular configurations of projectors and display surfaces. While this results in rendering simplicity and speed, it also means painstaking construction and ongoing maintenance. In previously published work, we introduced a vision of projector-based displays constructed from a collection of casually-arranged projectors and display surfaces. In this paper, we present flexible yet practical methods for realizing this vision, enabling low-cost mega-pixel display systems with large physical dimensions, higher resolution, or both. The techniques afford new opportunities to build personal 3D visualization systems in offices, conference rooms, theaters, or even your living room. As a demonstration of the simplicity and effectiveness of the methods that we continue to perfect, we show in the included video that a 10-year old child can construct and calibrate a two-camera, two-projector, head-tracked display system, all in about 15 minutes.","AuthorNamesDeduped":"Ramesh Raskar;Michael S. Brown;Ruigang Yang;Wei-Chao Chen;Greg Welch;Herman Towles;W. Brent Seales;Henry Fuchs","AuthorNames":"R. Raskar;M.S. Brown;Ruigang Yang;Wei-Chao Chen;G. Welch;H. Towles;B. Scales;H. Fuchs","AuthorAffiliation":"Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA","InternalReferences":"","AuthorKeywords":"display, projection, spatially immersive display, panoramic image display, virtual environments, intensity blending, image-based modeling, depth, calibration, auto-calibration, structured light, camera-based registration","AminerCitationCount022019":"0","XPloreCitationCount022019":"125","PubsCited":"21","Award":""}},{"name":"Ramesh Raskar","value":38,"numPapers":0,"cluster":"7","visible":1,"index":356,"weight":1,"x":1073.5443664140957,"y":-295.5098453509863,"px":1067.9707098817926,"py":-292.8073962088437,"node":{"Conference":"Vis","Year":"1999","Title":"Multi-projector displays using camera-based registration","DOI":"10.1109/VISUAL.1999.809883","Link":"http://dx.doi.org/10.1109/VISUAL.1999.809883","FirstPage":"161","LastPage":"522","PaperType":"C","Abstract":"Conventional projector-based display systems are typically designed around precise and regular configurations of projectors and display surfaces. While this results in rendering simplicity and speed, it also means painstaking construction and ongoing maintenance. In previously published work, we introduced a vision of projector-based displays constructed from a collection of casually-arranged projectors and display surfaces. In this paper, we present flexible yet practical methods for realizing this vision, enabling low-cost mega-pixel display systems with large physical dimensions, higher resolution, or both. The techniques afford new opportunities to build personal 3D visualization systems in offices, conference rooms, theaters, or even your living room. As a demonstration of the simplicity and effectiveness of the methods that we continue to perfect, we show in the included video that a 10-year old child can construct and calibrate a two-camera, two-projector, head-tracked display system, all in about 15 minutes.","AuthorNamesDeduped":"Ramesh Raskar;Michael S. Brown;Ruigang Yang;Wei-Chao Chen;Greg Welch;Herman Towles;W. Brent Seales;Henry Fuchs","AuthorNames":"R. Raskar;M.S. Brown;Ruigang Yang;Wei-Chao Chen;G. Welch;H. Towles;B. Scales;H. Fuchs","AuthorAffiliation":"Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA","InternalReferences":"","AuthorKeywords":"display, projection, spatially immersive display, panoramic image display, virtual environments, intensity blending, image-based modeling, depth, calibration, auto-calibration, structured light, camera-based registration","AminerCitationCount022019":"0","XPloreCitationCount022019":"125","PubsCited":"21","Award":""}},{"name":"W. Brent Seales","value":38,"numPapers":5,"cluster":"7","visible":1,"index":357,"weight":1,"x":1060.4911926526872,"y":-331.2243951899321,"px":1054.7964215314773,"py":-328.9890048851398,"node":{"Conference":"Vis","Year":"1999","Title":"Multi-projector displays using camera-based registration","DOI":"10.1109/VISUAL.1999.809883","Link":"http://dx.doi.org/10.1109/VISUAL.1999.809883","FirstPage":"161","LastPage":"522","PaperType":"C","Abstract":"Conventional projector-based display systems are typically designed around precise and regular configurations of projectors and display surfaces. While this results in rendering simplicity and speed, it also means painstaking construction and ongoing maintenance. In previously published work, we introduced a vision of projector-based displays constructed from a collection of casually-arranged projectors and display surfaces. In this paper, we present flexible yet practical methods for realizing this vision, enabling low-cost mega-pixel display systems with large physical dimensions, higher resolution, or both. The techniques afford new opportunities to build personal 3D visualization systems in offices, conference rooms, theaters, or even your living room. As a demonstration of the simplicity and effectiveness of the methods that we continue to perfect, we show in the included video that a 10-year old child can construct and calibrate a two-camera, two-projector, head-tracked display system, all in about 15 minutes.","AuthorNamesDeduped":"Ramesh Raskar;Michael S. Brown;Ruigang Yang;Wei-Chao Chen;Greg Welch;Herman Towles;W. Brent Seales;Henry Fuchs","AuthorNames":"R. Raskar;M.S. Brown;Ruigang Yang;Wei-Chao Chen;G. Welch;H. Towles;B. Scales;H. Fuchs","AuthorAffiliation":"Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA","InternalReferences":"","AuthorKeywords":"display, projection, spatially immersive display, panoramic image display, virtual environments, intensity blending, image-based modeling, depth, calibration, auto-calibration, structured light, camera-based registration","AminerCitationCount022019":"0","XPloreCitationCount022019":"125","PubsCited":"21","Award":""}},{"name":"Justin Hensley","value":20,"numPapers":4,"cluster":"7","visible":1,"index":358,"weight":1,"x":926.7997862866064,"y":-329.34747101404463,"px":923.080134574637,"py":-325.65972702536544,"node":{"Conference":"Vis","Year":"2000","Title":"Automatic alignment of high-resolution multi-projector displays using an uncalibrated camera","DOI":"10.1109/VISUAL.2000.885685","Link":"http://dx.doi.org/10.1109/VISUAL.2000.885685","FirstPage":"125","LastPage":"130","PaperType":"C","Abstract":"A scalable, high-resolution display may be constructed by tiling many projected images over a single display surface. One fundamental challenge for such a display is to avoid visible seams due to misalignment among the projectors. Traditional methods for avoiding seams involve sophisticated mechanical devices and expensive CRT projectors, coupled with extensive human effort for fine-tuning the projectors. The paper describes an automatic alignment method that relies on an inexpensive, uncalibrated camera to measure the relative mismatches between neighboring projectors, and then correct the projected imagery to avoid seams without significant human effort.","AuthorNamesDeduped":"Yuqun Chen;Douglas W. Clark;Adam Finkelstein;Timothy C. Housel;Kai Li 0001","AuthorNames":"Yuqun Chen;D.W. Clark;A. Finkelstein;T.C. Housel;Kai Li","AuthorAffiliation":"Dept. of Comput. Sci., Princeton Univ., NJ, USA","InternalReferences":"10.1109/VISUAL.1999.809883","AuthorKeywords":"seamless tiling, automatic alignment, projective mapping, simulated annealing ","AminerCitationCount022019":"141","XPloreCitationCount022019":"16","PubsCited":"19","Award":""}},{"name":"Peter Rautek","value":62,"numPapers":37,"cluster":"3","visible":1,"index":359,"weight":2,"x":361.6365884257821,"y":687.3471916906782,"px":365.1075391782065,"py":679.3256844247973,"node":{"Conference":"Vis","Year":"2005","Title":"VolumeShop: an interactive system for direct volume illustration","DOI":"10.1109/VISUAL.2005.1532856","Link":"http://dx.doi.org/10.1109/VISUAL.2005.1532856","FirstPage":"671","LastPage":"678","PaperType":"C","Abstract":"Illustrations play a major role in the education process. Whether used to teach a surgical or radiologic procedure, to illustrate normal or aberrant anatomy, or to explain the functioning of a technical device, illustration significantly impacts learning. Although many specimens are readily available as volumetric data sets, particularly in medicine, illustrations are commonly produced manually as static images in a time-consuming process. Our goal is to create a fully dynamic three-dimensional illustration environment which directly operates on volume data. Single images have the aesthetic appeal of traditional illustrations, but can be interactively altered and explored. In this paper we present methods to realize such a system which combines artistic visual styles and expressive visualization techniques. We introduce a novel concept for direct multi-object volume visualization which allows control of the appearance of inter-penetrating objects via two-dimensional transfer functions. Furthermore, a unifying approach to efficiently integrate many non-photorealistic rendering models is presented. We discuss several illustrative concepts which can be realized by combining cutaways, ghosting, and selective deformation. Finally, we also propose a simple interface to specify objects of interest through three-dimensional volumetric painting. All presented methods are integrated into VolumeShop, an interactive hardware-accelerated application for direct volume illustration.","AuthorNamesDeduped":"Stefan Bruckner;M. Eduard Gröller","AuthorNames":"S. Bruckner;M.E. Groller","AuthorAffiliation":"Inst. of Comput. Graphics & Algorithms, Vienna Univ. of Technol., Austria;Inst. of Comput. Graphics & Algorithms, Vienna Univ. of Technol., Austria","InternalReferences":"10.1109/VISUAL.2000.885694;10.1109/VISUAL.2002.1183777;10.1109/VISUAL.2004.62;10.1109/VISUAL.2003.1250384;10.1109/VISUAL.2004.48;10.1109/VISUAL.2004.64","AuthorKeywords":"illustrative visualization, volume rendering, focus+context techniques","AminerCitationCount022019":"226","XPloreCitationCount022019":"42","PubsCited":"27","Award":""}},{"name":"Carl-Fredrik Westin","value":100,"numPapers":22,"cluster":"6","visible":1,"index":360,"weight":3,"x":213.75724337758408,"y":638.1119558307201,"px":219.24972556798988,"py":634.2638159353788,"node":{"Conference":"Vis","Year":"2004","Title":"Display of vector fields using a reaction-diffusion model","DOI":"10.1109/VISUAL.2004.25","Link":"http://dx.doi.org/10.1109/VISUAL.2004.25","FirstPage":"115","LastPage":"122","PaperType":"C","Abstract":"Effective visualization of vector fields relies on the ability to control the size and density of the underlying mapping to visual cues used to represent the field. In this paper we introduce the use of a reaction-diffusion model, already well known for its ability to form irregular spatio-temporal patters, to control the size, density, and placement of the vector field representation. We demonstrate that it is possible to encode vector field information (orientation and magnitude) into the parameters governing a reaction-diffusion model to form a spot pattern with the correct orientation, size, and density, creating an effective visualization. To encode direction we texture the spots using a light to dark fading texture. We also show that it is possible to use the reaction-diffusion model to visualize an additional scalar value, such as the uncertainty in the orientation of the vector field. An additional benefit of the reaction-diffusion visualization technique arises from its automatic density distribution. This benefit suggests using the technique to augment other vector visualization techniques. We demonstrate this utility by augmenting a LIC visualization with a reaction-diffusion visualization. Finally, the reaction-diffusion visualization method provides a technique that can be used for streamline and glyph placement.","AuthorNamesDeduped":"Allen R. Sanderson;Christopher R. Johnson 0001;Robert Michael Kirby","AuthorNames":"A.R. Sanderson;C.R. Johnson;R.M. Kirby","AuthorAffiliation":"Sci. Comput. & Imaging Inst., Utah Univ., Salt Lake City, UT, USA;Sci. Comput. & Imaging Inst., Utah Univ., Salt Lake City, UT, USA;Sci. Comput. & Imaging Inst., Utah Univ., Salt Lake City, UT, USA","InternalReferences":"10.1109/VISUAL.1999.809865;10.1109/VISUAL.1995.480817;10.1109/VISUAL.1995.485141;10.1109/VISUAL.2000.885688;10.1109/VISUAL.1996.567784;10.1109/VISUAL.1992.235211;10.1109/VISUAL.1992.235225;10.1109/TVCG.2009.126;10.1109/VISUAL.1996.567777;10.1109/VISUAL.2003.1250357;10.1109/VISUAL.1999.809904;10.1109/VISUAL.1999.809905;10.1109/VISUAL.1991.175789;10.1109/VISUAL.1997.663897","AuthorKeywords":"Vector Field Visualization, Flow Visualization, Reaction-Diffusion, Vector Fields","AminerCitationCount022019":"59","XPloreCitationCount022019":"17","PubsCited":"33","Award":""}},{"name":"Udeepta Bordoloi","value":79,"numPapers":15,"cluster":"4","visible":1,"index":361,"weight":1,"x":189.91880715099254,"y":742.4965600864141,"px":191.0308810655092,"py":736.9670784408938,"node":{"Conference":"Vis","Year":"1998","Title":"Interactive out-of-core isosurface extraction","DOI":"10.1109/VISUAL.1998.745299","Link":"http://dx.doi.org/10.1109/VISUAL.1998.745299","FirstPage":"167","LastPage":"174","PaperType":"C","Abstract":"We present a novel out-of-core technique for the interactive computation of isosurfaces from volume data. Our algorithm minimizes the main memory and disk space requirements on the visualization workstation, while speeding up isosurface extraction queries. Our overall approach is a two-level indexing scheme. First, by our meta-cell technique, we partition the original dataset into clusters of cells, called meta-cells. Secondly, we produce meta-intervals associated with the meta-cells, and build an indexing data structure on the meta-intervals. We separate the cell information, kept only in meta-cells on disk, from the indexing structure, which is also on disk and only contains pointers to meta-cells. Our meta-cell technique is an I/O-efficient approach for computing a k-d-tree-like partition of the dataset. Our indexing data structure, the binary blocked I/O interval tree, is a new I/O-optimal data structure to perform stabbing queries that report from a set of meta-intervals (or intervals) those containing a query value q. Our tree is simpler to implement, and is also more space-efficient in practice than existing structures. To perform an isosurface query, we first query the indexing structure, and then use the reported meta-cell pointers to read from disk the active meta-cells intersected by the isosurface. The isosurface itself can then be generated from active meta-cells. Rather than being a single cost indexing approach, our technique exhibits a smooth trade-off between query time and disk space.","AuthorNamesDeduped":"Yi-Jen Chiang;Cláudio T. Silva;William J. Schroeder","AuthorNames":"Y.-J. Chiang;C.T. Silva;W.J. Schroeder","AuthorAffiliation":"","InternalReferences":"10.1109/VISUAL.1997.663888;10.1109/VISUAL.1997.663895;10.1109/VISUAL.1996.568121","AuthorKeywords":"Isosurface Extraction, Marching Cubes, Out-Of-Core Computation, Interval Tree, Scientific Visualization","AminerCitationCount022019":"178","XPloreCitationCount022019":"42","PubsCited":"28","Award":""}},{"name":"Liviu Tancau","value":82,"numPapers":0,"cluster":"3","visible":1,"index":362,"weight":1,"x":213.32823493313856,"y":170.42868355690254,"px":220.90818950819198,"py":173.21557214560943,"node":{"Conference":"Vis","Year":"2003","Title":"Using deformations for browsing volumetric data","DOI":"10.1109/VISUAL.2003.1250400","Link":"http://dx.doi.org/10.1109/VISUAL.2003.1250400","FirstPage":"401","LastPage":"408","PaperType":"C","Abstract":"Many traditional techniques for \"looking inside\" volumetric data involve removing portions of the data, for example using various cutting tools, to reveal the interior. This allows the user to see hidden parts of the data, but has the disadvantage of removing potentially important surrounding contextual information. We explore an alternate strategy for browsing that uses deformations, where the user can cut into and open up, spread apart, or peel away parts of the volume in real time, making the interior visible while still retaining surrounding context. We consider various deformation strategies and present a number of interaction techniques based on different metaphors. Our designs pay special attention to the semantic layers that might compose a volume (e.g. the skin, muscle, bone in a scan of a human). Users can apply deformations to only selected layers, or apply a given deformation to a different degree to each layer, making browsing more flexible and facilitating the visualization of relationships between layers. Our interaction techniques are controlled with direct, \"in place\" manipulation, using pop-up menus and 3D widgets, to avoid the divided attention and awkwardness that would come with panels of traditional widgets. Initial user feedback indicates that our techniques are valuable, especially for showing portions of the data spatially situated in context with surrounding data.","AuthorNamesDeduped":"Michael J. McGuffin;Liviu Tancau;Ravin Balakrishnan","AuthorNames":"M.J. McGuffin;L. Tancau;R. Balakrishnan","AuthorAffiliation":"Dept. of Comput. Sci., Univ. of Toronto, Ont., Canada;Dept. of Comput. Sci., Univ. of Toronto, Ont., Canada;Dept. of Comput. Sci., Univ. of Toronto, Ont., Canada","InternalReferences":"","AuthorKeywords":"volumetric data, volume data, deformations, browsing, layers, interaction techniques, 3D widgets","AminerCitationCount022019":"202","XPloreCitationCount022019":"58","PubsCited":"21","Award":""}},{"name":"Ravin Balakrishnan","value":204,"numPapers":28,"cluster":"0","visible":1,"index":363,"weight":3,"x":465.72946911694066,"y":249.25362757228456,"px":469.1345448433434,"py":251.88271182318985,"node":{"Conference":"InfoVis","Year":"2002","Title":"SpaceTree: supporting exploration in large node link tree, design evolution and empirical evaluation","DOI":"10.1109/INFVIS.2002.1173148","Link":"http://dx.doi.org/10.1109/INFVIS.2002.1173148","FirstPage":"57","LastPage":"64","PaperType":"C","Abstract":"We present a novel tree browser that builds on the conventional node link tree diagrams. It adds dynamic rescaling of branches of the tree to best fit the available screen space, optimized camera movement, and the use of preview icons summarizing the topology of the branches that cannot be expanded. In addition, it includes integrated search and filter functions. This paper reflects on the evolution of the design and highlights the principles that emerged from it. A controlled experiment showed benefits for navigation to already previously visited nodes and estimation of overall tree topology.","AuthorNamesDeduped":"Catherine Plaisant;Jesse Grosjean;Benjamin B. Bederson","AuthorNames":"C. Plaisant;J. Grosjean;B.B. Bederson","AuthorAffiliation":"Human-Comput. Interaction Lab., Maryland Univ., MD, USA;Human-Comput. Interaction Lab., Maryland Univ., MD, USA;Human-Comput. Interaction Lab., Maryland Univ., MD, USA","InternalReferences":"10.1109/VISUAL.1996.567745","AuthorKeywords":"","AminerCitationCount022019":"423","XPloreCitationCount022019":"80","PubsCited":"23","Award":""}},{"name":"Matús Straka","value":39,"numPapers":4,"cluster":"3","visible":1,"index":364,"weight":1,"x":143.20148049161423,"y":329.76639617521784,"px":150.3367158809696,"py":330.7419311140565,"node":{"Conference":"Vis","Year":"2001","Title":"Visualization and interaction techniques for the exploration of vascular structures","DOI":"10.1109/VISUAL.2001.964538","Link":"http://dx.doi.org/10.1109/VISUAL.2001.964538","FirstPage":"395","LastPage":"402","PaperType":"C","Abstract":"We describe a pipeline of image processing steps for deriving symbolic models of vascular structures from radiological data which reflect the branching pattern and diameter of vessels. For the visualization of these symbolic models, concatenated truncated cones are smoothly blended at branching points. We put emphasis on the quality of the visualizations which is achieved by anti-aliasing operations in different stages of the visualization. The methods presented are referred to as HQVV (high quality vessel visualization). Scalable techniques are provided to explore vascular structures of different orders of magnitude. The hierarchy as well as the diameter of the branches of vascular systems are used to restrict visualizations to relevant subtrees and to emphasize parts of vascular systems. Our research is inspired by clear visualizations in textbooks and is targeted toward medical education and therapy planning. We describe the application of vessel visualization techniques for liver surgery planning. For this application it is crucial to recognize the morphology and branching pattern of vascular systems as well as the basic spatial relations between vessels and other anatomic structures.","AuthorNamesDeduped":"Horst K. Hahn;Bernhard Preim;Dirk Selle;Heinz-Otto Peitgen","AuthorNames":"H.K. Hahn;B. Preim;D. Selle;H.-O. Peitgen","AuthorAffiliation":"MeVis-Center for Med. Diagnostic Syst., Bremen, Germany;MeVis-Center for Med. Diagnostic Syst., Bremen, Germany;MeVis-Center for Med. Diagnostic Syst., Bremen, Germany;MeVis-Center for Med. Diagnostic Syst., Bremen, Germany","InternalReferences":"10.1109/VISUAL.1997.663917","AuthorKeywords":"vessel visualization, medical visualization, computer-assisted surgery","AminerCitationCount022019":"139","XPloreCitationCount022019":"36","PubsCited":"22","Award":""}},{"name":"Michal Cervenanský","value":39,"numPapers":3,"cluster":"3","visible":1,"index":365,"weight":1,"x":106.3915136689986,"y":355.632549127814,"px":115.10686980759566,"py":354.18465842157406,"node":{"Conference":"Vis","Year":"2001","Title":"Visualization and interaction techniques for the exploration of vascular structures","DOI":"10.1109/VISUAL.2001.964538","Link":"http://dx.doi.org/10.1109/VISUAL.2001.964538","FirstPage":"395","LastPage":"402","PaperType":"C","Abstract":"We describe a pipeline of image processing steps for deriving symbolic models of vascular structures from radiological data which reflect the branching pattern and diameter of vessels. For the visualization of these symbolic models, concatenated truncated cones are smoothly blended at branching points. We put emphasis on the quality of the visualizations which is achieved by anti-aliasing operations in different stages of the visualization. The methods presented are referred to as HQVV (high quality vessel visualization). Scalable techniques are provided to explore vascular structures of different orders of magnitude. The hierarchy as well as the diameter of the branches of vascular systems are used to restrict visualizations to relevant subtrees and to emphasize parts of vascular systems. Our research is inspired by clear visualizations in textbooks and is targeted toward medical education and therapy planning. We describe the application of vessel visualization techniques for liver surgery planning. For this application it is crucial to recognize the morphology and branching pattern of vascular systems as well as the basic spatial relations between vessels and other anatomic structures.","AuthorNamesDeduped":"Horst K. Hahn;Bernhard Preim;Dirk Selle;Heinz-Otto Peitgen","AuthorNames":"H.K. Hahn;B. Preim;D. Selle;H.-O. Peitgen","AuthorAffiliation":"MeVis-Center for Med. Diagnostic Syst., Bremen, Germany;MeVis-Center for Med. Diagnostic Syst., Bremen, Germany;MeVis-Center for Med. Diagnostic Syst., Bremen, Germany;MeVis-Center for Med. Diagnostic Syst., Bremen, Germany","InternalReferences":"10.1109/VISUAL.1997.663917","AuthorKeywords":"vessel visualization, medical visualization, computer-assisted surgery","AminerCitationCount022019":"139","XPloreCitationCount022019":"36","PubsCited":"22","Award":""}},{"name":"Alexandra La Cruz","value":39,"numPapers":4,"cluster":"3","visible":1,"index":366,"weight":1,"x":575.5330412884466,"y":875.7350881512539,"px":574.3055125917552,"py":868.2952072162004,"node":{"Conference":"Vis","Year":"2001","Title":"Visualization and interaction techniques for the exploration of vascular structures","DOI":"10.1109/VISUAL.2001.964538","Link":"http://dx.doi.org/10.1109/VISUAL.2001.964538","FirstPage":"395","LastPage":"402","PaperType":"C","Abstract":"We describe a pipeline of image processing steps for deriving symbolic models of vascular structures from radiological data which reflect the branching pattern and diameter of vessels. For the visualization of these symbolic models, concatenated truncated cones are smoothly blended at branching points. We put emphasis on the quality of the visualizations which is achieved by anti-aliasing operations in different stages of the visualization. The methods presented are referred to as HQVV (high quality vessel visualization). Scalable techniques are provided to explore vascular structures of different orders of magnitude. The hierarchy as well as the diameter of the branches of vascular systems are used to restrict visualizations to relevant subtrees and to emphasize parts of vascular systems. Our research is inspired by clear visualizations in textbooks and is targeted toward medical education and therapy planning. We describe the application of vessel visualization techniques for liver surgery planning. For this application it is crucial to recognize the morphology and branching pattern of vascular systems as well as the basic spatial relations between vessels and other anatomic structures.","AuthorNamesDeduped":"Horst K. Hahn;Bernhard Preim;Dirk Selle;Heinz-Otto Peitgen","AuthorNames":"H.K. Hahn;B. Preim;D. Selle;H.-O. Peitgen","AuthorAffiliation":"MeVis-Center for Med. Diagnostic Syst., Bremen, Germany;MeVis-Center for Med. Diagnostic Syst., Bremen, Germany;MeVis-Center for Med. Diagnostic Syst., Bremen, Germany;MeVis-Center for Med. Diagnostic Syst., Bremen, Germany","InternalReferences":"10.1109/VISUAL.1997.663917","AuthorKeywords":"vessel visualization, medical visualization, computer-assisted surgery","AminerCitationCount022019":"139","XPloreCitationCount022019":"36","PubsCited":"22","Award":""}},{"name":"Christof Rezk-Salama","value":102,"numPapers":21,"cluster":"4","visible":1,"index":367,"weight":3,"x":336.47925955112754,"y":571.0789138753029,"px":340.86383920962913,"py":566.9626681843207,"node":{"Conference":"Vis","Year":"1993","Title":"Texture splats for 3D scalar and vector field visualization","DOI":"10.1109/VISUAL.1993.398877","Link":"http://dx.doi.org/10.1109/VISUAL.1993.398877","FirstPage":"261","LastPage":"266","PaperType":"C","Abstract":"Volume visualization is becoming an important tool for understanding large 3D data sets. A popular technique for volume rendering is known as splatting. With new hardware architectures offering substantial improvements in the performance of rendering texture mapped objects, we present textured splats. An ideal reconstruction function for 3D signals is developed which can be used as a texture map for a splat. Extensions to the basic splatting technique are then developed to additionally represent vector fields.<<ETX>>","AuthorNamesDeduped":"Roger Crawfis;Nelson L. Max","AuthorNames":"R.A. Crawfis;N. Max","AuthorAffiliation":"Lawrence Livermore Nat. Lab., Livermore, CA, USA;Lawrence Livermore Nat. Lab., Livermore, CA, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"1","XPloreCitationCount022019":"73","PubsCited":"6","Award":"TT"}},{"name":"Haitao Zhang","value":0,"numPapers":5,"cluster":"4","visible":1,"index":368,"weight":1,"x":-40.0386056876634,"y":335.0774428043309,"px":-31.613821144935002,"py":331.75870884430117,"node":{"Conference":"Vis","Year":"1998","Title":"Interactive ray tracing for isosurface rendering","DOI":"10.1109/VISUAL.1998.745713","Link":"http://dx.doi.org/10.1109/VISUAL.1998.745713","FirstPage":"233","LastPage":"238","PaperType":"C","Abstract":"We show that it is feasible to perform interactive isosurfacing of very large rectilinear datasets with brute-force ray tracing on a conventional (distributed) shared-memory multiprocessor machine. Rather than generate geometry representing the isosurface and render with a z-buffer, for each pixel we trace a ray through a volume and do an analytic isosurface intersection computation. Although this method has a high intrinsic computational cost, its simplicity and scalability make it ideal for large datasets on current high-end systems. Incorporating simple optimizations, such as volume bricking and a shallow hierarchy, enables interactive rendering (i.e. 10 frames per second) of the 1 GByte full resolution Visible Woman dataset on an SGI Reality Monster. The graphics capabilities of the Reality Monster are used only for display of the final color image.","AuthorNamesDeduped":"Steven G. Parker;Peter Shirley;Yarden Livnat;Charles D. Hansen;Peter-Pike J. Sloan","AuthorNames":"S. Parker;P. Shirley;Y. Livnat;C. Hansen;P.-P. Sloan","AuthorAffiliation":"Dept. of Comput. Sci., Utah Univ., Salt Lake City, UT, USA","InternalReferences":"10.1109/VISUAL.1997.663888;10.1109/VISUAL.1994.346331;10.1109/VISUAL.1994.346320;10.1109/VISUAL.1995.485154;10.1109/VISUAL.1998.745300","AuthorKeywords":"","AminerCitationCount022019":"391","XPloreCitationCount022019":"94","PubsCited":"17","Award":"BP"}},{"name":"Qingmin Shi","value":5,"numPapers":11,"cluster":"4","visible":1,"index":369,"weight":3,"x":233.610232487858,"y":401.60739811801983,"px":239.29643536413943,"py":403.75724278507187,"node":{"Conference":"Vis","Year":"1998","Title":"Interactive ray tracing for isosurface rendering","DOI":"10.1109/VISUAL.1998.745713","Link":"http://dx.doi.org/10.1109/VISUAL.1998.745713","FirstPage":"233","LastPage":"238","PaperType":"C","Abstract":"We show that it is feasible to perform interactive isosurfacing of very large rectilinear datasets with brute-force ray tracing on a conventional (distributed) shared-memory multiprocessor machine. Rather than generate geometry representing the isosurface and render with a z-buffer, for each pixel we trace a ray through a volume and do an analytic isosurface intersection computation. Although this method has a high intrinsic computational cost, its simplicity and scalability make it ideal for large datasets on current high-end systems. Incorporating simple optimizations, such as volume bricking and a shallow hierarchy, enables interactive rendering (i.e. 10 frames per second) of the 1 GByte full resolution Visible Woman dataset on an SGI Reality Monster. The graphics capabilities of the Reality Monster are used only for display of the final color image.","AuthorNamesDeduped":"Steven G. Parker;Peter Shirley;Yarden Livnat;Charles D. Hansen;Peter-Pike J. Sloan","AuthorNames":"S. Parker;P. Shirley;Y. Livnat;C. Hansen;P.-P. Sloan","AuthorAffiliation":"Dept. of Comput. Sci., Utah Univ., Salt Lake City, UT, USA","InternalReferences":"10.1109/VISUAL.1997.663888;10.1109/VISUAL.1994.346331;10.1109/VISUAL.1994.346320;10.1109/VISUAL.1995.485154;10.1109/VISUAL.1998.745300","AuthorKeywords":"","AminerCitationCount022019":"391","XPloreCitationCount022019":"94","PubsCited":"17","Award":"BP"}},{"name":"Joseph JáJá","value":21,"numPapers":25,"cluster":"4","visible":1,"index":370,"weight":3,"x":234.4434333441958,"y":372.069263769071,"px":241.7173188621904,"py":373.28025465969665,"node":{"Conference":"Vis","Year":"1998","Title":"Interactive ray tracing for isosurface rendering","DOI":"10.1109/VISUAL.1998.745713","Link":"http://dx.doi.org/10.1109/VISUAL.1998.745713","FirstPage":"233","LastPage":"238","PaperType":"C","Abstract":"We show that it is feasible to perform interactive isosurfacing of very large rectilinear datasets with brute-force ray tracing on a conventional (distributed) shared-memory multiprocessor machine. Rather than generate geometry representing the isosurface and render with a z-buffer, for each pixel we trace a ray through a volume and do an analytic isosurface intersection computation. Although this method has a high intrinsic computational cost, its simplicity and scalability make it ideal for large datasets on current high-end systems. Incorporating simple optimizations, such as volume bricking and a shallow hierarchy, enables interactive rendering (i.e. 10 frames per second) of the 1 GByte full resolution Visible Woman dataset on an SGI Reality Monster. The graphics capabilities of the Reality Monster are used only for display of the final color image.","AuthorNamesDeduped":"Steven G. Parker;Peter Shirley;Yarden Livnat;Charles D. Hansen;Peter-Pike J. Sloan","AuthorNames":"S. Parker;P. Shirley;Y. Livnat;C. Hansen;P.-P. Sloan","AuthorAffiliation":"Dept. of Comput. Sci., Utah Univ., Salt Lake City, UT, USA","InternalReferences":"10.1109/VISUAL.1997.663888;10.1109/VISUAL.1994.346331;10.1109/VISUAL.1994.346320;10.1109/VISUAL.1995.485154;10.1109/VISUAL.1998.745300","AuthorKeywords":"","AminerCitationCount022019":"391","XPloreCitationCount022019":"94","PubsCited":"17","Award":"BP"}},{"name":"James P. Ahrens","value":76,"numPapers":43,"cluster":"3","visible":1,"index":371,"weight":3,"x":366.20578751442577,"y":524.4578136508836,"px":375.877287220696,"py":520.3385216712144,"node":{"Conference":"Vis","Year":"1994","Title":"Volume rendering of pool fire data","DOI":"10.1109/VISUAL.1994.346291","Link":"http://dx.doi.org/10.1109/VISUAL.1994.346291","FirstPage":"382","LastPage":"385, C45","PaperType":"C","Abstract":"We describe how techniques from computer graphics are used to visualize pool fire data and compute radiative effects from pool fires. The basic tools are ray casting and accurate line integration using the RADCAL program. Example images in the visible and infrared band are shown which are given of irradiation calculations and novel methods to visualize the results of irradiation calculations.<<ETX>>","AuthorNamesDeduped":"Holly E. Rushmeier;Anthony Hamins;Mun-Young Choi","AuthorNames":"H.E. Rushmeier;A. Hamins;M.-Y. Choi","AuthorAffiliation":"Nat. Inst. of Stand. & Technol., Gaithersburg, MD, USA;Nat. Inst. of Stand. & Technol., Gaithersburg, MD, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"33","XPloreCitationCount022019":"0","PubsCited":"5","Award":""}},{"name":"Markus Glatter","value":27,"numPapers":15,"cluster":"4","visible":1,"index":372,"weight":1,"x":13.741711901719016,"y":536.1328101976228,"px":19.330733534932705,"py":534.2361530551597,"node":{"Conference":"Vis","Year":"2005","Title":"Query-driven visualization of large data sets","DOI":"10.1109/VISUAL.2005.1532792","Link":"http://dx.doi.org/10.1109/VISUAL.2005.1532792","FirstPage":"167","LastPage":"174","PaperType":"C","Abstract":"We present a practical and general-purpose approach to large and complex visual data analysis where visualization processing, rendering and subsequent human interpretation is constrained to the subset of data deemed interesting by the user. In many scientific data analysis applications, \"interesting\" data can be defined by compound Boolean range queries of the form (temperature>1000) AND (70<pressure<90). As data sizes grow larger, a central challenge is to answer such queries as efficiently as possible. Prior work in the visualization community has focused on answering range queries for scalar fields within the context of accelerating the search phase of isosurface algorithms. In contrast, our work describes an approach that leverages state-of-the-art indexing technology from the scientific data management community called \"bitmap indexing\". Our implementation, which we call \"DEX\" (short for dextrous data explorer), uses bitmap indexing to efficiently answer multivariate, multidimensional data queries to provide input to a visualization pipeline. We present an analysis overview and benchmark results that show bitmap indexing offers significant storage and performance improvements when compared to previous approaches for accelerating the search phase of isosurface algorithms. More importantly, since bitmap indexing supports complex multidimensional, multivariate range queries, it is more generally applicable to scientific data visualization and analysis problems. In addition to benchmark performance and analysis, we apply DEX to a typical scientific visualization problem encountered in combustion simulation data analysis.","AuthorNamesDeduped":"Kurt Stockinger;John Shalf;Kesheng Wu;E. Wes Bethel","AuthorNames":"K. Stockinger;J. Shalf;K. Wu;E.W. Bethel","AuthorAffiliation":"Computational Res. Div., Lawrence Berkeley Lab., CA, USA;Computational Res. Div., Lawrence Berkeley Lab., CA, USA;Computational Res. Div., Lawrence Berkeley Lab., CA, USA;Computational Res. Div., Lawrence Berkeley Lab., CA, USA","InternalReferences":"10.1109/VISUAL.1999.809864;10.1109/VISUAL.2004.95;10.1109/VISUAL.1998.745299;10.1109/VISUAL.1996.568121","AuthorKeywords":"query-driven visualization, visual analytics, bitmap index, multivariate visualization, large data visualization, data analysis, scientific data management","AminerCitationCount022019":"114","XPloreCitationCount022019":"20","PubsCited":"37","Award":""}},{"name":"Ji Soo Yi","value":297,"numPapers":67,"cluster":"0","visible":1,"index":373,"weight":6,"x":519.7105543189685,"y":125.20379335940036,"px":520.7487795597145,"py":132.1742114733528,"node":{"Conference":"Vis","Year":"1994","Title":"XmdvTool: integrating multiple methods for visualizing multivariate data","DOI":"10.1109/VISUAL.1994.346302","Link":"http://dx.doi.org/10.1109/VISUAL.1994.346302","FirstPage":"326","LastPage":"333","PaperType":"C","Abstract":"Much of the attention in visualization research has focussed on data rooted in physical phenomena, which is generally limited to three or four dimensions. However, many sources of data do not share this dimensional restriction. A critical problem in the analysis of such data is providing researchers with tools to gain insights into characteristics of the data, such as anomalies and patterns. Several visualization methods have been developed to address this problem, and each has its strengths and weaknesses. This paper describes a system named XmdvTool which integrates several of the most common methods for projecting multivariate data onto a two-dimensional screen. This integration allows users to explore their data in a variety of formats with ease. A view enhancement mechanism called an N-dimensional brush is also described. The brush allows users to gain insights into spatial relationships over N dimensions by highlighting data which falls within a user-specified subspace.<<ETX>>","AuthorNamesDeduped":"Matthew O. Ward","AuthorNames":"M.O. Ward","AuthorAffiliation":"Dept. of Comput. Sci., Worcester Polytech. Inst., MA, USA","InternalReferences":"10.1109/VISUAL.1990.146386;10.1109/VISUAL.1990.146387;10.1109/VISUAL.1990.146402","AuthorKeywords":"","AminerCitationCount022019":"541","XPloreCitationCount022019":"151","PubsCited":"16","Award":""}},{"name":"Youn ah Kang","value":320,"numPapers":34,"cluster":"0","visible":1,"index":374,"weight":17,"x":570.7278477835896,"y":186.05101168439515,"px":571.5611585605201,"py":191.54013010868343,"node":{"Conference":"Vis","Year":"1994","Title":"XmdvTool: integrating multiple methods for visualizing multivariate data","DOI":"10.1109/VISUAL.1994.346302","Link":"http://dx.doi.org/10.1109/VISUAL.1994.346302","FirstPage":"326","LastPage":"333","PaperType":"C","Abstract":"Much of the attention in visualization research has focussed on data rooted in physical phenomena, which is generally limited to three or four dimensions. However, many sources of data do not share this dimensional restriction. A critical problem in the analysis of such data is providing researchers with tools to gain insights into characteristics of the data, such as anomalies and patterns. Several visualization methods have been developed to address this problem, and each has its strengths and weaknesses. This paper describes a system named XmdvTool which integrates several of the most common methods for projecting multivariate data onto a two-dimensional screen. This integration allows users to explore their data in a variety of formats with ease. A view enhancement mechanism called an N-dimensional brush is also described. The brush allows users to gain insights into spatial relationships over N dimensions by highlighting data which falls within a user-specified subspace.<<ETX>>","AuthorNamesDeduped":"Matthew O. Ward","AuthorNames":"M.O. Ward","AuthorAffiliation":"Dept. of Comput. Sci., Worcester Polytech. Inst., MA, USA","InternalReferences":"10.1109/VISUAL.1990.146386;10.1109/VISUAL.1990.146387;10.1109/VISUAL.1990.146402","AuthorKeywords":"","AminerCitationCount022019":"541","XPloreCitationCount022019":"151","PubsCited":"16","Award":""}},{"name":"James R. Eagan","value":245,"numPapers":8,"cluster":"0","visible":1,"index":375,"weight":4,"x":547.4770816771759,"y":147.71517607711945,"px":550.2876947783315,"py":152.54098945182233,"node":{"Conference":"Vis","Year":"1990","Title":"A problem-oriented classification of visualization techniques","DOI":"10.1109/VISUAL.1990.146375","Link":"http://dx.doi.org/10.1109/VISUAL.1990.146375","FirstPage":"139","LastPage":"143, 469","PaperType":"C","Abstract":"Progress in scientific visualization could be accelerated if workers could more readily find visualization techniques relevant to a given problem. The authors describe an approach to this problem, based on a classification of visualization techniques, that is independent of particular application domains. A user breaks up a problem into subproblems, describes these subproblems in terms of the objects to be represented and the operations to be supported by a representation, locates applicable visualization techniques in a catalog, and combines these representations into a composite representation for the original problem. The catalog and its underlying classification provide a way for workers in different application disciplines to share methods.<<ETX>>","AuthorNamesDeduped":"Stephen Wehrend;Clayton Lewis","AuthorNames":"S. Wehrend;C. Lewis","AuthorAffiliation":"Colorado Univ., Boulder, CO, USA;Colorado Univ., Boulder, CO, USA","InternalReferences":"","AuthorKeywords":"","AminerCitationCount022019":"353","XPloreCitationCount022019":"90","PubsCited":"6","Award":""}},{"name":"Christopher Collins","value":546,"numPapers":111,"cluster":"0","visible":1,"index":376,"weight":44,"x":565.1859073474618,"y":278.8857911491415,"px":565.5046331696896,"py":281.3917571824407,"node":{"Conference":"Vis","Year":"2003","Title":"Using deformations for browsing volumetric data","DOI":"10.1109/VISUAL.2003.1250400","Link":"http://dx.doi.org/10.1109/VISUAL.2003.1250400","FirstPage":"401","LastPage":"408","PaperType":"C","Abstract":"Many traditional techniques for \"looking inside\" volumetric data involve removing portions of the data, for example using various cutting tools, to reveal the interior. This allows the user to see hidden parts of the data, but has the disadvantage of removing potentially important surrounding contextual information. We explore an alternate strategy for browsing that uses deformations, where the user can cut into and open up, spread apart, or peel away parts of the volume in real time, making the interior visible while still retaining surrounding context. We consider various deformation strategies and present a number of interaction techniques based on different metaphors. Our designs pay special attention to the semantic layers that might compose a volume (e.g. the skin, muscle, bone in a scan of a human). Users can apply deformations to only selected layers, or apply a given deformation to a different degree to each layer, making browsing more flexible and facilitating the visualization of relationships between layers. Our interaction techniques are controlled with direct, \"in place\" manipulation, using pop-up menus and 3D widgets, to avoid the divided attention and awkwardness that would come with panels of traditional widgets. Initial user feedback indicates that our techniques are valuable, especially for showing portions of the data spatially situated in context with surrounding data.","AuthorNamesDeduped":"Michael J. McGuffin;Liviu Tancau;Ravin Balakrishnan","AuthorNames":"M.J. McGuffin;L. Tancau;R. Balakrishnan","AuthorAffiliation":"Dept. of Comput. Sci., Univ. of Toronto, Ont., Canada;Dept. of Comput. Sci., Univ. of Toronto, Ont., Canada;Dept. of Comput. Sci., Univ. of Toronto, Ont., Canada","InternalReferences":"","AuthorKeywords":"volumetric data, volume data, deformations, browsing, layers, interaction techniques, 3D widgets","AminerCitationCount022019":"202","XPloreCitationCount022019":"58","PubsCited":"21","Award":""}},{"name":"Florian Mansmann","value":56,"numPapers":14,"cluster":"2","visible":1,"index":377,"weight":1,"x":592.9105851224308,"y":-72.56174477124817,"px":591.9961731290485,"py":-64.85683219587965,"node":{"Conference":"InfoVis","Year":"2000","Title":"Focus+context display and navigation techniques for enhancing radial, space-filling hierarchy visualizations","DOI":"10.1109/INFVIS.2000.885091","Link":"http://dx.doi.org/10.1109/INFVIS.2000.885091","FirstPage":"57","LastPage":"65","PaperType":"C","Abstract":"Radial, space-filling visualizations can be useful for depicting information hierarchies, but they suffer from one major problem. As the hierarchy grows in size, many items become small, peripheral slices that are difficult to distinguish. We have developed three visualization/interaction techniques that provide flexible browsing of the display. The techniques allow viewers to examine the small items in detail while providing context within the entire information hierarchy. Additionally, smooth transitions between views help users maintain orientation within the complete information space.","AuthorNamesDeduped":"John T. Stasko;Eugene Zhang","AuthorNames":"J. Stasko;E. Zhang","AuthorAffiliation":"GVU Center, Georgia Inst. of Technol., Atlanta, GA, USA","InternalReferences":"10.1109/INFVIS.1999.801860;10.1109/VISUAL.1992.235217;10.1109/INFVIS.1998.729557;10.1109/VISUAL.1991.175815","AuthorKeywords":"","AminerCitationCount022019":"459","XPloreCitationCount022019":"121","PubsCited":"15","Award":""}},{"name":"George G. Robertson","value":378,"numPapers":17,"cluster":"0","visible":1,"index":378,"weight":11,"x":590.3977541268762,"y":245.2846577161769,"px":590.1638506997136,"py":249.78405777858111,"node":{"Conference":"InfoVis","Year":"1998","Title":"Multi-faceted insight through interoperable visual information analysis paradigms","DOI":"10.1109/INFVIS.1998.729570","Link":"http://dx.doi.org/10.1109/INFVIS.1998.729570","FirstPage":"137","LastPage":"144, 161","PaperType":"C","Abstract":"To gain insight and understanding of complex information collections, users must be able to visualize and explore many facets of the information. The paper presents several novel visual methods from an information analyst's perspective. The authors present a sample scenario, using the various methods to gain a variety of insights from a large information collection. They conclude that no single paradigm or visual method is sufficient for many analytical tasks. Often a suite of integrated methods offers a better analytic environment in today's emerging culture of information overload and rapidly changing issues. They also conclude that the interactions among these visual paradigms are equally as important as, if not more important than, the paradigms themselves.","AuthorNamesDeduped":"Elizabeth G. Hetzler;Paul Whitney;Lou Martucci;James J. Thomas","AuthorNames":"B. Hetzler;P. Whitney;L. Martucci;J. Thomas","AuthorAffiliation":"Pacific Northwest Lab., Richland, WA, USA","InternalReferences":"10.1109/INFVIS.1997.636789;10.1109/INFVIS.1997.636793;10.1109/INFVIS.1995.528686;10.1109/INFVIS.1996.559228;10.1109/INFVIS.1997.636761","AuthorKeywords":"information visualization, user scenario,information analysis, document analysis","AminerCitationCount022019":"108","XPloreCitationCount022019":"21","PubsCited":"19","Award":""}},{"name":"Danyel Fisher","value":306,"numPapers":40,"cluster":"0","visible":1,"index":379,"weight":7,"x":635.0484005875076,"y":251.63376379226113,"px":633.4509907617676,"py":255.31060039390206,"node":{"Conference":"InfoVis","Year":"1997","Title":"H3: laying out large directed graphs in 3D hyperbolic space","DOI":"10.1109/INFVIS.1997.636718","Link":"http://dx.doi.org/10.1109/INFVIS.1997.636718","FirstPage":"2","LastPage":"10","PaperType":"C","Abstract":"We present the H3 layout technique for drawing large directed graphs as node-link diagrams in 3D hyperbolic space. We can lay out much larger structures than can be handled using traditional techniques for drawing general graphs because we assume a hierarchical nature of the data. We impose a hierarchy on the graph by using domain-specific knowledge to find an appropriate spanning tree. Links which are not part of the spanning tree do not influence the layout but can be selectively drawn by user request. The volume of hyperbolic 3-space increases exponentially, as opposed to the familiar geometric increase of euclidean 3-space. We exploit this exponential amount of room by computing the layout according to the hyperbolic metric. We optimize the cone tree layout algorithm for 3D hyperbolic space by placing children on a hemisphere around the cone mouth instead of on its perimeter. Hyperbolic navigation affords a Focus+Context view of the structure with minimal visual clutter. We have successfully laid out hierarchies of over 20,000 nodes. Our implementation accommodates navigation through graphs too large to be rendered interactively by allowing the user to explicitly prune or expand subtrees.","AuthorNamesDeduped":"Tamara Munzner","AuthorNames":"T. Munzner","AuthorAffiliation":"Stanford Univ., CA, USA","InternalReferences":"10.1109/INFVIS.1995.528691;10.1109/INFVIS.1995.528689","AuthorKeywords":"","AminerCitationCount022019":"412","XPloreCitationCount022019":"88","PubsCited":"29","Award":""}},{"name":"Petra Isenberg","value":406,"numPapers":125,"cluster":"0","visible":1,"index":380,"weight":39,"x":586.5439631994992,"y":257.26748791996795,"px":586.5568802477079,"py":259.49322207904237,"node":{"Conference":"InfoVis","Year":"2000","Title":"Focus+context display and navigation techniques for enhancing radial, space-filling hierarchy visualizations","DOI":"10.1109/INFVIS.2000.885091","Link":"http://dx.doi.org/10.1109/INFVIS.2000.885091","FirstPage":"57","LastPage":"65","PaperType":"C","Abstract":"Radial, space-filling visualizations can be useful for depicting information hierarchies, but they suffer from one major problem. As the hierarchy grows in size, many items become small, peripheral slices that are difficult to distinguish. We have developed three visualization/interaction techniques that provide flexible browsing of the display. The techniques allow viewers to examine the small items in detail while providing context within the entire information hierarchy. Additionally, smooth transitions between views help users maintain orientation within the complete information space.","AuthorNamesDeduped":"John T. Stasko;Eugene Zhang","AuthorNames":"J. Stasko;E. Zhang","AuthorAffiliation":"GVU Center, Georgia Inst. of Technol., Atlanta, GA, USA","InternalReferences":"10.1109/INFVIS.1999.801860;10.1109/VISUAL.1992.235217;10.1109/INFVIS.1998.729557;10.1109/VISUAL.1991.175815","AuthorKeywords":"","AminerCitationCount022019":"459","XPloreCitationCount022019":"121","PubsCited":"15","Award":""}},{"name":"Jo Wood","value":358,"numPapers":114,"cluster":"0","visible":1,"index":381,"weight":26,"x":519.6602366458732,"y":207.76097761120903,"px":522.1357494085081,"py":212.293705916075,"node":{"Conference":"InfoVis","Year":"1995","Title":"Visualizing the non-visual: spatial analysis and interaction with information from text documents","DOI":"10.1109/INFVIS.1995.528686","Link":"http://dx.doi.org/10.1109/INFVIS.1995.528686","FirstPage":"51","LastPage":"58","PaperType":"C","Abstract":"The paper describes an approach to IV that involves spatializing text content for enhanced visual browsing and analysis. The application arena is large text document corpora such as digital libraries, regulations and procedures, archived reports, etc. The basic idea is that text content from these sources may be transformed to a spatial representation that preserves informational characteristics from the documents. The spatial representation may then be visually browsed and analyzed in ways that avoid language processing and that reduce the analysts mental workload. The result is an interaction with text that more nearly resembles perception and action with the natural world than with the abstractions of written language.","AuthorNamesDeduped":"James A. Wise;James J. Thomas;Kelly Pennock;D. Lantrip;M. Pottier;Anne Schur;V. Crow","AuthorNames":"J.A. Wise;J.J. Thomas;K. Pennock;D. Lantrip;M. Pottier;A. Schur;V. Crow","AuthorAffiliation":"Pacific Northwest Lab., Richland, WA, USA;Pacific Northwest Lab., Richland, WA, USA;Pacific Northwest Lab., Richland, WA, USA;Pacific Northwest Lab., Richland, WA, USA;Pacific Northwest Lab., Richland, WA, USA;Pacific Northwest Lab., Richland, WA, USA;Pacific Northwest Lab., Richland, WA, USA","InternalReferences":"10.1109/VISUAL.1993.398863","AuthorKeywords":"","AminerCitationCount022019":"796","XPloreCitationCount022019":"177","PubsCited":"11","Award":"TT"}},{"name":"Jason Dykes","value":448,"numPapers":139,"cluster":"0","visible":1,"index":382,"weight":38,"x":514.3030358932483,"y":237.93456233095506,"px":517.2466657080312,"py":242.28192202767363,"node":{"Conference":"InfoVis","Year":"1995","Title":"Visualizing the non-visual: spatial analysis and interaction with information from text documents","DOI":"10.1109/INFVIS.1995.528686","Link":"http://dx.doi.org/10.1109/INFVIS.1995.528686","FirstPage":"51","LastPage":"58","PaperType":"C","Abstract":"The paper describes an approach to IV that involves spatializing text content for enhanced visual browsing and analysis. The application arena is large text document corpora such as digital libraries, regulations and procedures, archived reports, etc. The basic idea is that text content from these sources may be transformed to a spatial representation that preserves informational characteristics from the documents. The spatial representation may then be visually browsed and analyzed in ways that avoid language processing and that reduce the analysts mental workload. The result is an interaction with text that more nearly resembles perception and action with the natural world than with the abstractions of written language.","AuthorNamesDeduped":"James A. Wise;James J. Thomas;Kelly Pennock;D. Lantrip;M. Pottier;Anne Schur;V. Crow","AuthorNames":"J.A. Wise;J.J. Thomas;K. Pennock;D. Lantrip;M. Pottier;A. Schur;V. Crow","AuthorAffiliation":"Pacific Northwest Lab., Richland, WA, USA;Pacific Northwest Lab., Richland, WA, USA;Pacific Northwest Lab., Richland, WA, USA;Pacific Northwest Lab., Richland, WA, USA;Pacific Northwest Lab., Richland, WA, USA;Pacific Northwest Lab., Richland, WA, USA;Pacific Northwest Lab., Richland, WA, USA","InternalReferences":"10.1109/VISUAL.1993.398863","AuthorKeywords":"","AminerCitationCount022019":"796","XPloreCitationCount022019":"177","PubsCited":"11","Award":"TT"}},{"name":"Aidan Slingsby","value":313,"numPapers":90,"cluster":"0","visible":1,"index":383,"weight":19,"x":484.83247981977564,"y":230.3075386752427,"px":488.541081609036,"py":234.39231801908093,"node":{"Conference":"InfoVis","Year":"1995","Title":"Visualizing the non-visual: spatial analysis and interaction with information from text documents","DOI":"10.1109/INFVIS.1995.528686","Link":"http://dx.doi.org/10.1109/INFVIS.1995.528686","FirstPage":"51","LastPage":"58","PaperType":"C","Abstract":"The paper describes an approach to IV that involves spatializing text content for enhanced visual browsing and analysis. The application arena is large text document corpora such as digital libraries, regulations and procedures, archived reports, etc. The basic idea is that text content from these sources may be transformed to a spatial representation that preserves informational characteristics from the documents. The spatial representation may then be visually browsed and analyzed in ways that avoid language processing and that reduce the analysts mental workload. The result is an interaction with text that more nearly resembles perception and action with the natural world than with the abstractions of written language.","AuthorNamesDeduped":"James A. Wise;James J. Thomas;Kelly Pennock;D. Lantrip;M. Pottier;Anne Schur;V. Crow","AuthorNames":"J.A. Wise;J.J. Thomas;K. Pennock;D. Lantrip;M. Pottier;A. Schur;V. Crow","AuthorAffiliation":"Pacific Northwest Lab., Richland, WA, USA;Pacific Northwest Lab., Richland, WA, USA;Pacific Northwest Lab., Richland, WA, USA;Pacific Northwest Lab., Richland, WA, USA;Pacific Northwest Lab., Richland, WA, USA;Pacific Northwest Lab., Richland, WA, USA;Pacific Northwest Lab., Richland, WA, USA","InternalReferences":"10.1109/VISUAL.1993.398863","AuthorKeywords":"","AminerCitationCount022019":"796","XPloreCitationCount022019":"177","PubsCited":"11","Award":"TT"}},{"name":"James Abello","value":109,"numPapers":10,"cluster":"15","visible":1,"index":384,"weight":2,"x":862.7093333029945,"y":196.5418841628826,"px":857.3679477873449,"py":199.98942388772883,"node":{"Conference":"InfoVis","Year":"1998","Title":"Dynamic aggregation with circular visual designs","DOI":"10.1109/INFVIS.1998.729557","Link":"http://dx.doi.org/10.1109/INFVIS.1998.729557","FirstPage":"35","LastPage":"43, 151","PaperType":"C","Abstract":"One very effective method for managing large data sets is aggregation or binning. We consider two aggregation methods that are tightly coupled with interactive manipulation and the visual representation of the data. Through this integration we hope to provide effective support for the aggregation process, specifically by enabling: 1) automatic aggregation, 2) continuous change and control of the aggregation level, 3) spatially based aggregates, 4) context maintenance across different aggregate levels, and 5) feedback on the level of aggregation.","AuthorNamesDeduped":"Mei C. Chuah","AuthorNames":"M.C. Chuah","AuthorAffiliation":"Sch. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA","InternalReferences":"10.1109/INFVIS.1997.636787;10.1109/VISUAL.1992.235206","AuthorKeywords":"","AminerCitationCount022019":"93","XPloreCitationCount022019":"27","PubsCited":"13","Award":""}},{"name":"Heidi Lam","value":146,"numPapers":65,"cluster":"0","visible":1,"index":385,"weight":6,"x":465.9354544767167,"y":257.4906404698742,"px":469.79158067033495,"py":260.55906672612616,"node":{"Conference":"InfoVis","Year":"2005","Title":"Low-level components of analytic activity in information visualization","DOI":"10.1109/INFVIS.2005.1532136","Link":"http://dx.doi.org/10.1109/INFVIS.2005.1532136","FirstPage":"111","LastPage":"117","PaperType":"C","Abstract":"Existing system level taxonomies of visualization tasks are geared more towards the design of particular representations than the facilitation of user analytic activity. We present a set of ten low level analysis tasks that largely capture people's activities while employing information visualization tools for understanding data. To help develop these tasks, we collected nearly 200 sample questions from students about how they would analyze five particular data sets from different domains. The questions, while not being totally comprehensive, illustrated the sheer variety of analytic questions typically posed by users when employing information visualization systems. We hope that the presented set of tasks is useful for information visualization system designers as a kind of common substrate to discuss the relative analytic capabilities of the systems. Further, the tasks may provide a form of checklist for system designers.","AuthorNamesDeduped":"Robert A. Amar;James R. Eagan;John T. Stasko","AuthorNames":"R. Amar;J. Eagan;J. Stasko","AuthorAffiliation":"Coll. of Comput., Georgia Inst. of Technol., Atlanta, GA, USA;Coll. of Comput., Georgia Inst. of Technol., Atlanta, GA, USA;Coll. of Comput., Georgia Inst. of Technol., Atlanta, GA, USA","InternalReferences":"10.1109/VISUAL.1990.146375;10.1109/INFVIS.1998.729560;10.1109/INFVIS.2000.885092;10.1109/INFVIS.2004.5;10.1109/INFVIS.2001.963289","AuthorKeywords":"Analytic activity, taxonomy, knowledge discovery, design, evaluation","AminerCitationCount022019":"409","XPloreCitationCount022019":"78","PubsCited":"15","Award":""}},{"name":"Justin Talbot","value":127,"numPapers":23,"cluster":"0","visible":1,"index":386,"weight":2,"x":483.6506289145638,"y":39.37942731931144,"px":487.4430507245483,"py":47.25924622438624,"node":{"Conference":"InfoVis","Year":"2000","Title":"Polaris: a system for query, analysis and visualization of multi-dimensional relational databases","DOI":"10.1109/INFVIS.2000.885086","Link":"http://dx.doi.org/10.1109/INFVIS.2000.885086","FirstPage":"5","LastPage":"14","PaperType":"C","Abstract":"In the last several years, large multi-dimensional databases have become common in a variety of applications such as data warehousing and scientific computing. Analysis and exploration tasks place significant demands on the interfaces to these databases. Because of the size of the data sets, dense graphical representations are more effective for exploration than spreadsheets and charts. Furthermore, because of the exploratory nature of the analysis, it must be possible for the analysts to change visualizations rapidly as they pursue a cycle involving first hypothesis and then experimentation. The authors present Polaris, an interface for exploring large multi-dimensional databases that extends the well-known Pivot Table interface. The novel features of Polaris include an interface for constructing visual specifications of table based graphical displays and the ability to generate a precise set of relational queries from the visual specifications. The visual specifications can be rapidly and incrementally developed, giving the analyst visual feedback as they construct complex queries and visualizations.","AuthorNamesDeduped":"Chris Stolte;Pat Hanrahan","AuthorNames":"C. Stolte;P. Hanrahan","AuthorAffiliation":"Dept. of Comput. Sci., Stanford Univ., CA, USA","InternalReferences":"10.1109/INFVIS.1996.559210","AuthorKeywords":"","AminerCitationCount022019":"586","XPloreCitationCount022019":"12","PubsCited":"29","Award":""}},{"name":"Fernando Vieira Paulovich","value":199,"numPapers":34,"cluster":"15","visible":1,"index":387,"weight":5,"x":936.0587130170919,"y":579.0498523243909,"px":931.0505754740885,"py":574.5522375575114,"node":{"Conference":"InfoVis","Year":"1995","Title":"Visualizing the non-visual: spatial analysis and interaction with information from text documents","DOI":"10.1109/INFVIS.1995.528686","Link":"http://dx.doi.org/10.1109/INFVIS.1995.528686","FirstPage":"51","LastPage":"58","PaperType":"C","Abstract":"The paper describes an approach to IV that involves spatializing text content for enhanced visual browsing and analysis. The application arena is large text document corpora such as digital libraries, regulations and procedures, archived reports, etc. The basic idea is that text content from these sources may be transformed to a spatial representation that preserves informational characteristics from the documents. The spatial representation may then be visually browsed and analyzed in ways that avoid language processing and that reduce the analysts mental workload. The result is an interaction with text that more nearly resembles perception and action with the natural world than with the abstractions of written language.","AuthorNamesDeduped":"James A. Wise;James J. Thomas;Kelly Pennock;D. Lantrip;M. Pottier;Anne Schur;V. Crow","AuthorNames":"J.A. Wise;J.J. Thomas;K. Pennock;D. Lantrip;M. Pottier;A. Schur;V. Crow","AuthorAffiliation":"Pacific Northwest Lab., Richland, WA, USA;Pacific Northwest Lab., Richland, WA, USA;Pacific Northwest Lab., Richland, WA, USA;Pacific Northwest Lab., Richland, WA, USA;Pacific Northwest Lab., Richland, WA, USA;Pacific Northwest Lab., Richland, WA, USA;Pacific Northwest Lab., Richland, WA, USA","InternalReferences":"10.1109/VISUAL.1993.398863","AuthorKeywords":"","AminerCitationCount022019":"796","XPloreCitationCount022019":"177","PubsCited":"11","Award":"TT"}},{"name":"Susan L. Havre","value":144,"numPapers":7,"cluster":"2","visible":1,"index":388,"weight":3,"x":805.1928011383998,"y":291.64698967647035,"px":800.5975264292534,"py":294.6362028036545,"node":{"Conference":"InfoVis","Year":"1995","Title":"Visualizing the non-visual: spatial analysis and interaction with information from text documents","DOI":"10.1109/INFVIS.1995.528686","Link":"http://dx.doi.org/10.1109/INFVIS.1995.528686","FirstPage":"51","LastPage":"58","PaperType":"C","Abstract":"The paper describes an approach to IV that involves spatializing text content for enhanced visual browsing and analysis. The application arena is large text document corpora such as digital libraries, regulations and procedures, archived reports, etc. The basic idea is that text content from these sources may be transformed to a spatial representation that preserves informational characteristics from the documents. The spatial representation may then be visually browsed and analyzed in ways that avoid language processing and that reduce the analysts mental workload. The result is an interaction with text that more nearly resembles perception and action with the natural world than with the abstractions of written language.","AuthorNamesDeduped":"James A. Wise;James J. Thomas;Kelly Pennock;D. Lantrip;M. Pottier;Anne Schur;V. Crow","AuthorNames":"J.A. Wise;J.J. Thomas;K. Pennock;D. Lantrip;M. Pottier;A. Schur;V. Crow","AuthorAffiliation":"Pacific Northwest Lab., Richland, WA, USA;Pacific Northwest Lab., Richland, WA, USA;Pacific Northwest Lab., Richland, WA, USA;Pacific Northwest Lab., Richland, WA, USA;Pacific Northwest Lab., Richland, WA, USA;Pacific Northwest Lab., Richland, WA, USA;Pacific Northwest Lab., Richland, WA, USA","InternalReferences":"10.1109/VISUAL.1993.398863","AuthorKeywords":"","AminerCitationCount022019":"796","XPloreCitationCount022019":"177","PubsCited":"11","Award":"TT"}},{"name":"Lucy T. Nowell","value":150,"numPapers":8,"cluster":"2","visible":1,"index":389,"weight":3,"x":795.1501797570575,"y":267.5602144018916,"px":790.8796444349922,"py":271.4265678206973,"node":{"Conference":"InfoVis","Year":"1995","Title":"Visualizing the non-visual: spatial analysis and interaction with information from text documents","DOI":"10.1109/INFVIS.1995.528686","Link":"http://dx.doi.org/10.1109/INFVIS.1995.528686","FirstPage":"51","LastPage":"58","PaperType":"C","Abstract":"The paper describes an approach to IV that involves spatializing text content for enhanced visual browsing and analysis. The application arena is large text document corpora such as digital libraries, regulations and procedures, archived reports, etc. The basic idea is that text content from these sources may be transformed to a spatial representation that preserves informational characteristics from the documents. The spatial representation may then be visually browsed and analyzed in ways that avoid language processing and that reduce the analysts mental workload. The result is an interaction with text that more nearly resembles perception and action with the natural world than with the abstractions of written language.","AuthorNamesDeduped":"James A. Wise;James J. Thomas;Kelly Pennock;D. Lantrip;M. Pottier;Anne Schur;V. Crow","AuthorNames":"J.A. Wise;J.J. Thomas;K. Pennock;D. Lantrip;M. Pottier;A. Schur;V. Crow","AuthorAffiliation":"Pacific Northwest Lab., Richland, WA, USA;Pacific Northwest Lab., Richland, WA, USA;Pacific Northwest Lab., Richland, WA, USA;Pacific Northwest Lab., Richland, WA, USA;Pacific Northwest Lab., Richland, WA, USA;Pacific Northwest Lab., Richland, WA, USA;Pacific Northwest Lab., Richland, WA, USA","InternalReferences":"10.1109/VISUAL.1993.398863","AuthorKeywords":"","AminerCitationCount022019":"796","XPloreCitationCount022019":"177","PubsCited":"11","Award":"TT"}},{"name":"Niklas Elmqvist","value":406,"numPapers":197,"cluster":"0","visible":1,"index":390,"weight":40,"x":561.5826021276532,"y":307.3554129803623,"px":561.577614243998,"py":311.57316056877426,"node":{"Conference":"InfoVis","Year":"1998","Title":"Algorithm visualization for distributed environments","DOI":"10.1109/INFVIS.1998.729561","Link":"http://dx.doi.org/10.1109/INFVIS.1998.729561","FirstPage":"71","LastPage":"78, 154","PaperType":"C","Abstract":"The paper investigates the visualization of distributed algorithms. We present a conceptual model and a system, VADE, that realizes this model. Since in asynchronous distributed systems there is no way of knowing (let alone, visualizing) the \"real\" execution, we show how to generate a visualization which is consistent with the execution of the distributed algorithm. We also present the design and implementation of our system. VADE is designed so that the algorithm runs on the server's machines while the visualization is executed on a Web page on the client's machine. Programmers can write animations quickly and easily with the assistance of VADE's libraries.","AuthorNamesDeduped":"Yoram Moses;Zvi Polunsky;Ayellet Tal;Leonid Ulitsky","AuthorNames":"Y. Moses;Z. Polunsky;A. Tal;L. Ulitsky","AuthorAffiliation":"Dept. of Electr. Eng., Technion-Israel Inst. of Technol., Haifa, Israel","InternalReferences":"10.1109/VISUAL.1997.663920","AuthorKeywords":"","AminerCitationCount022019":"","XPloreCitationCount022019":"7","PubsCited":"27","Award":""}},{"name":"Philippas Tsigas","value":53,"numPapers":16,"cluster":"2","visible":1,"index":391,"weight":1,"x":858.9906960722371,"y":579.8807919298463,"px":851.9662518559282,"py":580.3730959014658,"node":{"Conference":"InfoVis","Year":"1998","Title":"Algorithm visualization for distributed environments","DOI":"10.1109/INFVIS.1998.729561","Link":"http://dx.doi.org/10.1109/INFVIS.1998.729561","FirstPage":"71","LastPage":"78, 154","PaperType":"C","Abstract":"The paper investigates the visualization of distributed algorithms. We present a conceptual model and a system, VADE, that realizes this model. Since in asynchronous distributed systems there is no way of knowing (let alone, visualizing) the \"real\" execution, we show how to generate a visualization which is consistent with the execution of the distributed algorithm. We also present the design and implementation of our system. VADE is designed so that the algorithm runs on the server's machines while the visualization is executed on a Web page on the client's machine. Programmers can write animations quickly and easily with the assistance of VADE's libraries.","AuthorNamesDeduped":"Yoram Moses;Zvi Polunsky;Ayellet Tal;Leonid Ulitsky","AuthorNames":"Y. Moses;Z. Polunsky;A. Tal;L. Ulitsky","AuthorAffiliation":"Dept. of Electr. Eng., Technion-Israel Inst. of Technol., Haifa, Israel","InternalReferences":"10.1109/VISUAL.1997.663920","AuthorKeywords":"","AminerCitationCount022019":"","XPloreCitationCount022019":"7","PubsCited":"27","Award":""}},{"name":"Anders Ynnerman","value":171,"numPapers":60,"cluster":"8","visible":1,"index":392,"weight":11,"x":278.03524670004475,"y":268.6941035416418,"px":283.7855308154404,"py":272.76980475488614,"node":{"Conference":"Vis","Year":"2000","Title":"Interactive visualization of particle-in-cell simulations","DOI":"10.1109/VISUAL.2000.885734","Link":"http://dx.doi.org/10.1109/VISUAL.2000.885734","FirstPage":"469","LastPage":"472","PaperType":"C","Abstract
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment