Form-factors Josef Pelikán CGG MFF UK Praha.

Similar documents
Global Illumination and Radiosity

Monte Carlo 1: Integration

Global Illumination and Radiosity

Monte Carlo 1: Integration

Global Illumination and Radiosity

Computer Graphics. Jeng-Sheng Yeh 葉正聖 Ming Chuan University (modified from Bing-Yu Chen s slides)

Discussion. History and Outline. Smoothness of Indirect Lighting. Irradiance Caching. Irradiance Calculation. Advanced Computer Graphics (Fall 2009)

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes

Discussion. History and Outline. Smoothness of Indirect Lighting. Irradiance Calculation. Irradiance Caching. Advanced Computer Graphics (Fall 2009)

Global Illumination: Radiosity

Introduction to Radiosity

3D vector computer graphics

Ray scene intersections

Real-time. Shading of Folded Surfaces

Lecture #15 Lecture Notes

Monte Carlo Rendering

Monte Carlo Integration

An Accurate Evaluation of Integrals in Convex and Non convex Polygonal Domain by Twelve Node Quadrilateral Finite Element Method

Some Advanced SPC Tools 1. Cumulative Sum Control (Cusum) Chart For the data shown in Table 9-1, the x chart can be generated.

Steps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices

Cluster Analysis of Electrical Behavior

Simulation: Solving Dynamic Models ABE 5646 Week 11 Chapter 2, Spring 2010

Complex Filtering and Integration via Sampling

Global Illumination. Computer Graphics COMP 770 (236) Spring Instructor: Brandon Lloyd 3/26/07 1

Computer Animation and Visualisation. Lecture 4. Rigging / Skinning

Hierarchical Models Josef Pelikán & Alexander Wilkie CGG MFF UK Praha

Life Tables (Times) Summary. Sample StatFolio: lifetable times.sgp

Topic 13: Radiometry. The Basic Light Transport Path

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS

Kent State University CS 4/ Design and Analysis of Algorithms. Dept. of Math & Computer Science LECT-16. Dynamic Programming

What are the camera parameters? Where are the light sources? What is the mapping from radiance to pixel color? Want to solve for 3D geometry

Fast and accurate view factor generation

Accelerating X-Ray data collection using Pyramid Beam ray casting geometries

Mathematics 256 a course in differential equations for engineering students

Sorting Review. Sorting. Comparison Sorting. CSE 680 Prof. Roger Crawfis. Assumptions

Synthesizer 1.0. User s Guide. A Varying Coefficient Meta. nalytic Tool. Z. Krizan Employing Microsoft Excel 2007

Evaluation of Space Partitioning Data Structures for Nonlinear Mapping

AP PHYSICS B 2008 SCORING GUIDELINES

Chapter 4. Non-Uniform Offsetting and Hollowing by Using Biarcs Fitting for Rapid Prototyping Processes

Dynamic wetting property investigation of AFM tips in micro/nanoscale

Computer models of motion: Iterative calculations

X- Chart Using ANOM Approach

Air Transport Demand. Ta-Hui Yang Associate Professor Department of Logistics Management National Kaohsiung First Univ. of Sci. & Tech.

Introduction to Geometrical Optics - a 2D ray tracing Excel model for spherical mirrors - Part 2

Support Vector Machines

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009.

Some Tutorial about the Project. Computer Graphics

Optimum Synthesis of Mechanisms For Path Generation Using a New Curvature Based Deflection Based Objective Function

Barycentric Coordinates. From: Mean Value Coordinates for Closed Triangular Meshes by Ju et al.

USING GRAPHING SKILLS

LESSON 15: BODE PLOTS OF TRANSFER FUNCTIONS

Radial Basis Functions

Overview. Basic Setup [9] Motivation and Tasks. Modularization 2008/2/20 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION

1. Answer the following. a. A beam of vertically polarized light of intensity W/m2 encounters two polarizing filters as shown below.

Plane Sampling for Light Paths from the Environment Map

Diffuse and specular interreflections with classical, deterministic ray tracing

Beijing , China

Local and Global Accessibility Evaluation with Tool Geometry

Help for Time-Resolved Analysis TRI2 version 2.4 P Barber,

Performance analysis of distributed cluster-based MAC protocol for multiuser MIMO wireless networks

