Description of the GDC program for the graphic display of three-dimensional models prepared by the combinatorial geometry technique
Computer programming for graphic display of combinatorial geometry
Guber, W.↗
SEARCH · Engineering Papers
Results for “Combinatorial Geometry”
Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
Solar Proton Transport within an ICRU Sphere Surrounded by a Complex Shield: Combinatorial Geometry
The 3DHZETRN code, with improved neutron and light ion (Z (is) less than 2) transport procedures, was recently developed and compared to Monte Carlo (MC) simulations using simplified spherical geometries. It was shown that 3DHZETRN agrees with the MC codes to the extent they agree with each other. In the present report, the 3DHZETRN code is extended to enable analysis in general combinatorial geometry. A more complex shielding structure with internal parts surrounding a tissue sphere is considered and compared against MC simulations. It is shown that even in the more complex geometry, 3DHZETRN agrees well with the MC codes and maintains a high degree of computational efficiency.
Wilson, John W.↗
The 3-D world modeling with updating capability based on combinatorial geometry
A 3-D world modeling technique using range data is discribed. Range data quantify the distances from the sensor focal plane to the object surface, i.e., the 3-D coordinates of discrete points on the object surface are known. The approach proposed herein for 3-D world modeling is based on the Combinatorial Geometry (CG) method which is widely used in Monte Carlo particle transport calculations. First, each measured point on the object surface is surrounded by a small sphere with a radius determined by the range to that point. Then, the 3-D shapes of the visible surfaces are obtained by taking the (Boolean) union of all the spheres. The result is an unambiguous representation of the object's boundary surfaces. The pre-learned partial knowledge of the environment can be also represented using the CG Method with a relatively small amount of data. Using the CG type of representation, distances in desired directions to boundary surfaces of various objects are efficiently calculated. This feature is particularly useful for continuously verifying the world model against the data provided by a range finder, and for integrating range data from successive locations of the robot during motion. The efficiency of the proposed approach is illustrated by simulations of a spherical robot in a 3-D room in the presence of moving obstacles and inadequate prelearned partial knowledge of the environment.
Goldstein, M.↗
Thermal analysis of combinatorial solid geometry models using SINDA
Algorithms have been developed using Monte Carlo techniques to determine the thermal network parameters necessary to perform a finite difference analysis on Combinatorial Solid Geometry (CSG) models. Orbital and laser fluxes as well as internal heat generation are modeled to facilitate satellite modeling. The results of the thermal calculations are used to model the infrared (IR) images of targets and assess target vulnerability. Sample analyses and validation are presented which demonstrate code products.
Gerencser, Diane↗
Solar Proton Transport Within an ICRU Sphere Surrounded by a Complex Shield: Ray-trace Geometry
A computationally efficient 3DHZETRN code with enhanced neutron and light ion (Z is less than or equal to 2) propagation was recently developed for complex, inhomogeneous shield geometry described by combinatorial objects. Comparisons were made between 3DHZETRN results and Monte Carlo (MC) simulations at locations within the combinatorial geometry, and it was shown that 3DHZETRN agrees with the MC codes to the extent they agree with each other. In the present report, the 3DHZETRN code is extended to enable analysis in ray-trace geometry. This latest extension enables the code to be used within current engineering design practices utilizing fully detailed vehicle and habitat geometries. Through convergence testing, it is shown that fidelity in an actual shield geometry can be maintained in the discrete ray-trace description by systematically increasing the number of discrete rays used. It is also shown that this fidelity is carried into transport procedures and resulting exposure quantities without sacrificing computational efficiency.
Slaba, Tony C.↗
Passive MMW camera for low visibility landings
A passive, millimeter wave imaging sensor for aircraft landing in low or poor visibility conditions is described. The sensor can be incorporated in a camera for future enhanced/synthetic vision systems. Contrast is provided by differences in material reflectivities, temperature, and sky illumination of the scene being imaged. Photographic images of the system's fog penetration capabilities are presented. A combinatorial geometry technique is used to construct the scene geometries. This technique uses eight basic geometric shapes which are used as building blocks for 3-D complex-shaped objects. The building blocks are then combined via union, intersection and exclusion operations to form 3-D scene objects and the combinatorial geometry package determines ray intercepts with scene objects, providing the specific surfaces and propagation distance for the scene.
Shoucri, Merit↗
Stereolithographic geometry model of the IBR-2M experimental facility
The IBR-2M is a fast research reactor that operates in supercritical condition for ∼ 800 μs every 200 ms. Two reflector parts in nickel rotate in opposite directions generating 1.8 GWth peak power when they align with the fuel zone changing the reactor status from deep subcritical to supercritical. The reactor core uses high-enriched plutonium fuel and is cooled by sodium. This reactor has been modeled by MCNP and SERPENT computer programs. The MCNP model uses combinatorial geometry, whereas the SERPENT model employs the Stereolithographic (STL) geometry representation that can be used by 3D printers. The STL geometry was constructed using the CUBIT computer program. The CUBIT program was also used for a three-dimensional visualization of the Monte Carlo models. SERPENT and MCNP models use the same geometry, material specifications, and nuclear data. The latter are based on the ENDF/B-7.0 library. SERPENT and MCNP using same geometry and same material specifications produce similar k{sub eff} values within 120 pcm.
21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
Update On the Status of the FLUKA Monte Carlo Transport Code*
The FLUKA Monte Carlo transport code is a well-known simulation tool in High Energy Physics. FLUKA is a dynamic tool in the sense that it is being continually updated and improved by the authors. We review the progress achieved since the last CHEP Conference on the physics models, some technical improvements to the code and some recent applications. From the point of view of the physics, improvements have been made with the extension of PEANUT to higher energies for p, n, pi, pbar/nbar and for nbars down to the lowest energies, the addition of the online capability to evolve radioactive products and get subsequent dose rates, upgrading of the treatment of EM interactions with the elimination of the need to separately prepare preprocessed files. A new coherent photon scattering model, an updated treatment of the photo-electric effect, an improved pair production model, new photon cross sections from the LLNL Cullen database have been implemented. In the field of nucleus-- nucleus interactions the electromagnetic dissociation of heavy ions has been added along with the extension of the interaction models for some nuclide pairs to energies below 100 MeV/A using the BME approach, as well as the development of an improved QMD model for intermediate energies. Both DPMJET 2.53 and 3 remain available along with rQMD 2.4 for heavy ion interactions above 100 MeV/A. Technical improvements include the ability to use parentheses in setting up the combinatorial geometry, the introduction of pre-processor directives in the input stream. a new random number generator with full 64 bit randomness, new routines for mathematical special functions (adapted from SLATEC). Finally, work is progressing on the deployment of a user-friendly GUI input interface as well as a CAD-like geometry creation and visualization tool. On the application front, FLUKA has been used to extensively evaluate the potential space radiation effects on astronauts for future deep space missions, the activation dose for beam target areas, dose calculations for radiation therapy as well as being adapted for use in the simulation of events in the ALICE detector at the LHC.
Ferrari, A.↗
Loops of loops expansion in the amplituhedron
We study a novel geometric expansion for scattering amplitudes in the planar sector of $\mathcal{N}$ = 4 super Yang-Mills theory, in the context of the Amplituhedron which reproduces the all-loop integrand as a canonical differential form on the positive geometry. In a paper by Arkani-Hamed, Henn and one of the authors, it was shown that this result can be recast in terms of negative geometries with a certain hierarchy of loops (closed cycles) in the space of loop momenta, represented by lines in momentum twistor space. One can then calculate an all-loop order result in the approximation where only tree graphs in the space of all loops are considered. Furthermore, using differential equation methods, it is possible to calculate and resum integrated expressions and obtain strong coupling results. In this paper, we provide a more general framework for the ‘loops of loops’ expansion and outline a powerful method for the determination of differential forms for higher-order geometries. We solve the problem completely for graphs with one internal cycle, but the method can be used more generally for other geometries.
72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
Monte Carlo Simulation of Background and Source Measurements with CSG and CAD Geometries
Detecting radioactive sources in an urban environment is difficult due to the large magnitude and variability of the background radiation. To support the search mission of the National Nuclear Security Administration, a project was undertaken to determine if first-principles modeling and simulation could be used to accurately predict the response of radiation detectors in urban environments. This study demonstrates that the simulated detector responses to photon radiation from both an isotopic source and the background compare well to benchmark-quality measurements in a large urban-like test environment. Simulation results using a traditional combinatorial solid geometry and a CAD model generated from LiDAR measurements gave very similar detector responses. With this validation, further simulations could be used to predict detector responses for various situations in real urban settings.
46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
Two loop renormalization of scalar theories using a geometric approach
We derive a general formula for two-loop counterterms in Effective Field Theories (EFTs) using a geometric approach. This formula allows the two-loop results of our previous paper to be applied to a wide range of theories. The two-loop results hold for loop graphs in EFTs where the interaction vertices contain operators of arbitrarily high dimension, but at most two derivatives. We also extend our previous one-loop result to include operators with an arbitrary number of derivatives, as long as there is at most one derivative acting on each field. The final result for the two-loop counterterms is written in terms of geometric quantities such as the Riemann curvature tensor of the scalar manifold and its covariant derivatives. As applications of our results, we give the two-loop counterterms and renormalization group equations for the O(n) EFT to dimension six, the scalar sector of the Standard Model Effective Field Theory (SMEFT) to dimension six, and chiral perturbation theory to order p 6 .
72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
A Dose of Reality: Radiation Analysis for Realistic Human Spacecraft
INTRODUCTION As with most computational analyses, a tradeoff exists between problem complexity, resource availability and response accuracy when modeling radiation transport from the source to a detector. The largest amount of analyst time for setting up an analysis is often spent ensuring that any simplifications made have minimal impact on the results. The vehicle shield geometry of interest is typically simplified from the original CAD design in order to reduce computation time, but this simplification requires the analyst to "re-draw" the geometry with a limited set of volumes in order to accommodate a specific radiation transport software package. The resulting low-fidelity geometry model cannot be shared with or compared to other radiation transport software packages, and the process can be error prone with increased model complexity. The work presented here demonstrates the use of the DAGMC (Direct Accelerated Geometry for Monte Carlo) Toolkit from the University of Wisconsin, to model the impacts of several space radiation sources on a CAD drawing of the US Lab module. METHODS The DAGMC toolkit workflow begins with the export of an existing CAD geometry from the native CAD to the ACIS format. The ACIS format file is then cleaned using SpaceClaim to remove small holes and component overlaps. Metadata is then assigned to the cleaned geometry file using CUBIT/Trelis from csimsoft (Registered Trademark). The DAGMC plugin script removes duplicate shared surfaces, facets the geometry to a specified tolerance, and ensures that the faceted geometry is water tight. This step also writes the material and scoring information to a standard input file format that the analyst can alter as desired prior to running the radiation transport program. The scoring results can be transformed, via python script, into a 3D format that is viewable in a standard graphics program. RESULTS The CAD model of the US Lab module of the International Space Station, inclusive of all the racks and components, was simplified to remove holes and volume overlaps. Problematic features within the drawing were also removed or repaired to prevent runtime issues. The cleaned drawing was then run through the DAGMC workflow to prepare for analysis. Pilot tests modeling transport of 1GeV proton and 800MeV/A oxygen sources show that reasonable results are converged upon in an acceptable amount of overall computation time from drawing preparation to data analysis. The FLUKA radiation transport code will next be used to model both a GCR and a trapped radiation source. These results will then be compared with measurements that have been made by the radiation instrumentation deployed inside the US Lab module. DISCUSSION Early analyses have indicated that the DAGMC workflow is a promising toolkit for running vehicle geometries of interest to NASA through multiple radiation transport codes. In addition, recent work has shown that a realistic human phantom, provided via a subcontract with the University of Florida, can be placed inside any vehicle geometry for a combinatorial analysis. This added functionality gives the user the ability to score various parameters at the organ level, and the results can then be used as input for cancer risk models.
Barzilla, J. E.↗
Sign flip triangulations of the amplituhedron
We present new triangulations of the m = 4 amplituhedron relevant for scattering amplitudes in planar N = 4 super-Yang-Mills, obtained directly from the combinatorial definition of the geometry. Using the “sign flip” characterization of the amplituhedron, we reproduce the canonical forms for the all-multiplicity next-tomaximally helicity violating (NMHV) and next-to-next-to-maximally helicity violating (N2MHV) tree-level as well as the NMHV one-loop cases, without using any input from traditional amplitudes methods. Our results provide strong evidence for the equivalence of the original definition of the amplituhedron [1] and the topological one [2], and suggest a new path forward for computing higher loop amplitudes geometrically. In particular, we realize the NMHV one-loop amplituhedron as the intersection of two amplituhedra of lower dimensionality, which is reflected in the novel structure of the corresponding canonical form.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
The Topology of Symmetric Tensor Fields
Combinatorial topology, also known as "rubber sheet geometry", has extensive applications in geometry and analysis, many of which result from connections with the theory of differential equations. A link between topology and differential equations is vector fields. Recent developments in scientific visualization have shown that vector fields also play an important role in the analysis of second-order tensor fields. A second-order tensor field can be transformed into its eigensystem, namely, eigenvalues and their associated eigenvectors without loss of information content. Eigenvectors behave in a similar fashion to ordinary vectors with even simpler topological structures due to their sign indeterminacy. Incorporating information about eigenvectors and eigenvalues in a display technique known as hyperstreamlines reveals the structure of a tensor field. The simplify and often complex tensor field and to capture its important features, the tensor is decomposed into an isotopic tensor and a deviator. A tensor field and its deviator share the same set of eigenvectors, and therefore they have a similar topological structure. A a deviator determines the properties of a tensor field, while the isotopic part provides a uniform bias. Degenerate points are basic constituents of tensor fields. In 2-D tensor fields, there are only two types of degenerate points; while in 3-D, the degenerate points can be characterized in a Q'-R' plane. Compressible and incompressible flows share similar topological feature due to the similarity of their deviators. In the case of the deformation tensor, the singularities of its deviator represent the area of vortex core in the field. In turbulent flows, the similarities and differences of the topology of the deformation and the Reynolds stress tensors reveal that the basic addie-viscosity assuptions have their validity in turbulence modeling under certain conditions.
Levin, Yingmei↗
Deep reinforcement learning to discover multi-fuel injection strategies for compression ignition engines
Over the past several decades, regulation of compression ignition engine emissions has become increasingly stringent as concern about the environmental and health implications of these emissions has grown. These changing constraints have led to a series of new, alternative fuel injection strategies that aim to maintain power output while reducing in-cylinder generated emissions by operating in the low-temperature combustion (LTC) regime. These advanced injection strategies are created and retuned for individual combinations of engine geometry, fuel, and emissions constraints. Deep reinforcement learning has been shown to be an effective alternative to traditional optimization approaches for highly combinatorial control problems, such as discovering the optimal injection schedules for compression ignition engines. In this study, we deploy a previously presented deep reinforcement learning framework to iteratively optimize a series of engine geometries over a range of increasingly strict NO x emissions regulations. We then examine the resulting injection schedules. We discuss the potential for using this deep reinforcement learning framework for fuel selection screening and for discovering unique injection strategies for different engine geometries and future emissions standards.
33 ADVANCED PROPULSION SYSTEMS↗
Comparing crystal structures with symmetry and geometry
Abstract Measuring the similarity between two arbitrary crystal structures is a common challenge in crystallography and materials science. Although there are an infinite number of ways to mathematically relate two crystal structures, only a few are physically meaningful. Here we introduce both a geometry-based and a symmetry-adapted similarity metric to compare crystal structures. Using crystal symmetry and combinatorial optimization we describe an algorithm to arrive at the structural relationship that minimizes these similarity metrics across all possible maps between any pair of crystal structures. The approach makes it possible to (i) identify pairs of crystal structures that are identical, (ii) quantitatively measure the similarity between crystal structures, and (iii) find and rank structural transformation pathways between any pair of crystal structures. We discuss the advantages of using the symmetry-adapted cost metric over the geometric cost. Finally, we show that all known structural transformation pathways between common crystal structures are recovered with the mapping algorithm. The methodology presented in this study will be of value to efforts that seek to catalogue crystal structures, identify structural transformation pathways or prune large first-principles datasets used to parameterize on-lattice Hamiltonians.
36 MATERIALS SCIENCE↗
Implementation of Combinatorial Optimization Techniques for Automated Fiber Placement Through Thickness Defect Stack-Up Minimization
The Computer Aided Process Planning (CAPP) module was developed to facilitate and accelerate the process planning workflow for Automated Fiber Placement (AFP). CAPP assists process planners in identifying optimal starting point locations and layup strategies for each ply of a laminate. Ply optimization operates on measurement and scoring of geometry-based defects such as gaps, overlaps, angle deviation, and steering. This paper expands on the established framework for analyzing defect stack-up through thickness of a laminate. Four different combinatorial optimization algorithms are implemented and evaluated: (1) genetic algorithm, (2) differential evolution, (3) particle swarm, and (4) greedy search. The algorithms identify the optimal combination of ply-level layup strategies, by scoring potential laminates on defect stacking, using two different objective functions. A final optimization approach is also presented which trades some performance for a large gain in efficiency. These approaches are compared to a randomized combination using a complex tool surface in a virtual case study. The result is a streamlined methodology for comparing different laminate-level manufacturing strategies and minimizing the through thickness defect stack up.
CAPP↗
Introducing Tropical Geometric Approaches to Delay Tolerant Networking Optimization
Delay Tolerant Networking (DTN) is the standard approach to the networking of space systems with the goal of supporting the Solar System Internet (SSI). Current space networks have a small scale and often depend on rigorously scheduled (pre-determined) contact opportunities; this manual approach inhibits scalability. The goal of this paper is to recast these scheduling problems in order to apply the optimization machinery of tropical geometry. Contact opportunities in space are dependent on such factors as orbital mechanics and asset availability, which induce time-varying connectivity; indeed, end-to-end connectivity might never occur. Routing optimization within this structure is classically difficult and typically utilizes Dijkstra's algorithm as applied to contact graphs. Alternatively, we follow the successes of tropical geometry in train schedule optimization, job assignments, and even traditional networking, by extending this approach to this more general (i.e. disconnected) problem space. These successes imply tropical geometry provides a useful framework in the context of DTNs, starting with applications to queuing theory and long-haul links. Recently, tropical geometry has been applied to parametric path optimization on graphs with variable edge weights. In this work, we extend these advances to account for the problem of routing in a space network, and find that tropical geometry is well-suited to the challenges offered by this new setting, including contact schedules featuring probabilities. Our approach leverages the combinatorial nature of the problem to give feasible shortest path trees in the presence of variable channel conditions and latency, evolving topologies, and uncertainty inherent in space routing. We discuss our tropical approach to DTN for two Python implementations, a Verilog Tropical ALU implementation, tropical frameworks for other parametric graph problems, and solution stability. Lastly, a program for future work is included to illuminate the path ahead.
Delay Tolerant Networking↗