Michael Guthe | University Of Bayreuth, Germany (original) (raw)

Papers by Michael Guthe

Journal of Parallel and Distributed Computing, 2013

Cells Tissues Organs, 2013

A technique for embedding human undecalcified tooth specimens in Technovit® 9100 was developed, w... more A technique for embedding human undecalcified tooth specimens in Technovit® 9100 was developed, which permits immunohistological evaluation of pulp tissue in serial ground sections. Human molars were divided into 14-18 sections of about 23 µm thickness. Immunohistological double staining for S-100 and CD34 revealed unique associations of myelinated nerve fibre bundles with arterioles, which continued through the entire tooth pulp. These arterioles were not only accompanied by, but partially or totally enveloped in longitudinally orientated myelinated nerve fibre bundles. We speculate that this unique arrangement may mechanically support the arterioles and alleviate detection or regulation of their contraction state by sensory nerve cells.

Recent progress in the measurement of surface reflectance has created a demand for non-parametric... more Recent progress in the measurement of surface reflectance has created a demand for non-parametric appearance representations that are accurate, compact, and easy to use for rendering. Another crucial goal, which has so far received little attention, is editability: for practical use, we ...

10th Pacific Conference on Computer Graphics and Applications, 2002. Proceedings., 2000

Hierarchical levels of details (HLODs) have proven to be an ecient way to visualize complex envir... more Hierarchical levels of details (HLODs) have proven to be an ecient way to visualize complex environments and models even in an out-of-core system. Large objects are partitioned into a spatial hierarchy and on each node a level of detail is generated for ecient view-dependent rendering. To ensure correct matching between adjacent nodes in the hierarchy care has to be taken

in the hierarchy care has to be taken to prevent cracks along the cuts. This either leads to seve... more in the hierarchy care has to be taken to prevent cracks along the cuts. This either leads to severe simplification constraints at the cuts and thus to a significantly higher number of triangles or the need for a costly runtime stitching of these nodes. In this paper we present an out-of-core visualization algorithm that overcomes this problem by filling the

Fourth International Conference on Virtual Reality and Its Applications in Industry, 2004

Real-time high quality rendering of complex models remains a big challenge. Simply splitting the ... more Real-time high quality rendering of complex models remains a big challenge. Simply splitting the models into several parts which can be simplified and rendered independently introduces disturbing gaps along the common borders. Recent approaches for viewdependent rendering of huge models either neglect the artifacts introduced by the gaps or try to maintain the connectivity of the models. Unfortunately, in the second case the computational complexity and storage requirements of the algorithms are tremendous.

Proceedings of the 5th international conference on Computer graphics, virtual reality, visualisation and interaction in Africa - AFRIGRAPH '07, 2007

... Nicolas Menzel∗ Michael Guthe Universit-at Marburg, FB 12 ... After reconstruction that can ... more ... Nicolas Menzel∗ Michael Guthe Universit-at Marburg, FB 12 ... After reconstruction that can be performed in real-time, any post production effect such as tone mapping or bloom can be applied ... Journal of Research of the National Bureau of Standards, 45(4):255282, 1950. ...

The complexity of polygonal models still grows faster than the ability of the graphics hardware t... more The complexity of polygonal models still grows faster than the ability of the graphics hardware to render them in real-time. A common way to deal with such models is to use multiple levels of detail (LODs). These can be static with the advantage that the simplification can be performed without regarding real-time constraints and the rendering algorithm simply chooses which LODs to render at runtime. Static LODs however suffer from sudden mesh transitions (popping artifacts) when the levels are too different. Dynamic or view-dependent LODs solve this problem by allowing for a continuous and smooth refinement. Unfortunately, they become computationally too expensive when the number of vertices is high, because refinement operations have to be computed for every vertex. In this paper, we address this problem by introducing a compact data structure for progressive meshes optimized for parallel processing and low memory consumption on the GPU. We also present an efficient LOD adaption al...

The Visual Computer, 2005