Parallel matrix-vector multiplication

Design and Analysis of Algorithms

Angle-Independent 3D Reconstruction. Ji Zhang Mireille Boutin Daniel Aliaga

Motivation. Motivation. Monte Carlo. Example: Soft Shadows. Outline. Monte Carlo Algorithms. Advanced Computer Graphics (Fall 2009)

The Theory and Application of an Adaptive Moving Least. Squares for Non-uniform Samples

Module Management Tool in Software Development Organizations

Shape Representation Robust to the Sketching Order Using Distance Map and Direction Histogram

Invariant Shape Object Recognition Using B-Spline, Cardinal Spline, and Genetic Algorithm

Complex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following.

PHYS 219 Spring semester Lecture 20: Reflection of Electromagnetic Radiation: Mirrors and Images Formed by Mirrors

Visual Curvature. 1. Introduction. y C. IEEE Conf. on Computer Vision and Pattern Recognition (CVPR), June 2007

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS

Differential wavefront curvature sensor

Computation of Ex-Core Detector Weighting Functions for VVER-440 Using MCNP5

Data Mining: Model Evaluation

Color in OpenGL Polygonal Shading Light Source in OpenGL Material Properties Normal Vectors Phong model

PBRT core. Announcements. pbrt. pbrt plug-ins

Calculation of Sound Ray s Trajectories by the Method of Analogy to Mechanics at Ocean

Surface Mapping One. CS7GV3 Real-time Rendering

Simulation Based Analysis of FAST TCP using OMNET++

An Indian Journal FULL PAPER ABSTRACT KEYWORDS. Trade Science Inc.

VRT012 User s guide V0.1. Address: Žirmūnų g. 27, Vilnius LT-09105, Phone: (370-5) , Fax: (370-5) ,

BUILDING RECONSTRUCTION BASED ON MDL PRINCIPLE FROM 3-D FEATURE POINTS

Edge Detection in Noisy Images Using the Support Vector Machines

Machine Learning: Algorithms and Applications

C2 Training: June 8 9, Combining effect sizes across studies. Create a set of independent effect sizes. Introduction to meta-analysis

An exhaustive error-bounding algorithm for hierarchical radiosity

Sequential search. Building Java Programs Chapter 13. Sequential search. Sequential search

Pictures at an Exhibition

Lobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide

Modeling Local Uncertainty accounting for Uncertainty in the Data

ON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE

APPLICATION OF A COMPUTATIONALLY EFFICIENT GEOSTATISTICAL APPROACH TO CHARACTERIZING VARIABLY SPACED WATER-TABLE DATA

Robust Surface Reconstruction from Orthogonal Slices

A Clustering Algorithm for Key Frame Extraction Based on Density Peak

Design of Georeference-Based Emission Activity Modeling System (G-BEAMS) for Japanese Emission Inventory Management

Course Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms

