Detector Description – Part III Ivana Hrivnacova, IPN Orsay Tatiana Nikitina, CERN Aknowledgement: Slides by: J.Apostolakis, G.Cosmo, A. Lechner.

Slides:



Advertisements
Similar presentations
Traditional practice separates seismic data processing and further interpretation. However the most efficient processing methods utilize a-priori information.
Advertisements

Arc-length computation and arc-length parameterization
Parameterizing a Geometry using the COMSOL Moving Mesh Feature
M 1 and M 2 – Masses of the two objects [kg] G – Universal gravitational constant G = 6.67x N m 2 /kg 2 or G = 3.439x10 -8 ft 4 /(lb s 4 ) r – distance.
SOFTWARE TESTING. INTRODUCTION  Software Testing is the process of executing a program or system with the intent of finding errors.  It involves any.
Sources of the Magnetic Field
Geometry Primer Lines and rays Planes Spheres Frustums Triangles Polygon Polyhedron.
Chapter 32 Magnetic Fields.
CHAPTER 12 Height Maps, Hidden Surface Removal, Clipping and Level of Detail Algorithms © 2008 Cengage Learning EMEA.
P. Venkataraman Mechanical Engineering P. Venkataraman Rochester Institute of Technology DETC2011 –47658 Determining ODE from Noisy Data 31 th CIE, Washington.
1Notes. 2Heightfields  Especially good for terrain - just need a 2d array of heights (maybe stored as an image)  Displacement map from a plane  Split.
Informationsteknologi Thursday, November 22, 2007Computer Graphics - Class 111 Today’s class Clipping Parametric and point-normal form of lines Intersecting.
1Notes. 2 Triangle intersection  Many, many ways to do this  Most robust (and one of the fastest) is to do it based on determinants  For vectors a,b,c.
Magnetostatics Magnetostatics is the branch of electromagnetics dealing with the effects of electric charges in steady motion (i.e, steady current or DC).
Surface to Surface Intersection N. M. Patrikalakis, T. Maekawa, K. H. Ko, H. Mukundan May 25, 2004.
Detector Description Gabriele Cosmo, Geant4 Users’ Workshop Tutorial SLAC February 18-22, 2002.
EE663 Image Processing Edge Detection 2 Dr. Samir H. Abdul-Jauwad Electrical Engineering Department King Fahd University of Petroleum & Minerals.
Shape Modeling International 2007 – University of Utah, School of Computing Robust Smooth Feature Extraction from Point Clouds Joel Daniels ¹ Linh Ha ¹.
Gauss’ Law.
Computer Vision Spring ,-685 Instructor: S. Narasimhan Wean Hall 5409 T-R 10:30am – 11:50am.
Ch 8.1 Numerical Methods: The Euler or Tangent Line Method
Detector Description – advanced features The full set of lecture notes of this Geant4 Course is available at
Copyright © Cengage Learning. All rights reserved. 16 Vector Calculus.
U-Solids: new geometrical primitives library for Geant4 and ROOT Marek Gayer CERN Physics Department (PH) Group Software Development for Experiments (SFT)
October 14, 2014Computer Vision Lecture 11: Image Segmentation I 1Contours How should we represent contours? A good contour representation should meet.
Parallels of Latitude Meridians of Longitude Graticular Network Georeferencing Using MaNIS/HerpNET/ORNIS Guidelines.
USolids meeting Conventions. DistanceToIn(p,v) Geant4USolidsVecGeomROOT Point p is Outside No intersection Between shape and ray(p+v*t) Infinity.
CS 325 Introduction to Computer Graphics 04 / 26 / 2010 Instructor: Michael Eckmann.
1 Electric Field – Continuous Charge Distribution As the average separation between source charges is smaller than the distance between the charges and.
Geometry and Field: New features and Developments T. Nikitina For Geometry Working Group Geant4 workshop, Hebden Bridge september 2007 G4Paraboloid.
Lecture 6 : Level Set Method
INTRUDUCTION TO SOFTWARE TESTING TECHNIQUES BY PRADEEP I.
Field propagation in Geant4 John Apostolakis 25 th May 2005 Ver. 
Field propagation in Geant4 John Apostolakis, CERN Ecole Geant June 2007, Paris 25 th May 2005 Ver. 
Detector Description: Sensitive Detector & Field
Magnetic Field Issues for Simulation and Reconstruction N. Amapane, N. Neumeister Workshop on LHC Physics with High-p T Muons in CMS Bologna, April 9-12,
New software library of geometrical primitives for modelling of solids used in Monte Carlo detector simulations Marek Gayer, John Apostolakis, Gabriele.
Geant4 Simulation of the Beam Line for the HARP Experiment M.Gostkin, A.Jemtchougov, E.Rogalev (JINR, Dubna)
Geant4 Tracking Test (D. Lunesu)1 Daniela Lunesu, Stefano Magni Dario Menasce INFN Milano GEANT4 TRACING TESTs.
Midwest Accelerator Physics Meeting. Indiana University, March 15-19, ORBIT Electron Cloud Model Andrei Shishlo, Yoichi Sato, Slava Danilov, Jeff.
Outline  Developments/fixes in the last year  Introduced in release 9.6 and patches  Planned for release 10.0 and ongoing …  Currently under development.
U-Solids: new geometrical primitives library for Geant4 and ROOT Marek Gayer CERN Physics Department (PH) Group Software Development for Experiments (SFT)
SOFTWARE TESTING. Introduction Software Testing is the process of executing a program or system with the intent of finding errors. It involves any activity.
Formulation of 2D‐FDTD without a PML.
By Verena Kain CERN BE-OP. In the next three lectures we will have a look at the different components of a synchrotron. Today: Controlling particle trajectories.
Lecture 04 Edge Detection Lecture 04 Edge Detection Mata kuliah: T Computer Vision Tahun: 2010.
Intro to Simulink Modified by Gary Balas 20 Feb 2011 Copyright , Andy Packard. This work is licensed under.
Digital Image Processing CSC331
Geometry 3 I.Hrivnacova IPN, Orsay Most slides thanks to M. Asai, SLAC Cours Paris June 2007.
Geometry and Fields: Further and advanced features J. Apostolakis & G. Cosmo.
Level Set Segmentation ~ 9.37 Ki-Chang Kwak.
Processing Images and Video for An Impressionist Effect Automatic production of “painterly” animations from video clips. Extending existing algorithms.
SOFTWARE TESTING LECTURE 9. OBSERVATIONS ABOUT TESTING “ Testing is the process of executing a program with the intention of finding errors. ” – Myers.
Topics  Direct Predicate Characterization as an evaluation method.  Implementation and Testing of the Approach.  Conclusions and Future Work.
Computational Fluid Dynamics Lecture II Numerical Methods and Criteria for CFD Dr. Ugur GUVEN Professor of Aerospace Engineering.
1 Line Integrals In this section we are now going to introduce a new kind of integral. However, before we do that it is important to note that you will.
Detector Description: Advanced Features
Fundamentals of Applied Electromagnetics
Software Testing.
Chapter 9 Vector Calculus.
Detector Description – advanced features
Electromagnetic Theory
THE METHOD OF LINES ANALYSIS OF ASYMMETRIC OPTICAL WAVEGUIDES Ary Syahriar.
Field propagation in Geant4
Detector Description – advanced features
Digital Image Synthesis Yung-Yu Chuang 10/4/2005
Field propagation in Geant4
Field propagation in Geant4
Field propagation in Geant4
Lesson 4: Application to transport distributions
Presentation transcript:

