Path Manipulation Strategies for Rendering Dynamic

Total Page:16

File Type:pdf, Size:1020Kb

Path Manipulation Strategies for Rendering Dynamic PATH MANIPULATION STRATEGIES FOR RENDERING DYNAMIC ENVIRONMENTS Adina Andreea Bizdideanu DOCTOR OF ENGINEERING IN DIGITAL MEDIA Centre for Digital Entertainment Bournemouth University October 2018 II This copy of the thesis has been supplied on condition that anyone who consults it is understood to recognise that its copyright rests with its author and due acknowledgement must always be made of the use of any material contained in, or derived from, this thesis. III IV Abstract The current work introduces path manipulation as a tool that extends bidirectional path tracing to reuse paths in the temporal domain. Defined as an apparatus of sampling and reuse strategies, path manipulation reconstructs the subpaths that compose the light transport paths and addresses the restriction of static geometry commonly associated with Monte Carlo light transport simulations. By reconstructing and reusing subpaths, the path manipulation algorithm obviates the regeneration of the entire path collection, reduces the computational load of the original algorithm and supports scene dynamism. Bidirectional path tracing relies on local path sampling techniques to generate the paths of light in a synthetic environment. By using the information localized at path vertices, like the probability distribution, the sampling techniques construct paths progressively with distinct probability densities. Each probability density corresponds to a particular sampling technique, which accounts for specific illumination effects. Bidirectional path tracing uses multiple importance sampling to combine paths sampled with different techniques in low-variance estimators. The path sampling techniques and multiple importance sampling are the keys to the efficacy of bidirectional path tracing. However, the sampling techniques gained little attention beyond the generation and evaluation of paths. Bidirectional path tracing was designed for static scenes and thus it discards the generated paths immediately after the evaluation of their contributions. Limiting the lifespan of paths to a generation-evaluation cycle imposes a static use of paths and of sampling techniques. The path manipulation algorithm harnesses the potential of the sampling techniques to supplant the static manipulation of paths with a generation-evaluation-reuse cycle. An intra-subpath connectivity strategy was devised to reconnect the segregated chains of the subpaths invalidated by the scene alterations. Successful intra-subpath connections generate subpaths in multiple pieces by reusing subpath chains from prior frames. Subpaths are reconstructed generically, regardless of the subpath or scene dynamism type and without the need for predefined animation paths. The result is the extension of bidirectional path tracing to the temporal domain. V VI Contents Abstract ................................................................................................... V List of Figures ........................................................................................ XI List of Tables ........................................................................................ XV List of Symbols .................................................................................. XVII Acknowledgments .............................................................................. XXI 1 Introduction ........................................................................................ 1 1.1 Industrial context .......................................................................................... 5 1.2 Summary of contributions ............................................................................. 8 1.3 Thesis outline ................................................................................................ 9 2 Background and literature review ................................................. 11 2.1 Solid angle .................................................................................................. 11 2.2 Radiometric quantities ................................................................................ 14 2.2.1 Radiant power .............................................................................. 14 2.2.2 Irradiance, radiant exitance and radiant intensity ........................ 15 2.2.3 Radiance ....................................................................................... 15 2.3 Surface scattering ........................................................................................ 17 2.3.1 The bidirectional scattering distribution function ........................ 17 2.3.2 The bidirectional reflectance distribution function ...................... 18 2.3.3 Surface reflectance ....................................................................... 22 2.3.4 Local illumination and the rendering equation ............................ 23 2.4 Light transport ............................................................................................. 25 2.4.1 The light transport linear operators .............................................. 25 2.4.2 The surface domain formulation .................................................. 27 2.4.3 The path integral formulation ...................................................... 30 VII 2.5 Light transport algorithms .......................................................................... 36 2.5.1 Radiosity ...................................................................................... 37 2.5.2 Precomputed light transport ......................................................... 39 2.5.3 Ray tracing ................................................................................... 42 2.5.4 Monte Carlo ray tracing ............................................................... 44 2.5.5 Photon mapping ........................................................................... 57 2.5.6 Unified estimation ....................................................................... 62 2.5.7 Instant radiosity ........................................................................... 67 2.5.8 The choice of algorithmic foundation.......................................... 73 2.6 Path manipulation strategies and related work ........................................... 75 2.6.1 Improved efficiency via sampling-oriented techniques ............... 76 2.6.2 Accelerated Monte Carlo ray tracing ........................................... 80 2.6.3 Temporal coherence and path reuse ............................................ 88 2.7 Conclusions ................................................................................................. 95 3 Path manipulation strategies .......................................................... 97 3.1 Background: sampling and estimate computation ...................................... 98 3.1.1 Local path sampling techniques................................................... 98 3.1.2 Evaluation of the sample contribution ....................................... 101 3.2 Path validity and immutable contribution ................................................. 107 3.3 Invalidation and anchor computation ....................................................... 110 3.4 Reconstruction .......................................................................................... 113 3.4.1 Primary anchor reconstruction ................................................... 113 3.4.2 Two-chain reconstruction .......................................................... 116 3.4.3 Terminus anchor reconstruction ................................................ 125 3.5 High-level algorithm description .............................................................. 128 3.6 Algorithm analysis .................................................................................... 129 3.7 Conclusions ............................................................................................... 135 VIII 4 Light transport framework implementation ............................... 137 4.1 Supported Monte Carlo algorithms ........................................................... 138 4.2 The standard Monte Carlo pipeline ........................................................... 139 4.2.1 Ray generation ........................................................................... 141 4.2.2 Point sample computation .......................................................... 142 4.2.3 Path generation .......................................................................... 142 4.2.4 Visibility computation ............................................................... 146 4.2.5 Contribution evaluation ............................................................. 148 4.2.6 Image synthesis .......................................................................... 152 4.2.7 Bidirectional path tracing ........................................................... 153 4.3 The reconstruction pipeline ....................................................................... 154 4.3.1 Invalidation and anchor computation ........................................ 155 4.3.2 Intra-subpath reconnection ........................................................ 159 4.3.3 Subpath regeneration ................................................................. 161 4.3.4 Contribution re-evaluation ......................................................... 164 4.3.5 Collateral subpath identification and re-evaluation ................... 165 4.3.6 The path manipulation algorithm ............................................... 167 4.4 Conclusions ..............................................................................................
Recommended publications
  • Physically Based Rendering of Synthetic Objects in Real Environments
    Linköping studies in science and technology. Dissertation, No. 1717 PHYSICALLY BASED RENDERING OF SYNTHETIC OBJECTS IN REAL ENVIRONMENTS Joel Kronander Division of Media and Information Technology Department of Science and Technology Linköping University, SE-601 74 Norrköping, Sweden Norrköping, December 2015 Description of the cover image Rendering of virtual furniture illuminated with spatially varying real world illumination captured in a physical environment at IKEA Communications AB. The virtual scene was modeled by Sören and Per Larsson. Physically based rendering of synthetic objects in real environments Copyright © 2015 Joel Kronander (unless otherwise noted) Division of Media and Information Technology Department of Science and Technology Campus Norrköping, Linköping University SE-601 74 Norrköping, Sweden ISBN: 978-91-7685-912-4 ISSN: 0345-7524 Printed in Sweden by LiU-Tryck, Linköping, 2015 Abstract This thesis presents methods for photorealistic rendering of virtual objects so that they can be seamlessly composited into images of the real world. To generate predictable and consistent results, we study physically based methods, which simulate how light propagates in a mathematical model of the augmented scene. This computationally challenging problem demands both efficient and accurate simulation of the light transport in the scene, as well as detailed modeling of the geometries, illumination conditions, and material properties. In this thesis, we discuss and formulate the challenges inherent in these steps and present several methods to make the process more efficient. In particular, the material contained in this thesis addresses four closely related areas: HDR imaging, IBL, reflectance modeling, and efficient rendering. The thesis presents a new, statistically motivated algorithm for HDR reconstruction from raw camera data combining demosaicing, denoising, and HDR fusion in a single processing operation.
    [Show full text]
  • Production Rendering Ian Stephenson (Ed.) Production Rendering
    Production Rendering Ian Stephenson (Ed.) Production Rendering Design and Implementation 12 3 Ian Stephenson, DPhil National Centre for Computer Animation, Bournemouth, UK British Library Cataloguing in Publication Data A catalogue record for this book is available from the British Library Library of Congress Cataloging-in-Publication Data A catalog record for this book is available from the Library of Congress Apart from any fair dealing for the purposes of research or private study, or criticism or review, as permitted under the Copyright, Designs and Patents Act 1988, this publication may only be reproduced, stored or transmitted, in any form or by any means, with the prior permission in writing of the publishers, or in the case of reprographic reproduction in accordance with the terms of licences issued by the Copyright Licensing Agency. Enquiries concerning reproduction outside those terms should be sent to the publishers. ISBN 1-85233-821-0 Springer-Verlag London Berlin Heidelberg Springer ScienceϩBusiness Media springeronline.com © Springer London Limited 2005 Printed in the United States of America The use of registered names, trademarks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant laws and regulations and therefore free for general use. The publisher makes no representation, express or implied, with regard to the accuracy of the information contained in this book and cannot accept any legal responsibility or liability for any errors or omissions that may be made. Typeset by Gray Publishing, Tunbridge Wells, UK Printed and bound in the United States of America 34/3830-543210 Printed on acid-free paper SPIN 10951729 We dedicate this book to: Amanda Rochfort, Cheryl M.
    [Show full text]
  • Pencil Light Transport
    Pencil Light Transport by Mauro Steigleder A thesis presented to the University of Waterloo in fulfilment of the thesis requirement for the degree of Doctor of Philosophy in Computer Science Waterloo, Ontario, Canada, 2005 c Mauro Steigleder 2005 AUTHOR’S DECLARATION FOR ELECTRONIC SUBMISSION OF A THESIS I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, including any required final revisions, as accepted by my examiners. I understand that my thesis may be made electronically available to the public. ii Abstract Global illumination is an important area of computer graphics, having direct applications in architectural visualization, lighting design and entertainment. Indirect illumination ef- fects such as soft shadows, color bleeding, caustics and glossy reflections provide essential visual information about the interaction of different regions of the environment. Global illumination is a research area that deals with these illumination effects. Interactivity is also a desirable feature for many computer graphics applications, especially with unre- stricted manipulation of the environment and lighting conditions. However, the design of methods that can handle both unrestricted interactivity and global illumination effects on environments of reasonable complexity is still an open challenge. We present a new formulation of the light transport equation, called pencil light trans- port, that makes progress towards this goal by exploiting graphics hardware rendering features. The proposed method performs the transport of radiance over a scene using sets of pencils. A pencil object consists of a center of projection and some associated di- rectional data. We show that performing the radiance transport using pencils is suitable for implementation on current graphics hardware.
    [Show full text]
  • Production Rendering Design and Implementation
    Production Rendering Ian Stephenson (Ed.) Production Rendering Design and Implementation 12 3 Ian Stephenson, DPhil National Centre for Computer Animation, Bournemouth, UK British Library Cataloguing in Publication Data A catalogue record for this book is available from the British Library Library of Congress Cataloging-in-Publication Data A catalog record for this book is available from the Library of Congress Apart from any fair dealing for the purposes of research or private study, or criticism or review, as permitted under the Copyright, Designs and Patents Act 1988, this publication may only be reproduced, stored or transmitted, in any form or by any means, with the prior permission in writing of the publishers, or in the case of reprographic reproduction in accordance with the terms of licences issued by the Copyright Licensing Agency. Enquiries concerning reproduction outside those terms should be sent to the publishers. ISBN 1-85233-821-0 Springer-Verlag London Berlin Heidelberg Springer ScienceϩBusiness Media springeronline.com © Springer London Limited 2005 Printed in the United States of America The use of registered names, trademarks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant laws and regulations and therefore free for general use. The publisher makes no representation, express or implied, with regard to the accuracy of the information contained in this book and cannot accept any legal responsibility or liability for any errors or omissions that may be made. Typeset by Gray Publishing, Tunbridge Wells, UK Printed and bound in the United States of America 34/3830-543210 Printed on acid-free paper SPIN 10951729 We dedicate this book to: Amanda Rochfort, Cheryl M.
    [Show full text]
  • Design and Implementation of Parallel Light Transport Algorithms Based on Quasi-Monte Carlo Ray Tracing
    AGH University of Science and Technology Faculty of Electrical Engineering, Automatics, Computer Science and Electronics Institute of Computer Science Dissertation for the degree of Doctor of Philosophy in Computer Science Design and Implementation of Parallel Light Transport Algorithms based on quasi-Monte Carlo Ray Tracing mgr in_z. Micha lRadziszewski supervisor: dr hab. in_z. Krzysztof Boryczko, prof. n. AGH Krak´ow,June 2010 Abstract Photorealistic rendering is a part of computer graphics, which concentrates on creating images and animations based on 3D models. Its goal is creation of pictures that are indistinguishable from real world scenes. This work is dedicated to a particular class of photorealistic rendering algorithms { quasi-Monte Carlo ray tracing based global illumination. Global illumination is a very useful concept for creating realistically lit images of artificial 3D scenes. Using automatic and correct computation of vast diversity of optical phenomena, it enables creating a rendering software, which allows specification of what is to be rendered instead of detailed description of how to render a given scene. Its current applications range from many CAD systems to special effects in movies. In future, when computers become sufficiently powerful, real time global illumination may be the best choice for computer games and virtual reality. Currently, only Monte Carlo and quasi-Monte Carlo ray tracing based algorithms are general enough to support full global illumination. Unfortunately, they are very slow compared to other techniques, e.g. hardware accelerated rasterization. The main purpose of this thesis is an im- provement of efficiency of physically correct rendering. The thesis concentrates on enhancement of robustness of rendering algorithms, as well as parallel realization of them.
    [Show full text]
  • Phd THESIS OPTIMIZATION of INVERSE REFLECTOR DESIGN
    PhD THESIS OPTIMIZATION OF INVERSE REFLECTOR DESIGN Albert Mas Baixeras 2010 PROGRAMA DE DOCTORAT EN TECNOLOGIA Advisors: Ignacio Martín Campos Gustavo Patow Memòria presentada per optar al títol de doctor per la Universitat de Girona To Judith and Conchi. Acknowledgments First of all, I would like to thank Ignacio Martín and Gustavo Patow for advising me on this thesis. To Ignacio for giving me the opportunity of learning from him many scientific knowledge and technical skills. To Gustavo for the same reason, and in addition for his special humanity and advice, pushing me to the next step on the most difficult moments. I would also like to thank Xavier Pueyo for having motivated me to do the PhD program and giving me a lot of support for do it. I am also very grateful at people of the Geometry and Graphics Group (GGG) for the treatment that I have received during these years and the good work environment. Especially I would like to thank Carles Bosch for the countless hours spend together and his technical advice on my first thesis steps. To Marité, Gonzalo and Toni, for the support received all this time. To the younger PhD students, Isma, Fran, Tere, Oriol and Mei, for the nice and fun moments, the countless coffees and good conversations, suffering my special sense of humor. To the system managers, Robert and Marc. To the secretariat office for helping me on my classical administrative slip-ups. Finally, I would like to thank all people that have believed in me during these years and had worked hard to help me in my way.
    [Show full text]
  • Gigavoxels: Un Pipeline De Rendu Basé Voxel Pour L'exploration
    GigaVoxels : un pipeline de rendu basé Voxel pour l’exploration efficace de scènes larges et détaillées Cyril Crassin To cite this version: Cyril Crassin. GigaVoxels : un pipeline de rendu basé Voxel pour l’exploration efficace de scènes larges et détaillées. Mathématiques générales [math.GM]. Université de Grenoble, 2011. Français. NNT : 2011GRENM025. tel-00650161 HAL Id: tel-00650161 https://tel.archives-ouvertes.fr/tel-00650161 Submitted on 9 Dec 2011 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. THÈSE Pour obtenir le grade de DOCTEUR DE L’UNIVERSITÉ DE GRENOBLE Spécialité : Mathématiques Informatique Arrêté ministériel : 6 Aout 2006 Présentée par Cyril Crassin Thèse dirigée par Fabrice Neyret préparée au sein du Laboratoire Jean Kuntzmann dans l’école doctorale de Mathématiques, Sciences et Technologies de l’Information, Informatique GigaVoxels : un pipeline de rendu basé-Voxel pour l’exploration efficace de scènes larges et détaillées. Thèse soutenue publiquement le 12 Juillet 2011, devant le jury composé de : Mathias Paulin Professeur, Université
    [Show full text]
  • A Constructive Theory of Sampling for Image Synthesis Sing Reproducing
    A Constructive Theory of Sampling for Image Synthesis using Reproducing Kernel Bases Christian Lessig∗ Mathieu Desbrun Eugene Fiume DGP | University of Toronto CMS | Caltech DGP | University of Toronto QMC: RK: SNR=13.49 SNR = 15.01 L2=0.2124 L2=0.1805 Figure 1: Lighting in a Villa interior obtained from a photon map. For each shading point in the scene, the incoming light energy density is approximated using 64 hemispherical samples. The left image is computed using classical final gathering using a low-discrepancy sequence. For the right image the same samples were employed but with an integration rule derived using our theory of sampling, providing substantially reduced visual noise and lower numerical error rates. Abstract over a finite number of ray paths, photon mapping interpolates dis- crete “photons”, and Metropolis light transport mutates existing Sampling a scene by tracing rays and reconstructing an image from pointwise paths, to name a few examples. Motivated by this impor- such pointwise samples is fundamental to computer graphics. To im- tance of pointwise techniques, we present an alternative theory of prove the efficacy of these computations, we propose an alternative sampling for image synthesis. In contrast to existing approaches theory of sampling. In contrast to traditional formulations for image that rely on nonconstructive sampling operators based on Dirac synthesis, which appeal to nonconstructive Dirac deltas, our theory deltas, we instead employ constructive reproducing kernels to relate employs constructive reproducing kernels for the correspondence a continuous function to pointwise samples. This enables point- between continuous functions and pointwise samples. Conceptually, wise numerical techniques to be designed for light transport and this allows us to obtain a common mathematical formulation of devised for the finite sample counts and non-equidistant distribu- almost all existing numerical techniques for image synthesis.
    [Show full text]
  • Computer Game Graphics and Virtual Reality MSC in COMPUTER SCIENCE ATHENS UNIVERSITY of ECONOMICS and BUSINESS
    Computer Game Graphics and Virtual Reality MSC IN COMPUTER SCIENCE ATHENS UNIVERSITY OF ECONOMICS AND BUSINESS A New Perspective This advanced image synthesis course aims at introducing the students to the amazing world of image generation and its applications, with an emphasis to interactive graphics for games and virtual reality and photorealistic production rendering. Breadth vs Depth. A wide range of topics are covered, capturing mostly at a high level the basics of real- time image generation algorithms and graphics hardware technology, production-quality pipelines and methods and effects, materials and appearance, as well as colour manipulation. Application topics include virtual and mixed reality and the use of volume rendering to medical imaging. Interested students can delve into more details through focused reading material, personalized projects (see below) and the bibliography. Personalization. Computer graphics is an inspiring domain and as a course we firmly believe that it should remain so. To deliver this promise, the students are encouraged to select one of many options of engagement and therefore, assessment, be that a written-examination-only system or a combination of paper study and project. For projects, there are many options available, ranging from ray tracing to VR and Unity/Unreal-based game development, either as a personal project or a team assignment. Background. Although a basic background in computer graphics (undergraduate level) is appreciated, it is not a prerequisite, since the principles of 2D and 3D computer graphics are (briefly) re-introduced in this course. Some elementary mathematics and principles of probability theory are required (as well as some computer programming skills for those who will choose a development project).
    [Show full text]
  • Gigavoxels: a Voxel-Based Rendering Pipeline for Efficient
    THÈSE Pour obtenir le grade de DOCTEUR DE L’UNIVERSITÉ DE GRENOBLE Spécialité : Mathématiques Informatique Arrêté ministériel : 6 Aout 2006 Présentée par Cyril Crassin Thèse dirigée par Fabrice Neyret préparée au sein du Laboratoire Jean Kuntzmann dans l’école doctorale de Mathématiques, Sciences et Technologies de l’Information, Informatique GigaVoxels: A Voxel-Based Rendering Pipeline For Efficient Exploration Of Large And Detailed Scenes Thèse soutenue publiquement le 12 Juillet 2011, devant le jury composé de : Mathias Paulin Professeur, Université Paul Sabatier, Toulouse, Rapporteur Michael Wimmer Associate Professor, Technische Universität, Wien, Rapporteur Jean-Michel Dischler Professeur, Université de Strasbourg, Examinateur Carsten Dachsbacher Professor, Karlsruhe Institute of Technology, Examinateur Miguel Sainz Director of Developer Technology, NVIDIA, Examinateur Francois Sillion Directeur de Recherche, INRIA, Examinateur Fabrice Neyret Directeur de Recherche, CNRS, Directeur de thèse 2 Acknowledgements Je tiens tout d’abord à remercier Fabrice pour son encadrement tout au long de ces 4 années de thèse qui furent extrêmement enrichissantes, tant d’un point de vue scientifique que personnel. J’ai énor- mément apprécié sa disponibilité, son regard toujours objectif et pertinent, ainsi que son implication, sa passion et son admirable vision de la recherche. Je remercie également tous les anciens et les nouveaux membres de l’équipe ARTIS pour leur bonne humeur et la formidable ambiance que tous contribuent à créer et à perpétuer. Un merci particulier à mes co-bureaux et amis, Pierre et Olivier, pour avoir supporté mon bazar et mes mauvais jeux de mots pendant plus de 2 ans. Un grand merci également à Elmar pour toute l’aide qu’il m’a apportée durant cette thèse, ainsi qu’à Eric et à Charles pour leur appui mathématique précieux.
    [Show full text]
  • Pathtracinginproduction
    Path tracing in Production Part 1: Modern Path Tracing Luca F������� (Organizer) Johannes H����� (Organizer) Weta Digital Weta Digital Daniel H��������� Christopher K���� Marc D����� Jorge S����������� Animal Logic Sony Imageworks Weta Digital Weta Digital SIGGRAPH 2019 Course Notes Imagery from recent movie productions, featuring difficult light transport, massive geometric complexity, intricate material detail, as well as volumetric effects. The LEGO Movie 2: The Second Part Image courtesy of Animal Logic, ©2019 Warner Bros. Entertainment Inc. ©The LEGO Group. All rights reserved. Spiderman: Homecoming ©2017 CTMG, Inc. All rights reserved. Alita: Battle Angel ©2018 Twentieth Century Fox Film Corporation. All rights reserved. Permission to make digital or hard copies of part or all of this work for personal or class- room use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, con- tact the Owner/Author. Copyright is held by the owner/author(s). SIGGRAPH ’19 Courses, July 28 - August 01, 2019, Los Angeles, CA, USA ACM 978-1-4503-6307-5/19/07. 10.1145/3305366.3328079 P��� ������� �� P��������� Abstract In the past few years the movie industry has switched over from stochastic rasterisation approaches to using phys- ically based light transport simulation: path tracing in production has become ubiquitous across studios. The new approach came with undisputed advantages such as consistent lighting,progressive previews,and fresh code bases. But also abandoning 30 years of experience meant some hard cuts affecting all stages such as lighting, look devel- opment, geometric modelling, scene description formats, the way we schedule for multi-threading, just to name a few.
    [Show full text]
  • Optimization of Inverse Reflector Design
    OPTIMIZATION OF INVERSE REFLECTOR DESIGN Albert MAS BAIXERAS ISBN: 978-84-694-4258-6 Dipòsit legal: Gi-672-2011 http://hdl.handle.net/10803/22705 ADVERTIMENT. La consulta d’aquesta tesi queda condicionada a l’acceptació de les següents condicions d'ús: La difusió d’aquesta tesi per mitjà del servei TDX ha estat autoritzada pels titulars dels drets de propietat intel·lectual únicament per a usos privats emmarcats en activitats d’investigació i docència. No s’autoritza la seva reproducció amb finalitats de lucre ni la seva difusió i posada a disposició des d’un lloc aliè al servei TDX. No s’autoritza la presentació del seu contingut en una finestra o marc aliè a TDX (framing). Aquesta reserva de drets afecta tant al resum de presentació de la tesi com als seus continguts. En la utilització o cita de parts de la tesi és obligat indicar el nom de la persona autora. ADVERTENCIA. La consulta de esta tesis queda condicionada a la aceptación de las siguientes condiciones de uso: La difusión de esta tesis por medio del servicio TDR ha sido autorizada por los titulares de los derechos de propiedad intelectual únicamente para usos privados enmarcados en actividades de investigación y docencia. No se autoriza su reproducción con finalidades de lucro ni su difusión y puesta a disposición desde un sitio ajeno al servicio TDR. No se autoriza la presentación de su contenido en una ventana o marco ajeno a TDR (framing). Esta reserva de derechos afecta tanto al resumen de presentación de la tesis como a sus contenidos.
    [Show full text]