Search NASA⌕ Search

SEARCH · Search NASA

Results for “triangulation”

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.

At least 127 records · Page 7

Digital tomosynthesis (DTS) for verification of target position in early stage lung cancer patients

Purpose: The ability to verify intrafraction tumor position is clinically useful for hypofractionated treatments. Short arc kV digital tomosynthesis (DTS) could facilitate more frequent target verification. The authors used DTS combined with triangulation to determine the mean temporal position of small-volume lung tumor targets treated with stereotactic radiotherapy. DTS registration results were benchmarked against online clinical localization using registration between free-breathing cone-beam computed tomography (CBCT) and the average intensity projection (AvIP) of the planning 4DCT.Methods: In this retrospective study, 76 sets of kV-projection images from online CBCT scans of 13 patients were used to generate DTS image slices (CB-DTS) with nonclinical research software (DTS Toolkit, Varian Medical Systems). Three-dimensional tumor motion was 1.3–4 mm in six patients and 6.1–25.4 mm in seven patients on 4DCT (significant difference in the mean of the groups, P < 0.01). The 4DCT AvIP was used to digitally reconstruct the Reference-DTS. DTS registration and DTS registration combined with triangulation were investigated. Progressive shortening of total DTS arc lengths from 95° to 35° around 0° gantry position was evaluated for different scenarios: DTS registration using the entire arc; DTS registration plus triangulation using two nonoverlapping arcs; and for 55° and 45° total gantry rotation, DTS registration plus triangulation using two overlapping arcs. Finally, DTS registration plus triangulation performed at eight gantry angles, each separated by 45° was evaluated using full fan kV projection data for one patient with an immobile tumor and five patients with mobile tumors.Results: For DTS registration alone, shortening arc length did not influence accuracy in X- and Y-directions, but in Z-direction, mean deviations from online CBCT localization systematically increased for shorter arc length (P < 0.05). For example, using a 95° arc mean DTS-CBCT difference was 0.8 mm (1 SD = 0.6 mm) and for a 35° arc the mean was 2.4 mm (1 SD = 1.7 mm). DTS plus triangulation using nonoverlapping-arcs increased accuracy in Z-direction for tested arc lengths ≤55° (P < 0.01). Overlapping arcs increased accuracy in Y-direction for tumors with motion >4 mm (P < 0.02) but increased Z-direction accuracy was only observed with 55° total gantry rotation. The 95th percentile deviations with this overlapping technique in X-, Y-, and Z-directions were 1.3, 2.0, and 2.5 mm, respectively. For the five patients with mobile tumors where DTS + triangulation was performed with 45° intervals, the pooled deviation from online CBCT correction showed, for X-, Y-, and Z-directions, mean of 1.1 mm, standard deviations (SD) of 0.9, 1.0, and 0.9 mm, respectively. The mean + 2 SD was <3 mm for each direction.Conclusions: Short-arc DTS verification of time averaged lung tumor position is feasible using free-breathing kV projection data and the AvIP of the 4DCT as a reference. Observed differences between DTS and online CBCT registration with AvIP were ≤3 mm (mean + 2 SD), however, the increased temporal resolution of DTS + triangulation also identified short period deviations from the average target position on the CBCT. Short-arc DTS appears promising for intrafraction tumor position monitoring during stereotactic lung radiotherapy delivered with a rotational technique.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

On the Use of CAD-Native Predicates and Geometry in Surface Meshing

Several paradigms for accessing CAD geometry during surface meshing for CFD are discussed. File translation, inconsistent geometry engines and non-native point construction are all identified as sources of non-robustness. The paper argues in favor of accessing CAD parts and assemblies in their native format, without translation, and for the use of CAD-native predicates and constructors in surface mesh generation. The discussion also emphasizes the importance of examining the computational requirements for exact evaluation of triangulation predicates during surface meshing. The native approach is demonstrated through an algorithm for the generation of closed manifold surface triangulations from CAD geometry. CAD parts and assemblies are used in their native format, and a part's native geometry engine is accessed through a modeler-independent application programming interface (API). In seeking a robust and fully automated procedure, the algorithm is based on a new physical space manifold triangulation technique specially developed to avoid robustness issues associated with poorly conditioned mappings. In addition, this approach avoids the usual ambiguities associated with floating-point predicate evaluation on constructed coordinate geometry in a mapped space. The technique is incremental, so that each new site improves the triangulation by some well defined quality measure. The algorithm terminates after achieving a prespecified measure of mesh quality and produces a triangulation such that no angle is less than a given angle bound, a or greater than pi - 2alpha. This result also sets bounds on the maximum vertex degree, triangle aspect-ratio and maximum stretching rate for the triangulation. In addition to the output triangulations for a variety of CAD parts, the discussion presents related theoretical results which assert the existence of such an angle bound, and demonstrate that maximum bounds of between 25 deg and 30 deg may be achieved in practice.