Detector Description – Part III Ivana Hrivnacova, IPN Orsay Tatiana Nikitina, CERN Aknowledgement: Slides by: J.Apostolakis, G.Cosmo, A. Lechner

PART III Detector Description: More advanced features - Tunable parameters of propagation in Field - User defined solids

Tunable Parameters of Propagation in Field

Detector Description - Geant4 Course4 Propagation in Magnetic field - 1 In order to propagate a particle inside a field (e.g. magnetic, electric or both), we integrate the equation of motion of the particle in the field In general this is best done using a Runge-Kutta method for the integration of ordinary differential equations. Several Runge-Kutta methods are available In specific cases other solvers can also be used: In a uniform field, as the analytical solution is known. In a nearly uniform field, where we perturb it

Detector Description - Geant4 Course5 Propagation in Magnetic field - 2 Once a method is chosen that allows G4 to calculate the track's motion in a field, we break up this curved path into linear chord segments We determine the chord segments so that they closely approximate the curved path. We use the chords to interrogate the Navigator, to see whether the track has crossed a volume boundary

Detector Description - Geant4 Course6 Propagation in Magnetic field - 3 You can set the accuracy of the volume intersection, by setting a parameter called the “miss distance” it is a measure of the error in whether the approximate track intersects a volume Default “miss distance” is 0.25 mm One step can consist of more than one chords. In some cases, one step consists of several turns miss distance Step Chords real trajectory

