Procedural content generation inom spel refererar till algoritmiskt, procedurellt skapande av digitalt innehåll i syfte att automatisera och minska mängden arbete för designers och grafiker. Ett område procedural content generation används för inom spel är dungeon generering. Målet för detta arbete var att utforska en 2D algoritm som används i spelet TinyKeep för just generering av dungeons och se hur den algoritmen kunde prestera om den modifierades för generering i en 3D rymd. Den modifierade algoritmen utvärderades baserat på attributen variation, justerbarhet, pålitlighet samt tidseffektivitet. Resultatet visade visade att det är möjligt att använda algoritmen i spelet TinyKeep i en 3D-rymd med godtagbart prestationsresultat. Som värst visade den modifierade algoritmen på en viss svaghet angående genereringstid vid en större tom rymd med större antal rum hos en dungeon. För framtida arbete vore det intressant att dela upp av delar av den modifierade algoritmen på separata trådar. / <p>Det finns övrigt digitalt material (t.ex. film-, bild- eller ljudfiler) eller modeller/artefakter tillhörande examensarbetet som ska skickas till arkivet.</p>

Practical laser triangulation sessions were performed for each measurement object to obtain ground truth data. Three methods for laser line simulations were implemented: reshaping the built-in light sources of Blender, creating a texture projector and approximating a Gaussian beam as a light emitting volume. The camera simulation was based on the default camera of Blender together with settings from the physical camera. Three approaches for creating wood material were tested: procedural texturing, using microscopic image textures to create 3D-material and UV-mapping high resolution photograph onto the geometry. The blister package was simulated with one material for the pills and another for the semi-transparent plastic packaging. A stand-alone Python script was implemented to simulate anisotropic/directed subsurface scattering of a point laser in wood. This algorithm included an approach for creating vector fields that represented subsurface scattering directions. Three post-processing scripts were produced to simulate sensor noise, blurring/blooming of the laser line and lastly to apply simulated speckle patterns to the laser lines. Sensor images were simulated by rendering a laser line projected onto a measurement object. The sensor images were post-processed with the three mentioned scripts. Thousands of sensor images were simulated, with a small displacement of the measurement object between each image. After post-processing, these images were combined to a single scattering image. SICK IVP AB provided the algorithms needed for laser centre extraction as well as for scattering image creation. / <p>Examensarbetet är utfört vid Institutionen för teknik och naturvetenskap (ITN) vid Tekniska fakulteten, Linköpings universitet</p>

This thesis deals with the issue of wireless sensor networks and communication protocols. Is explained of what the network is composed, what standards are used and in what sectors are most often used. The main scope of work is to introduce with the localization algorithms using in WSN. Algorithms are clearly divided into groups according to the methods used. In work is describes the structure used simulation tools J-Sim, for creating a wireless sensor network. To create network will be then applied different localization algorithms, which must first be implemented in a simulator using Java code. All generated classes and the algorithms are detailed described in the work. Results from simulations are detailed and graphically displays for individual localization algorithms.

The general aim of my master´s thesis is to study the actual principles of 3D scanning, the anatomy of human teeth, use of 3D scanning in dentistry and other medical fields. Another part of this thesis is about software and hardware design of 3D scanning system, which enable us to scan dental casts. This design is using webcam, projector and turntable. The principle of scanning is based on the activ triangulation. The output of 3D scanner is a horde of spots, which are used for reconstruction of a surface. The reconstructed surface is finally saved as .stl format.

Many architecure, medical and engineering applications need a spacial support for various numerical computations (i.e. FEM simulations). Tetrahedral meshes are one of perspective spatial representations for them. In this thesis, several possibilities of effective tetrahedral mesh representation for its generating and processing are described. A computer library for the mesh processing is proposed which can be characterized by memory  efficient imposition of the mesh while preserving the ability to apply topological and geometric algorithms effectively. The library is implemented in C++ language using templates. Time and space complexity of typical mesh operations is compared with CGAL library and according to measurements the proposed library has lower memory requirements than CGAL.

This master thesis is focused on parametrization of image point neighborhood. Some methods for point localization and point descriptors are described and summarized. Gabor filter is described in detail. The practical part of thesis is chiefly concerned with particle filter tracking system. The weight of each particle is determined by the Gabor filter.

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.

Analýza obsahu webových diskuzních fór jako zdroj dat pro výzkum nových trendů v užívání psychoaktivních látek ve srovnání s daty získanými od jiných populací Mgr. Eva Drápalová ABSTRACT Background: One of the most significant new trends in substance abuse today is an unprecedented rate of new psychoactive substances (NPS) emergence on a global drug market. While collection of scientific data about the effects and risks of numerous NPS is a timely process, the substantial amount of information about the very same substances is being exchanged on drug discussion forums, creating a pool of data with a potential for research of the NPS trend. Aims: This dissertation aims to evaluate a potential of internet discussion forum content analysis methods by (i) describing and comparing the characteristics of discussion forum visitors to NPS users who do not visit such forums; and subsequently by comparing the internet forum content analysis results describing (ii) a prevalence of NPS use, (iii) effects and context of NPS use and (iv) discussed internet retailers selling NPS with data retrieved by other methods. Methods: Differences between two groups of internet survey respondents were analyzed using Pearson Chi-square and Student's t-test to address the first aim of this dissertation. Furthermore the results of both...

This thesis deals with k-irreducible triangulations of closed, compact 2-manifolds without boundary. A triangulation is k-irreducible, if all its closed cycles of length less than k are nullhomotopic and no edge can be contracted without losing this property. k-irreducibility is a generalization of the well-known concept of irreducibility, and can be regarded as a measure of how closely the triangulation approximates a smooth version of the underlying surface. Research follows three main questions: What are lower and upper bounds for the minimum and maximum size of a k-irreducible triangulation? What are the smallest and biggest explicitly constructible examples? Can one achieve complete classifications for specific 2-manifolds, and fixed k?

<p>U prvoj glavi dat je prikaz osnovnih pojmova koji se koriste u tezi, sa naglaskom na osnovne pojmove teorije grafova. U drugoj glavi daju se grafovski dokazi nekih geometrijskih problema. Na primer, dajemo dokaz poznate teoreme Silvestra. iz Kombinatorne geometrije, koristeći grafove. Treće poglavlje sadrži neke geometrijske dokaze u grafovima. Na primer, poznatu Turanovu teoremu, Pikovu teoremu i drugo. U četvrtom poglavlju dajemo metodičku transformaciju prethodnih problema. Neki od problema razloženi su na delove koji se mogu prezentirati od osnovne &scaron;kole do poslediplomskih studija. Peto poglavlje sadrži komentare prethodnog, kao i preporuku UNESCO-a iz 1992. godine o obrazovanju učenika u novom milenijumu.</p> / <p>Chapter 1 contains a shoot review of the basic notions which are used in the thesis with emphasis on the basic notions of graph theory. In Chapter&nbsp; 2we present graph proofs of some geometrical problems. For example, we present some proofs of the well known theorem of Sylvester, from Combinatorial geometry, using graph methods. In Chapter 3 we present some proofs in graphs which use geometry. For example, famous Turan&rsquo;s theorem, Pick&rsquo;s theorem and some others. Chapter 4 contains methodology transformations i.e. we apply the results from the previous chapters to the situations in the clossroom. In Chapter 5 we have some comments of UNESCO, from 1992, on education of children.</p>