U-Solids: new geometrical primitives library for Geant4 and ROOT Marek Gayer CERN Physics Department (PH) Group Software Development for Experiments (SFT)

Slides:



Advertisements
Similar presentations
CSG and Raytracing CPSC 407.
Advertisements

4 th order Embedded Boundary FDTD algorithm for Maxwell Equations Lingling Wu, Stony Brook University Roman Samulyak, BNL Tianshi Lu, BNL Application collaborators:
1 st Meeting, Industrial Geometry, 2005 Approximating Solids by Balls (in collaboration with subproject: "Applications of Higher Geometrics") Bernhard.
Computer Graphics1 Geometry Area of polygons & Volume Of Polygonal surfaces.
Chapter 4.2 Collision Detection and Resolution. 2 Collision Detection Complicated for two reasons 1. Geometry is typically very complex, potentially requiring.
Computational Geometry Definition and Application Areas.
COMPUTER GRAPHICS CS 482 – FALL 2014 OCTOBER 13, 2014 IMPLICIT REPRESENTATIONS IMPLICIT FUNCTIONS IMPLICIT SURFACES MARCHING CUBES.
Implicit Surfaces Tom Ouyang January 29, Outline Properties of Implicit Surfaces Polygonization Ways of generating implicit surfaces Applications.
Chapter 3 2D AND 3D SPATIAL DATA REPRESENTATIONS 김 정 준.
Simulation Project Organization update & review of recommendations Gabriele Cosmo, CERN/PH-SFT Application Area Internal.
Navigating and Browsing 3D Models in 3DLIB Hesham Anan, Kurt Maly, Mohammad Zubair Computer Science Dept. Old Dominion University, Norfolk, VA, (anan,
Multiple-access Communication in Networks A Geometric View W. Chen & S. Meyn Dept ECE & CSL University of Illinois.
REVIEW OF NA61 SOFTWRE UPGRADE PROPOSAL. Mandate The NA61 experiment is contemplating to rewrite its fortran software in modern technology and are requesting.
U-Solids: new geometrical primitives library for Geant4 and ROOT Marek Gayer CERN Physics Department (PH) Group Software Development for Experiments (SFT)
COMPUTER AIDED DESIGN -(CAD)-3
Study of response uniformity of LHCb ECAL Mikhail Prokudin, ITEP.
4.7. I NSTANCING Introduction to geometry instancing.
Geometry Detector geometry A detector geometry in Geant4 is made of a number of volumes. The largest volume is called the World volume. It must contain.
Polygon Modelling. 3D Representation Wire frame NURBS surface Solid Voxel Mesh.
Unified Solids Marek Gayer, John Apostolakis, Gabriele Cosmo, Andrei Gheata, Jean-Marie Guyader, Tatiana Nikitina CERN PH/SFT The 17 th Geant4 Collaboration.
Introduction Complex and large SW. SW crises Expensive HW. Custom SW. Batch execution Structured programming Product SW.
Nick Draper 05/11/2008 Mantid Manipulation and Analysis Toolkit for ISIS data.
Use of Coverity & Valgrind in Geant4 Gabriele Cosmo.
XML in Atlas: from generic to parametric detector description Stan Bentvelsen NIKHEF Amsterdam XML workshop, CERN, May 22.
Computing Performance Recommendations #13, #14. Recommendation #13 (1/3) We recommend providing a simple mechanism for users to turn off “irrelevant”
- DHRUVA TIRUMALA BUKKAPATNAM Geant4 Geometry on a GPU.
Visual Computing Geometric Modelling 1 INFO410 & INFO350 S2 2015
Abstract ESOLID is a computational geometry system that performs boundary evaluation using exact computation. Boundary Evaluation Exact computation Problem.
Visible-Surface Detection Methods
Geoffrey Duval (ISAE-SUPAERO) Naples, October 1 st, 2012.
New software library of geometrical primitives for modelling of solids used in Monte Carlo detector simulations Marek Gayer, John Apostolakis, Gabriele.
Jump to first page The new ROOT geometry package Andrei Gheata - ALICE Institute of Space Sciences, Bucharest.
Parallelization of likelihood functions for data analysis Alfio Lazzaro CERN openlab Forum on Concurrent Programming Models and Frameworks.
Vertices, Edges and Faces By Jordan Diamond. Vertices In geometry, a vertices is a special kind of point which describes the corners or intersections.
USolids Multi-Union notes Marek Gayer 1. GetCandidatesVoxelArray method, on which Inside very much relies Finding voxel candidates did not delete buffers.
VMC workshop1 Ideas for G4 navigation interface using ROOT geometry A.Gheata ALICE offline week, 30 May 05.
BREPS & STEP what's up and coming... Gabriele Cosmo CERN - IT/ASD GEANT4 Workshop September, 20th 1999 ESTEC, Noordwijk, The Netherlands.
Shape Tester. What we need? 1) Tests: a)Test individual shapes Correctness and consistency(like original SBT test, OpticalEscape, ShapeChecker) Accuracy(precision.
Ray Tracing Fall, Introduction Simple idea  Forward Mapping  Natural phenomenon infinite number of rays from light source to object to viewer.
Detector Description – Part III Ivana Hrivnacova, IPN Orsay Tatiana Nikitina, CERN Aknowledgement: Slides by: J.Apostolakis, G.Cosmo, A. Lechner.
STATUS OF THE UNIFIED SOLIDS LIBRARY Gabriele Cosmo/CERN Tatiana Nikitina/CERN.
G EANT highlights kernel modules Gabriele Cosmo, CERN PH-SFT for the Geant4 Collaboration Gabriele Cosmo, CERN PH-SFT for the Geant4 Collaboration.
Geometrically Bounded Wireframe AIC (Part 510) Grouping of curves relevant for 3-dimensional wireframe modeling without topological constructs Elementary.
In the name of God Computer Graphics. Introduction Modeling techniques modeling techniques managements Some renderings.
Physically based deformations of implicit surfaces Michal Remiš.
Outline  Developments/fixes in the last year  Introduced in release 9.6 and patches  Planned for release 10.0 and ongoing …  Currently under development.
Modeling and Visualization of Combustion Using Fluid Simulator and Particle Systems Ing. Marek Gayer (supervised by prof. Pavel Slavík) Computer Graphics.
Architecture team and Inter-category design/interface Makoto Asai (SLAC) 10/Oct/2002 Geant4 delta-review.
Process Asad Ur Rehman Chief Technology Officer Feditec Enterprise.
Approved for Public Release – Distribution Unlimited
IT / API 1 CERN 1-Feb-16 GBLIB: classes to deal with geometrical data Evgueni Tcherniaev IT / API CLHEP workshop, January.
Complete Distance Field Representation 報告者:陳陸剛. Outline Introduction Generate Volume Data Compute Distance Method Complete Distance Definition Distance.
Preliminary Ideas for a New Project Proposal.  Motivation  Vision  More details  Impact for Geant4  Project and Timeline P. Mato/CERN 2.
Current status of the development of the Unified Solids library Marek Gayer CERN PH/SFT.
RENDERING : Global Illumination
Solid Modeling Dr. Scott Schaefer.
Outline  Developments/fixes in the last year  Introduced in release 10.1 and patches (also to 10.0)  Planned for release 10.2 and ongoing …  Currently.
3D Object Representations 2009, Fall. Introduction What is CG?  Imaging : Representing 2D images  Modeling : Representing 3D objects  Rendering : Constructing.
Status of the development of the Unified Solids library Marek Gayer, CERN PH/SFT 2 nd AIDA Annual Meeting, Frascati 2013.
New features in ROOT geometrical modeller for representing non-ideal geometries René Brun, Federico Carminati, Andrei Gheata, Mihaela Gheata CHEP’06,
Update on USolids/VecGeom integration in Geant4 Gabriele Cosmo, CERN EP/SFT.
Geometry & Persistency Recent & ongoing developments
Common Geometry Primitives library WP3 – date

Status of geometrical modeler
Test and Validation Studies of Mathematical Software Libraries
Introduction Goal: Can we reconstruct the energy depositions of the proton in the brain if we are able to reconstruct the photons produced during this.
Geometry checking tools
Introduction to geometry instancing
Computed Tomography (C.T)
Presentation transcript:

U-Solids: new geometrical primitives library for Geant4 and ROOT Marek Gayer CERN Physics Department (PH) Group Software Development for Experiments (SFT)

Introduction, motivation Two geometry modellers in ROOT and Geant4 Solids are 80% of maintenance effort in geometry modeller Consolidate algorithms into a single, new U-Solids library Introduce few new solid shapes Optimized, adapted to new architectures 1/19/20162

Solids to be implemented Union of all solids from Geant4 and ROOT –Simple solids (e.g. box, tube, cone, trapezoid) - mostly ported from the existing implementation, used to provide an initial set for tests within the new library –Complex existing solids (e.g. polycone, extruded polygone) - to be consolidated in the new library (one of the priorities) New solids to optimize existing use cases: union of many solids using voxelization techniques The ordering of implementation is to be decided. 31/19/2016

Currently implemented solids For the start, the simplest shapes were selected Box, Orb (done), Trapezoid (ongoing) 1/19/20164

Navigation functionality and library services for each solid Performance critical methods: –Location of point either inside, outside or on surface –Shortest distance to surface for outside points –Shortest distance to surface for inside points –Distance to surface for inside points with given direction –Distance to surface for outside points with given direction –Normal vector for closest surface from given point Additional methods: Bounding Box, Capacity, Volume, Generating points on surface/edge/inside of solid, Creating mesh for visualization … 51/19/2016

Criteria of inclusion of new and existing codes from Geant4, ROOT Validity of returned results Performance Readability, simplicity of algorithm Possibility of easy vectorization Caution about not introducing new errors 1/19/20166

Suite of tests U-Solids codes should pass: –Optical test –Solid Batch Test (SBT)  Original geometry and voxel tests  Results comparison test  Performance test –ROOT tests (Todo) 1/19/20167

Optical Escape Optical photon is generated inside solid Repeatedly bounces from inner surface Particle must not escape the solid 1/19/20168

Solids Batch Test (SBT) geometry and voxel tests Random points test (groups of inside, outside and surface points) Various distance type methods are tested by numerous checks E.g. for each inside random point p, SafetyFromInside(p) must be > 0 It also tests random voxels with random inside points 1/19/20169

Solids Batch Test (SBT) performance and results comparison tests Attempt to compare performance of Geant4, ROOT and new U-Solids Similar performance as one indicator of correct implementation of new methods Also, values and their differences from different codes can be compared Plots are used for quick evaluation Work in progress Todo: port and measure in Linux 101/19/2016

Example plot: performance test 11 1/19/2016 Note: preliminary results, to be validated on Linux with standard compilation flags

Example plot: Results comparison test 121/19/2016

Future work Tests consolidation Finish trapezoid based on test results From other simple solids up to the more complex ones Continue work on union of many solids Polycone is very often used and has room for improvement 1/19/201613

Acknowledgment Part of AIDA project, coordinated by Gabriele Cosmo Definition / steering in collaboration with Andrei Gheata and John Apostolakis Other contributors: –Jean-Marie Guyader - Multi-union implementation (summer student) –Tatiana Nikitina - Geant4 integration and testing 141/19/2016

151/19/2016 Thank you for your attention. ?????? Do you have any questions ?