Detector Description - Geant4 Course7 Propagation in Magnetic field - 4 In addition to the ‘miss distance’ there are other parameters which the user can set in order to adjust the accuracy (and performance) of tracking in field : The ‘delta intersection’ parameter is the accuracy to which an intersection with a volume boundary is calculated. If candidate boundary intersection is estimated to have precision better than this, it is accepted. This parameter is especially important because it is used to limit a bias that our algorithm (for boundary crossing in field) exhibits. The ‘epsilon_integration(min,max)’ and ‘delta one step’ permit to tune the accuracy of numerical integration of equation of motion. These parameters are strongly coupled. Further details are described in section 4.3 (Electromagnetic Field) of the Application Developers Guide. chord real trajectory ‘delta intersection’ estimated intersection correct intersection

User defined solids

Detector Description - Geant4 Course9 User defined solids All solids should derive from G4VSolid and implement its abstract interface will guarantee the solid is treated as any other solid predefined in the kernel Basic functionalities required for a solid Compute distances to/from the shape Detect if a point is inside the shape Compute the surface normal to the shape at a given point Compute the extent of the shape Provide few visualization/graphics utilities

Detector Description - Geant4 Course10 What a solid should reply to…- 1 EInside Inside(const G4ThreeVector& p) const; Should return, considering a predefined tolerance: kOutside - if the point at offset p is outside the shapes boundaries kSurface - if the point is close less than Tolerance/2 from the surface kInside - if the point is inside the shape boundaries G4ThreeVector SurfaceNormal(const G4ThreeVector& p) const; Should return the outwards pointing unit normal of the shape for the surface closest to the point at offset p. G4double DistanceToIn(const G4ThreeVector& p, const G4ThreeVector& v) const; Should return the distance along the normalized vector v to the shape from the point at offset p. If there is no intersection, returns kInfinity. The first intersection resulting from ‘leaving' a surface/volume is discarded. Hence, it is tolerant of points on the surface of the shape

Detector Description - Geant4 Course11 What a solid should reply to…- 2 G4double DistanceToIn(const G4ThreeVector& p) const; Calculates the distance to the nearest surface of a shape from an outside point p. The distance can be an underestimate G4double DistanceToOut(const G4ThreeVector& p, const G4ThreeVector& v, const G4bool calcNorm=false, G4bool* validNorm=0, G4ThreeVector* n=0) const; Returns the distance along the normalised vector v to the shape, from a point at an offset p inside or on the surface of the shape. Intersections with surfaces, when the point is less than Tolerance/2 from a surface must be ignored. If calcNorm is true, then it must also set validNorm to either: True - if the solid lies entirely behind or on the exiting surface. Then it must set n to the outwards normal vector (the Magnitude of the vector is not defined) ‏ False - if the solid does not lie entirely behind or on the exiting surface G4double DistanceToOut(const G4ThreeVector& p) const; Calculates the distance to the nearest surface of a shape from an inside point p. The distance can be an underestimate

Detector Description - Geant4 Course12 Solid: more functions… G4bool CalculateExtent(const EAxis pAxis, const G4VoxelLimits& pVoxelLimit, const G4AffineTransform& pTransform, G4double& pMin, G4double& pMax) const; Calculates the minimum and maximum extent of the solid, when under the specified transform, and within the specified limits. If the solid is not intersected by the region, return false, else return true Member functions for the purpose of visualization: void DescribeYourselfTo (G4VGraphicsScene& scene) const; “double dispatch” function which identifies the solid to the graphics scene G4VisExtent GetExtent () const; Provides extent (bounding box) as possible hint to the graphics view