Aftosmis, M. J.↗

A Dynamic Trajectory Fit to Multisensor Fireball Observations

Meteorites with known orbital origins are key to our understanding of solar system formation and the source of life on Earth. Fireball networks have been developed globally in a unified effort to record and ultimately retrieve these cosmic samples. However, the accuracy of the determined orbit and the likelihood of meteorite recovery depend directly on the accuracy of the chosen meteoroid triangulation method. There are three leading techniques for meteoroid triangulation discussed in the literature: the method of planes, the straight-line least-squares method, and the multiparameter fit method. Here we describe an alternative method to meteoroid triangulation, called the dynamic trajectory fit. This approach uses the meteoroid’s 3D dynamic equations of motion to fit a realistic trajectory directly to multisensor line-of-sight observations. This method has the ability to resolve fragmentation events, fit systematic observatory timing offsets, and determine mass estimates of the meteoroid along its observable trajectory. Through a comprehensive Monte Carlo analysis of over 100,000 trajectory simulations, we find this new method to more accurately estimate meteoroid trajectories of slow entry events (<25 km s{sup −1}) and events observed from low convergence angles (<10°) compared to existing meteoroid triangulation techniques. Additionally, we triangulate an observed fireball event with visible fragmentation using the various triangulation methods to show that the proposed dynamic trajectory fit implementing fragmentation to best match the captured multisensor line-of-sight data.

79 ASTRONOMY AND ASTROPHYSICS↗

Constrained CVT meshes and a comparison of triangular mesh generators

Mesh generation in regions in Euclidean space is a central task in computational science, and especially for commonly used numerical methods for the solution of partial differential equations, e.g., finite element and finite volume methods. We focus on the uniform Delaunay triangulation of planar regions and, in particular, on how one selects the positions of the vertices of the triangulation. We discuss a recently developed method, based on the centroidal Voronoi tessellation (CVT) concept, for effecting such triangulations and present two algorithms, including one new one, for CVT-based grid generation. We also compare several methods, including CVT-based methods, for triangulating planar domains. To this end, we define several quantitative measures of the quality of uniform grids. We then generate triangulations of several planar regions, including some having complexities that are representative of what one may encounter in practice. We subject the resulting grids to visual and quantitative comparisons and conclude that all the methods considered produce high-quality uniform grids and that the CVT-based grids are at least as good as any of the others.

97 MATHEMATICS AND COMPUTING↗

Adjustment technique without explicit formation of normal equations /conjugate gradient method/

For a simultaneous adjustment of a large geodetic triangulation system, a semiiterative technique is modified and used successfully. In this semiiterative technique, known as the conjugate gradient (CG) method, original observation equations are used, and thus the explicit formation of normal equations is avoided, 'huge' computer storage space being saved in the case of triangulation systems. This method is suitable even for very poorly conditioned systems where solution is obtained only after more iterations. A detailed study of the CG method for its application to large geodetic triangulation systems was done that also considered constraint equations with observation equations. It was programmed and tested on systems as small as two unknowns and three equations up to those as large as 804 unknowns and 1397 equations. When real data (573 unknowns, 965 equations) from a 1858-km-long triangulation system were used, a solution vector accurate to four decimal places was obtained in 2.96 min after 1171 iterations (i.e., 2.0 times the number of unknowns).

Saxena, N. K.↗

Three-dimensional unstructured grid generation via incremental insertion and local optimization

