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

Self-Assembly of Colloidal Particles with Controlled Interaction Forces / 相互作用力に基づくコロイド自己集積現象の理解

Arai, Nozomi 23 March 2021 (has links)
京都大学 / 新制・課程博士 / 博士(工学) / 甲第23232号 / 工博第4876号 / 新制||工||1761(附属図書館) / 京都大学大学院工学研究科化学工学専攻 / (主査)教授 宮原 稔, 教授 松坂 修二, 教授 山本 量一 / 学位規則第4条第1項該当 / Doctor of Philosophy (Engineering) / Kyoto University / DGAM
2

Interactive Glyph Placement for Tensor Fields: Tracking Lines in Higher Order Tensor Fields

Hlawitschka, Mario, Scheuermann, Gerik, Hamann, Bernd 04 February 2019 (has links)
Visualization of glyphs has a long history in medical imaging but gains much more power when the glyphs are properly placed to fill the screen. Glyph packing is often performed via an iterative approach to improve the location of glyphs. We present an alternative implementation of glyph packing based on a Delaunay triangulation to speed up the clustering process and reduce costs for neighborhood searches. Our approach does not require a re–computation of acceleration structures when a plane is moved through a volume, which can be done interactively. We provide two methods for initial placement of glyphs to improve the convergence of our algorithm for glyphs larger and glyphs smaller than the data set’s voxel size. The main contribution of this paper is a novel approach to glyph packing that supports simpler parameterization and can be used easily for highly efficient interactive data exploration, in contrast to previous methods.

Page generated in 0.3076 seconds