Vanishing Hull. Jinhui Hu, Suya You, Ulrich Neumann University of Southern California {jinhuihu,suyay,

Exercises (Part 4) Introduction to R UCLA/CCPR. John Fox, February 2005

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;

Transcription:

Form-factors 1996-2016 Josef Pelkán CGG MFF UK Praha pepca@cgg.mff.cun.cz http://cgg.mff.cun.cz/~pepca/ FormFactor 2016 Josef Pelkán, http://cgg.mff.cun.cz/~pepca 1 / 23

Form-factor F It ndcates the proporton of energy emtted from the surface whch wll ht the the surface key value when creatng a system of lnear equatons (searchng for ndvdual area radostes) frst calculaton (physcs): Lambert 1760 t depends only on the geometry of the scene dstance, nclnaton and slope of the areas F s a dmensonless number from the nterval 0,1 for a convex polygon s F = 0 FormFactor 2016 Josef Pelkán, http://cgg.mff.cun.cz/~pepca 2 / 23

Form-factor F N y y d N x r x FormFactor 2016 Josef Pelkán, http://cgg.mff.cun.cz/~pepca 3 / 23

FormFactor 2016 Josef Pelkán, http://cgg.mff.cun.cz/~pepca 4 / 23 F G y x d d x y V x y d d 1 1 2, cos cos, B B B G y x d d e, N 1 1, Form-factor Radosty equaton (wth constant elements):

Dfferental form-factor df d d cos cos r 2 N y y d N x r x FormFactor 2016 Josef Pelkán, http://cgg.mff.cun.cz/~pepca 5 / 23

Dfferental form-factor F d cos cos r 2 d N y y d N x r x FormFactor 2016 Josef Pelkán, http://cgg.mff.cun.cz/~pepca 6 / 23

verage form-factor F 1 cos r cos 2 d d N y y d N x r x FormFactor 2016 Josef Pelkán, http://cgg.mff.cun.cz/~pepca 7 / 23

Calculaton of form-factors analytcal methods numercal methods hemcube (Nusselt analogue), proecton nto one plane, curve ntegral (accordng to Stokes' theorem) numercal stochastc methods (Monte-Carlo) samplng of a spatal angle or an area that receves energy FormFactor 2016 Josef Pelkán, http://cgg.mff.cun.cz/~pepca 8 / 23

Nusselt analogue N r1 F d FormFactor 2016 Josef Pelkán, http://cgg.mff.cun.cz/~pepca 12 / 23

Nusselt analogue F F d d B F d C C B FormFactor 2016 Josef Pelkán, http://cgg.mff.cun.cz/~pepca 13 / 23

Hemcube Regular cell network: delta form-factors F q FormFactor 2016 Josef Pelkán, http://cgg.mff.cun.cz/~pepca 14 / 23

Hemcube calculaton of all F d for gven we proect all other faces on the hemcube bult around we calculate the vsblty of the ndvdual faces on the surface of the hemcube (Z-buffer method) the surface of the hemcube s dvded nto a regular network of cells Cq for each cell we have calculated delta form-factor F q n advance FormFactor 2016 Josef Pelkán, http://cgg.mff.cun.cz/~pepca 15 / 23

Hemcube confguraton factor s estmated by cells that were covered by ts proecton: F dvdng the cube affects the accuracy of the estmaton of the confguraton factors n practce from64 64 to 2k 2k cells were used F d q qj FormFactor 2016 Josef Pelkán, http://cgg.mff.cun.cz/~pepca 16 / 23

Delta form-factors F 2 z 2 2 2 x 1 z 2 2 2 F 1 x y 1 2 1 2 2 1 x 1 y 1 z 2 x 2 FormFactor 2016 Josef Pelkán, http://cgg.mff.cun.cz/~pepca 17 / 23

Sllon hemplane method F q 1 h FormFactor 2016 Josef Pelkán, http://cgg.mff.cun.cz/~pepca 18 / 23

Hemplane method faster mplementaton (proecton, trmmng) part of the spatal angle s neglected the heght of the proecton plane should be maxmum 0.1 vsblty s calculated by dvde and conquer Warnock algortm analogue method adaptve proecton plane dvson better effcency delta form-factor are precalculated for dfferent levels of dvson FormFactor 2016 Josef Pelkán, http://cgg.mff.cun.cz/~pepca 19 / 23

Monte-Carlo methods usng the ray tracng method t s possble to use more complex scene geometry classc acceleraton calculaton methods samplng of the obect surfaces calculaton of ndvdual form-factor easy calculaton for area area form-factor (ndependent samplng) samplng of the sold angle all form-factors from one pont at a tme FormFactor 2016 Josef Pelkán, http://cgg.mff.cun.cz/~pepca 20 / 23

Samplng on the hemsphere Unform samplng of the sold angle wth cos pdf k FormFactor 2016 Josef Pelkán, http://cgg.mff.cun.cz/~pepca 21 / 23

Samplng on the source Non-unform samplng of the sold angle all rays have the same mportaton! FormFactor 2016 Josef Pelkán, http://cgg.mff.cun.cz/~pepca 22 / 23

Lterature. Glassner: Prncples of Dgtal Image Synthess, Morgan Kaufmann, 1995, 916-937 M. Cohen, J. Wallace: Radosty and Realstc Image Synthess, cadem. Press, 1993, 65-107 J. Foley,. van Dam, S. Fener, J. Hughes: Computer Graphcs, Prncples and Practce, 795-799 FormFactor 2016 Josef Pelkán, http://cgg.mff.cun.cz/~pepca 23 / 23