Algorithms for the generation of 3D unstructured surface and volume grids are discussed. These algorithms are based on incremental insertion and local optimization. The present algorithms are very general and permit local grid optimization based on various measures of grid quality. This is very important; unlike the 2D Delaunay triangulation, the 3D Delaunay triangulation appears not to have a lexicographic characterization of angularity. (The Delaunay triangulation is known to minimize that maximum containment sphere, but unfortunately this is not true lexicographically). Consequently, Delaunay triangulations in three-space can result in poorly shaped tetrahedral elements. Using the present algorithms, 3D meshes can be constructed which optimize a certain angle measure, albeit locally. We also discuss the combinatorial aspects of the algorithm as well as implementational details.

Barth, Timothy J.↗

Bias Reduction and Filter Convergence for Long Range Stereo

We are concerned here with improving long range stereo by filtering image sequences. Traditionally, measurement errors from stereo camera systems have been approximated as 3-D Gaussians, where the mean is derived by triangulation and the covariance by linearized error propagation. However, there are two problems that arise when filtering such 3-D measurements. First, stereo triangulation suffers from a range dependent statistical bias; when filtering this leads to over-estimating the true range. Second, filtering 3-D measurements derived via linearized error propagation leads to apparent filter divergence; the estimator is biased to under-estimate range. To address the first issue, we examine the statistical behavior of stereo triangulation and show how to remove the bias by series expansion. The solution to the second problem is to filter with image coordinates as measurements instead of triangulated 3-D coordinates.

robotics↗

Hybrid Curve Fitting For Reducing Motion Commands In Object Construction

Existing slicing software for additive manufacturing typically requires a triangulated mesh as its input. Triangulated meshes are approximate representations of exact CAD models. Despite the loss in dimensional accuracy, triangulated meshes are used because they are computationally easier to cross-section and offset than the exact geometry in CAD format. When a triangulated object is prepared, the resulting machine instructions include only linear motion commands. Numerous modern motion controllers can move in arc and spline motions; however, the absence of slicing software that supports curvature prevents these commands from being leveraged. To address this limitation, this paper presents a method for the hybrid reconstruction of arcs and splines as a post-processing step to traditional slicing. This method can greatly reduce the number of motion commands required to construct an object by printing smooth curved surfaces. This concise representation of tool-pathing allows for more even extrusion and is computed without a major impact on slicing time.

Wade, Charles↗

Variable resolution Poisson-disk sampling for meshing discrete fracture networks

Here, we present the near-Maximal Algorithm for Poisson-disk Sampling (nMAPS) to generate point distributions for variable resolution Delaunay triangular and tetrahedral meshes in two and three-dimensions, respectively. nMAPS consists of two principal stages. In the first stage, an initial point distribution is produced using a cell-based rejection algorithm. In the second stage, holes in the sample are detected using an efficient background grid and filled in to obtain a near-maximal covering. Extensive testing shows that nMAPS generates a variable resolution mesh in linear run time with the number of accepted points. We demonstrate nMAPS capabilities by meshing three-dimensional discrete fracture networks (DFN) and the surrounding volume. The discretized boundaries of the fractures, which are represented as planar polygons, are used as the seed of 2D-nMAPS to produce a conforming Delaunay triangulation. The combined mesh of the DFN is used as the seed for 3D-nMAPS, which produces conforming Delaunay tetrahedra surrounding the network. Under a set of conditions that naturally arise in maximal Poisson-disk samples and are satisfied by nMAPS, the two-dimensional Delaunay triangulations are guaranteed to only have well-behaved triangular faces. While nMAPS does not provide triangulation quality bounds in more than two dimensions, we found that low-quality tetrahedra in 3D are infrequent, can be readily detected and removed, and a high-quality balanced mesh is produced.

97 MATHEMATICS AND COMPUTING↗

(0,2) dualities and the 4-simplex

