DSpace Kolekce:http://hdl.handle.net/11025/65822020-01-28T00:00:09Z2020-01-28T00:00:09ZA Generalized Mandelbrot Set Based On Distance RatioZhang, XizheLv, TianyangWang, Zhengxuanhttp://hdl.handle.net/11025/66132019-05-22T06:51:53Z2006-01-01T00:00:00ZNázev: A Generalized Mandelbrot Set Based On Distance Ratio
Autoři: Zhang, Xizhe; Lv, Tianyang; Wang, Zhengxuan
Editoři: Jorge, Joaquim; Skala, Václav
Abstrakt: The iteration of complex function can generate beautiful fractal images. This paper presents a novel method based on the
iteration of the distance ratio with two points, which generates a generalized Mandelbrot set according to distance ratio
convergence times. This paper states the definition of distance ratio and its iteration. Then taking the complex function
f(z)=zα+c for example, it discusses the visual structure of generalized Mandelbrot with various exponent and comparing it
with Mandelbrot set generated by escape time algorithm. When exponent α>1, the outer border of DRM is same as
Mandelbrot set, but has complex inner structure; when α<0, the inner border of DRM is same as Mandelbrot set, DRM is the
“outer” region and complement set of Mandelbrot set, the two sets cover the whole complex plane.2006-01-01T00:00:00ZZhang, XizheLv, TianyangWang, ZhengxuanBending models for thin flexible objectsWacker, M.Thomaszewski, B.http://hdl.handle.net/11025/66122019-05-22T06:51:53Z2006-01-01T00:00:00ZNázev: Bending models for thin flexible objects
Autoři: Wacker, M.; Thomaszewski, B.
Editoři: Jorge, Joaquim; Skala, Václav
Abstrakt: Textiles usually exhibit much larger resistance to in-plane deformation than to bending deformation.
However, the latter essentially determines the formation of folds and wrinkles which in turn govern the
overall appearance of the cloth. The resulting numerical problem is inherently stiff and hence susceptible to
instability. This overview is devoted to a closer investigation of bending deformation. Approaches known
from the field of engineering can describe the problem of bending in a physically accurate way. However,
the nature of the governing equations is such that they cannot be discretised with the standard methods
currently used in cloth simulation. Since curvature is a central variable, we introduce related concepts from
differential geometry and describe the transition to the discrete setting. Different approaches are discussed
and demands on an approach for correctly modelling the bending behaviour of cloth are formulated.2006-01-01T00:00:00ZWacker, M.Thomaszewski, B.An Approach to Convert 4D Geometry into a 4D CT ScanVillard, P. F.Beuve, M.Shariat, B.http://hdl.handle.net/11025/66112019-05-22T06:51:53Z2006-01-01T00:00:00ZNázev: An Approach to Convert 4D Geometry into a 4D CT Scan
Autoři: Villard, P. F.; Beuve, M.; Shariat, B.
Editoři: Jorge, Joaquim; Skala, Václav
Abstrakt: We present here an approach to convert the geometrical information produced by a physical simulation
of soft-organ motion into a 3D+time CT scan. The paper describes how we calculate matter density
at mesh points and how we produce dynamic 3D CT scan using the convolution parameters of medical
scanners. The aim of this work is to provide physicians with standard images useful to appreciate organ
motions and to incorporate them into a treatment planning platform.2006-01-01T00:00:00ZVillard, P. F.Beuve, M.Shariat, B.A Mesh Data Structure for Rendering and SubdivisionTobler, Robert F.Maierhofer, Stefanhttp://hdl.handle.net/11025/66102019-05-22T06:51:53Z2006-01-01T00:00:00ZNázev: A Mesh Data Structure for Rendering and Subdivision
Autoři: Tobler, Robert F.; Maierhofer, Stefan
Editoři: Jorge, Joaquim; Skala, Václav
Abstrakt: Generating subdivision surfaces from polygonal meshes requires the complete topological information of the
original mesh, in order to find the neighbouring faces, and vertices used in the subdivision computations.
Normally, winged-edge type data-structures are used to maintain such information about a mesh. For rendering
meshes, most of the topological information is irrelevant, and winged-edge type data-structures are inefficient
due to their extensive use of dynamical data structures. A standard approach is the extraction of a rendering mesh
from the winged-edge type data structure, thereby increasing the memory footprint significantly.
We introduce a mesh data-structure that is efficient for both tasks: creating subdivision surfaces as well as fast
rendering. The new data structure maintains full topological information in an efficient and easily accessible
manner, with all information necessary for rendering optimally suited for current graphics hardware. This is
possible by disallowing modifications of the mesh, once the topological information has been created. In order to
avoid any inconveniences due to this limitation, we provide an API that makes it possible to stitch multiple
meshes and access the topology of the resulting combined mesh as if it were a single mesh. This API makes the
new mesh data structure also ideally suited for generating complex geometry using mesh-based L-systems.2006-01-01T00:00:00ZTobler, Robert F.Maierhofer, Stefan