skip to main content

Title: Surface Triangulation for CSG in Mercury

Visualization routines for rendering complicated geometries are very useful for engineers and scientists who are trying to build 3D prototypes of their designs. A common way to rapidly add interesting features to a 3D model is through the use of a concept called Constructive Solid Geometry. CSG uses compositions of the boolean set operations to manipulate basic geometric primitives to form more complicated objects. The most common boolean operations employed are union, intersection, and subtraction. Most computer-aided design software packages contain some sort of ability visualize CSG. The typical workflow for the user is as follows: The user specifies the individual primitive components, the user arbitrarily combines each of these primitives with boolean operations, the software generates a CSG tree structure which normally stores these solids implicitly with their defining equation, the tree is traversed and a general algorithm is applied to render the appropriate geometry onto the screen. Algorithms for visualizing CSG have been extensively developed for over a decade. Points sampled from the implicit solids are typically used as input by variations of algorithms like marching cubes and point-cloud surface reconstruction. Here, we explain a surface triangulation method from the graphics community that is being used for surfacemore » visualization in the framework of a Monte-Carlo neutron transport code called Mercury.« less
 [1] ;  [2]
  1. Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Georgia Inst. of Technology, Atlanta, GA (United States)
  2. Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
Publication Date:
OSTI Identifier:
Report Number(s):
DOE Contract Number:
Resource Type:
Technical Report
Research Org:
Lawrence Livermore National Laboratory (LLNL), Livermore, CA
Sponsoring Org:
Country of Publication:
United States