We propose that a simple, Lagrangian 2d \( \mathcal{N} \) = (0, 2) duality interface between the 3d \( \mathcal{N} \) = 2 XYZ model and 3d \( \mathcal{N} \) = 2 SQED can be associated to the simplest triangulated 4-manifold: the 4-simplex. We then begin to flesh out a dictionary between more general triangulated 4-manifolds with boundary and 2d \( \mathcal{N} \) = (0, 2) interfaces. In particular, we identify IR dualities of interfaces associated to local changes of 4d triangulation, governed by the (3), (2, 4), and (2, 4) Pachner moves. We check these dualities using supersymmetric half-indices. We also describe how to produce stand-alone 2d theories (as opposed to interfaces) capturing the geometry of 4-simplices and Pachner moves by making additional field-theoretic choices, and find in this context that the Pachner moves recover abelian \( \mathcal{N} \) = (0, 2) trialities of Gadde-Gukov-Putrov. Our work provides new, explicit tools to explore the interplay between 2d dualities and 4-manifold geometry that has been developed in recent years.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

K-decompositions and 3d gauge theories

This paper combines several new constructions in mathematics and physics. Mathematically, we study framed flat PGL(K, C)-connections on a large class of 3-manifolds M with boundary. We introduce a moduli space $\mathcal{L}$ K (M) of framed flat connections on the boundary ∂M that extend to M. Our goal is to understand an open part of $\mathcal{L}$ K (M) as a Lagrangian subvariety in the symplectic moduli space X un K (∂M) of framed flat connections on the boundary — and more so, as a “K 2 -Lagrangian,” meaning that the K 2 -avatar of the symplectic form restricts to zero. We construct an open part of $\mathcal{L}$ K (M) from elementary data associated with the hypersimplicial K-decomposition of an ideal triangulation of M, in a way that generalizes (and combines) both Thurston’s gluing equations in 3d hyperbolic geometry and the cluster coordinates for framed flat PGL(K, C)-connections on surfaces. By using a canonical map from the complex of configurations of decorated flags to the Bloch complex, we prove that any generic component of $\mathcal{L}$ K (M) is K 2 -isotropic as long as ∂M satisfies certain topological constraints (theorem 4.2). In some cases this easily implies that $\mathcal{L}$ K (M) is K 2 -Lagrangian. For general M, we extend a classic result of Neumann and Zagier on symplectic properties of PGL(2) gluing equations to reduce the K 2 -Lagrangian property to a combinatorial statement. Physically, we translate the K-decomposition of an ideal triangulation of M and its symplectic properties to produce an explicit construction of 3d N = 2 superconformal field theories T K [M] resulting (conjecturally) from the compactification of K M5-branes on M. This extends known constructions for K = 2. Just as for K = 2, the theories T K [M] are described as IR fixed points of abelian Chern-Simons-matter theories. Changes of triangulation (2-3 moves) lead to abelian mirror symmetries that are all generated by the elementary duality between N f = 1 SQED and the XYZ model. In the large K limit, we find evidence that the degrees of freedom of T K [M] grow cubically in K.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Three-dimensional, Time-Resolved, Intrafraction Motion Monitoring Throughout Stereotactic Liver Radiation Therapy on a Conventional Linear Accelerator

Purpose: To investigate the time-resolved 3-dimensional (3D) internal motion throughout stereotactic body radiation therapy (SBRT) of tumors in the liver using standard x-ray imagers of a conventional linear accelerator. Methods and Materials: Ten patients with implanted gold markers received 11 treatment courses of 3-fraction SBRT in a stereotactic body-frame on a conventional linear accelerator. Two pretreatment and 1 posttreatment cone-beam computed tomography (CBCT) scans were acquired during each fraction. The CBCT projection images were used to estimate the internal 3D marker motion during CBCT acquisition with 11-Hz resolution by a monoscopic probability-based method. Throughout the treatment delivery by conformal or volumetric modulated arc fields, simultaneous MV portal imaging (8 Hz) and orthogonal kV imaging (5 Hz) were applied to determine the 3D marker motion using either MV/kV triangulation or the monoscopic method when marker segmentation was unachievable in either MV or kV images. The accuracy of monoscopic motion estimation was quantified by also applying monoscopic estimation as a test for all treatments during which MV/kV triangulation was possible. Results: Root-mean-square deviations between monoscopic estimations and triangulations were less than 1.0 mm. The mean 3D intrafraction and intrafield motion ranges during liver SBRT were 17.6 mm (range, 5.6-39.5 mm) and 11.3 mm (2.1-35.5mm), respectively. The risk of large intrafraction baseline shifts correlated with intrafield respiratory motion range. The mean 3D intrafractional marker displacement relative to the first CBCT was 3.4 mm (range, 0.7-14.5 mm). The 3D displacements exceeded 8.8 mm 10% of the time. Conclusions: Highly detailed time-resolved internal 3D motion was determined throughout liver SBRT using standard imaging equipment. Considerable intrafraction motion was observed. The demonstrated methods provide a widely available approach for motion monitoring that, combined with motion-adaptive treatment techniques, has the potential to improve the accuracy of radiation therapy for moving targets.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Subsecond and Submillimeter Resolution Positional Verification for Stereotactic Irradiation of Spinal Lesions

Purpose: Spine stereotactic body radiation therapy (SBRT) requires highly accurate positioning. We report our experience with markerless template matching and triangulation of kilovoltage images routinely acquired during spine SBRT, to determine spine position. Methods and Materials: Kilovoltage images, continuously acquired at 7, 11 or 15 frames/s during volumetric modulated spine SBRT of 18 patients, consisting of 93 fluoroscopy datasets (1 dataset/arc), were analyzed off-line. Four patients were immobilized in a head/neck mask, 14 had no immobilization. Two-dimensional (2D) templates were created for each gantry angle from planning computed tomography data and registered to prefiltered kilovoltage images to determine 2D shifts between actual and planned spine position. Registrations were considered valid if the normalized cross correlation score was ≥0.15. Multiple registrations were triangulated to determine 3D position. For each spine position dataset, average positional offset and standard deviation were calculated. To verify the accuracy and precision of the technique, mean positional offset and standard deviation for twenty stationary phantom datasets with different baseline shifts were measured. Results: For the phantom, average standard deviations were 0.18 mm for left-right (LR), 0.17 mm for superior-inferior (SI), and 0.23 mm for the anterior-posterior (AP) direction. Maximum difference in average detected and applied shift was 0.09 mm. For the 93 clinical datasets, the percentage of valid matched frames was, on average, 90.7% (range: 49.9-96.1%) per dataset. Average standard deviations for all datasets were 0.28, 0.19, and 0.28 mm for LR, SI, and AP, respectively. Spine position offsets were, on average, −0.05 (range: −1.58 to 2.18), −0.04 (range: −3.56 to 0.82), and −0.03 mm (range: −1.16 to 1.51), respectively. Average positional deviation was <1 mm in all directions in 92% of the arcs. Conclusions: Template matching and triangulation using kilovoltage images acquired during irradiation allows spine position detection with submillimeter accuracy at subsecond intervals. Although the majority of patients were not immobilized, most vertebrae were stable at the sub-mm level during spine SBRT delivery.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Numerical electromagnetic frequency domain analysis with discrete exterior calculus

In this paper, we perform a numerical analysis in frequency domain for various electromagnetic problems based on discrete exterior calculus (DEC) with an arbitrary 2-D triangular or 3-D tetrahedral mesh. We formulate the governing equations in terms of DEC for 3-D and 2-D inhomogeneous structures, and also show that the charge continuity relation is naturally satisfied. Then we introduce a general construction for signed dual volume to incorporate material information and take into account the case when circumcenters fall outside triangles or tetrahedrons, which may lead to negative dual volume without Delaunay triangulation. Then we examine the boundary terms induced by the dual mesh and provide a systematical treatment of various boundary conditions, including perfect magnetic conductor (PMC), perfect electric conductor (PEC), Dirichlet, periodic, and absorbing boundary conditions (ABC) within this method. An excellent agreement is achieved through the numerical calculation of several problems, including homogeneous waveguides, microstructured fibers, photonic crystals, scattering by a 2-D PEC, and resonant cavities. - Highlights: • The formulation of 2D and 3D electromagnetic equations with DEC are presented. • Characteristic Hodge stars are constructed without well-centered triangulation or Delaunay triangulation. • Systematical treatment of various boundary conditions, including PMC, PEC, periodic, and absorbing boundary conditions. • Switching between E to H field can change PEC from essential boundary condition to natural boundary condition. • Quality factor of an open dielectric sphere is considered.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