Search NASA⌕ Search

SEARCH · Search NASA

Results for “polygon difference algorithm”

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 19 records

Polygon Subtraction in Two or Three Dimensions

There has been much previous work on the topic of Boolean operations for polygons. Most of the emphasis has been on polygon clipping (polygon intersection). One of the earliest solutions was by Weiler and Atherton whose general approach of processing lists of vertices is incorporated into this algorithm. A very good treatment of the operations of intersection, union, and difference was provided by Margalit and Knott. More recently, Rivero and Feito developed an efficient method of operation based on representing polygons through simplices, and Peng et al. provided performance improvements. However, their methodology requires that polygons be translated to the first quadrant before processing. This subtraction or difference algorithm was developed to provide a polygon subtraction (or polygon difference) that works on simple polygons (as defined by Margalit and Knott) in two or three dimensions. Inputs to the algorithm are two lists of vertices—each list representing a polygon. The output from the algorithm is a list of polygons (each of which is a list of vertices) that represent the areas inside one of the original polygons but not the other. The general methodology is to begin by finding a point on the first polygon that is outside the other polygon. Starting from that point, construct the output polygon by tracing around first polygon until hitting a point of intersection with other polygon. Switch to other polygon and continue adding to the output polygon by tracing backward until hitting a point of intersection with original polygon. Switch back to original polygon and continue tracing. Continue tracing and switching until arriving back at starting point (closing the output polygon). After all points in the first polygon have been processed, the process is repeated for the second polygon.

polygon difference algorithm↗

Approaching the exa-scale: a real-world evaluation of rendering extremely large data sets

Extremely large scale analysis is becoming increasingly important as supercomputers and their simulations move from petascale to exascale. The lack of dedicated hardware acceleration for rendering on today's supercomputing platforms motivates our detailed evaluation of the possibility of interactive rendering on the supercomputer. In order to facilitate our understanding of rendering on the supercomputing platform, we focus on scalability of rendering algorithms and architecture envisioned for exascale datasets. To understand tradeoffs for dealing with extremely large datasets, we compare three different rendering algorithms for large polygonal data: software based ray tracing, software based rasterization and hardware accelerated rasterization. We present a case study of strong and weak scaling of rendering extremely large data on both GPU and CPU based parallel supercomputers using Para View, a parallel visualization tool. Wc use three different data sets: two synthetic and one from a scientific application. At an extreme scale, algorithmic rendering choices make a difference and should be considered while approaching exascale computing, visualization, and analysis. We find software based ray-tracing offers a viable approach for scalable rendering of the projected future massive data sizes.

97 MATHEMATICS AND COMPUTING↗

SU-E-T-754: Three-Dimensional Patient Modeling Using Photogrammetry for Collision Avoidance

Purpose: To evaluate photogrammetry for creating a three-dimensional patient model. Methods: A mannequin was configured on the couch of a CT scanner to simulate a patient setup using an indexed positioning device. A CT fiducial was placed on the indexed CT table-overlay at the reference index position. Two dimensional photogrammetry targets were placed on the table in known positions. A digital SLR camera was used to obtain 27 images from different positions around the CT table. The images were imported into a commercial photogrammetry package and a 3D model constructed. Each photogrammetry target was identified on 2 to 5 images. The CT DICOM metadata and the position of the CT fiducial were used to calculate the coordinates of the photogrammetry targets in the CT image frame of reference. The coordinates were transferred to the photogrammetry software to orient the 3D model. The mannequin setup was transferred to the treatment couch of a linear accelerator and positioned at isocenter using in-room lasers. The treatment couch coordinates were noted and compared with prediction. The collision free regions were measured over the full range of gantry and table motion and were compared with predictions obtained using a general purpose polygon interference algorithm. Results: The reconstructed 3D model consisted of 180000 triangles. The difference between the predicted and measured couch positions were 5 mm, 1 mm, and 1 mm for longitudinal, lateral, and vertical, respectively. The collision prediction tested 64620 gantry table combinations in 11.1 seconds. The accuracy was 96.5%, with false positive and negative results occurring at the boundaries of the collision space. Conclusion: Photogrammetry can be used as a tool for collision avoidance during treatment planning. The results indicate that a buffer zone is necessary to avoid false negatives at the boundary of the collision-free zone. Testing with human patients is underway. Research partially supported by a grant from Varian Medical Systems.

60 APPLIED LIFE SCIENCES↗

Initial Exploratory Study of the Impacts of Climate Change on Air Traffic Operations

Climate change is already happening and is projected to accelerate in the future. It will persist for the foreseeable future, even with optimistic projections of technological advances and behavior changes. It will make aviation more and more challenging over time. Among other things, it is expected to cause increased severe weather, more extreme temperatures, and rising sea levels that constrain when, where, and how aircraft can fly. NASA has many prior, ongoing, and upcoming efforts towards mitigating the impacts of aviation on climate change. There is also a need to perform a comprehensive investigation of the reverse: that is, the impacts of climate change on aviation. This is an initial exploratory study on this topic utilizing the NAS Digital Twin—composed of the ATM TestBed simulation platform and NAS Digital Twin airspace management algorithms—to run NAS-wide simulations with Convective Weather Avoidance Model polygons at different avoidance thresholds to emulate the increase in severe weather that could manifest due to climate change. It was found that air traffic management may be able to limit the impact of climate change in terms of delay and fuel burn. However, increased severe weather due to climate change can make separation—particularly, aircraft-to-weather separation—more challenging by reducing available airspace and constraining the solution space. Challenging situations were identified and corresponding potential solutions were proposed towards ensuring air traffic operations continue to be robust and resilient to the impacts of increased severe weather due to climate change.

climate change, weather, air traffic operations↗

Some algorithms for polygons on a sphere.

A limited search for polygon algorithms for use in a new military training simulation that interfaces with several others produced only planar algorithms. To avoid having to implement several different sophisticated map projections to guarantee compatibility with all the other simulations, we opted to develop algorithms that work directly on a sphere. The first is an algorithm to compute the area of a polygon whose edges are segments of great circles. Since our model represents certain object locations as mathematical points, the second topic is whether a specified point is inside a specified polygon. Possibly pathological cases are identified and eliminated. When we realized that most political boundaries are actually rhumb lines, use of the Mercator projection equations seemed unavoidable. We then reasoned that if all the edges were short enough, lat-lon lines, great circle segments, and rhumb lines would be close enough to being identical that we could use whichever was most convenient. Thence, we looked at the relationship between the maximum distances between great circle segments and rhumb lines and between lat-lon lines and rhumb lines as functions of length, azimuth, and latitude. The final algorithm finds the area overlapped by two polygons. Again, potentially pathological cases are identified and eliminated.

Duquette, William H.↗

UAV Path Planning for Wildfires - Sustainably Fighting Wildfires with Automated Path Planning for UAVs

As the severity and frequency of wildfires increase, infrastructure, properties, national parks, animal habitats, and human lives (civilians and firefighters) are put at greater risk. This paper examines the possible application of algorithmic path planning for UAV reconnaissance to reduce damage and safety risks, as aforementioned. When the location of a wildfire is known, UAVs are immediately dispatched from an operating base to fly to the fire and support the firefighters as quickly as possible. Then, the algorithm incrementally analyzes different environmental factors to create a path for the UAV to follow. This work focuses on generating a path for the UAV to follow given a set of polygons representing obstacles. The most important features of this algorithm are its fast response time and obstacle maneuverability. The use of an efficient path planning algorithm could potentially save lives, infrastructure, and acres of forest destruction.

UAV↗

Cloud Mask Intercomparison eXercise (CMIX): An evaluation of cloud masking algorithms for Landsat 8 and Sentinel-2

Cloud cover is a major limiting factor in exploiting time-series data acquired by optical spaceborne remote sensing sensors. Multiple methods have been developed to address the problem of cloud detection in satellite imagery and a number of cloud masking algorithms have been developed for optical sensors but very few studies have carried out quantitative intercomparison of state-of-the-art methods in this domain. This paper summarizes results of the first Cloud Masking Intercomparison eXercise (CMIX) conducted within the Committee Earth Observation Satellites (CEOS) Working Group on Calibration & Validation (WGCV). CEOS is the forum for space agency coordination and cooperation on Earth observations, with activities organized under working groups. CMIX, as one such activity, is an international collaborative effort aimed at intercomparing cloud detection algorithms for moderate-spatial resolution (10–30 m) spaceborne optical sensors. The focus of CMIX is on open and free imagery acquired by the Landsat 8 (NASA/USGS) and Sentinel-2 (ESA) missions. Ten algorithms developed by nine teams from fourteen different organizations representing universities, research centers and industry, as well as space agencies (CNES, ESA, DLR, and NASA), are evaluated within the CMIX. Those algorithms vary in their approach and concepts utilized which were based on various spectral properties, spatial and temporal features, as well as machine learning methods. Algorithm outputs are evaluated against existing reference cloud mask datasets. Those datasets vary in sampling methods, geographical distribution, sample unit (points, polygons, full image labels), and generation approaches (experts, machine learning, sky images). Overall, the performance of algorithms varied depending on the reference dataset, which can be attributed to differences in how the reference datasets were produced. The algorithms were in good agreement for thick cloud detection, which were opaque and had lower uncertainties in their identification, in contrast to thin/semi-transparent clouds detection. Not only did CMIX allow identification of strengths and weaknesses of existing algorithms and potential areas of improvements, but also the problems associated with the existing reference datasets. The paper concludes with recommendations on generating new reference datasets, metrics, and an analysis framework to be further exploited and additional input datasets to be considered by future CMIX activities.

Sergii Skakun↗

Man-made objects cuing in satellite imagery

We present a multi-scale framework for man-made structures cuing in satellite image regions. The approach is based on a hierarchical image segmentation followed by structural analysis. A hierarchical segmentation produces an image pyramid that contains a stack of irregular image partitions, represented as polygonized pixel patches, of successively reduced levels of detail (LOOs). We are jumping off from the over-segmented image represented by polygons attributed with spectral and texture information. The image is represented as a proximity graph with vertices corresponding to the polygons and edges reflecting polygon relations. This is followed by the iterative graph contraction based on Boruvka's Minimum Spanning Tree (MST) construction algorithm. The graph contractions merge the patches based on their pairwise spectral and texture differences. Concurrently with the construction of the irregular image pyramid, structural analysis is done on the agglomerated patches. Man-made object cuing is based on the analysis of shape properties of the constructed patches and their spatial relations. The presented framework can be used as pre-scanning tool for wide area monitoring to quickly guide the further analysis to regions of interest.

97 MATHEMATICS AND COMPUTING↗

Geometry and X-ray diffraction characteristics of carbon nanotubes

Algorithms for generating atomic coordinates in nanotubes with an arbitrary cell in the layer plane have been developed. The conditions for the seamless matching of a flat layer rolled up in any direction are formulated for cylindrical, conical, and faceted tubes. A method has been developed for generating different types of faceted nanotubes using a group transformation (obtained in this study) that leaves invariant an arbitrary polygon in the nanotube cross section. Equations are proposed for deriving the diameter and chirality of single-wall carbon cylindrical nanotubes from X-ray diffraction spectra.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Detection of Lung Contour with Closed Principal Curve and Machine Learning

Radiation therapy plays an essential role in the treatment of cancer. In radiation therapy, the ideal radiation doses are delivered to the observed tumor while not affecting neighboring normal tissues. In three-dimensional computed tomography (3D-CT) scans, the contours of tumors and organs-at-risk (OARs) are often manually delineated by radiologists. The task is complicated and time-consuming, and the manually delineated results will be variable from different radiologists. We propose a semi-supervised contour detection algorithm, which firstly uses a few points of region of interest (ROI) as an approximate initialization. Then the data sequences are achieved by the closed polygonal line (CPL) algorithm, where the data sequences consist of the ordered projection indexes and the corresponding initial points. Finally, the smooth lung contour can be obtained, when the data sequences are trained by the backpropagation neural network model (BNNM). We use the private clinical dataset and the public Lung Image Database Consortium and Image Database Resource Initiative (LIDC-IDRI) dataset to measure the accuracy of the presented method, respectively. To the private dataset, experimental results on the initial points which are as low as 15% of the manually delineated points show that the Dice coefficient reaches up to 0.95 and the global error is as low as 1.47 × 10{sup −2}. The performance of the proposed algorithm is also better than the cubic spline interpolation (CSI) algorithm. While on the public LIDC-IDRI dataset, our method achieves superior segmentation performance with average Dice of 0.83.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Development of an Improved Spatial Metadata Simplification Algorithm

The National Aeronautics and Space Administration's (NASA) Atmospheric Science Data Center (ASDC) at NASA Langley Research Center in Hampton, VA provides atmospheric science data products and services to the science community, including enhanced search and subsetting capabilities for numerous Earth Science datasets. The ASDC is the official Distributed Active Archive Center (DAAC) of record for the Tropospheric Emissions: Monitoring of Pollution (TEMPO) instrument. TEMPO is situated on a geostationary satellite positioned at a longitude near the center of the conterminous United States and focused on North America, making hourly swaths of its field of regard from east to west. Spatial metadata is an essential component for the discovery and distribution of Earth Science data. The simplified polygonal boundaries representing the archived data files ensure that any granule can be identified quickly and accurately by a geospatial query. Historically the Douglas-Peucker algorithm has been used for polygon simplification; however, due to the nature of the algorithm, a buffer must be added to the polygon before simplification to ensure pivotal points are not removed by the algorithm. This adds in additional error to the polygon simplification. ASDC’s goal is to test other methods of polyline simplification, such as Visvalingan-Whyatt and Opheim simplification alongside of Douglas-Peucker and different buffering methods, to produce less error during polygon simplification of TEMPO data swaths, and special spatial query geometries such as EPA non-attainment regions, and geopolitical boundaries.

Spatial Metadata↗

Use of Spatial Metadata Simplification for TEMPO

The National Aeronautics and Space Administration's (NASA) Atmospheric Science Data Center (ASDC) at NASA Langley Research Center in Hampton, VA provides atmospheric science data products and services to the science community, including enhanced search and subsetting capabilities for numerous Earth Science datasets. The ASDC is the official Distributed Active Archive Center (DAAC) of record for the Tropospheric Emissions: Monitoring of Pollution (TEMPO) instrument. TEMPO is situated on a geostationary satellite positioned at a longitude near the center of the conterminous United States and focused on North America, making hourly swaths of its field of regard from east to west. Spatial metadata is an essential component for the discovery and distribution of Earth Science data. The simplified polygonal boundaries representing the archived data files ensure that any granule can be identified quickly and accurately by a geospatial query. Historically the Douglas-Peucker algorithm has been used for polygon simplification; however, due to the nature of the algorithm, a buffer must be added to the polygon before simplification to ensure pivotal points are not removed by the algorithm. This adds in additional error to the polygon simplification. ASDC’s goal is to test other methods of polyline simplification, such as Visvalingan-Whyatt and Opheim simplification alongside of Douglas-Peucker and different buffering methods, to produce less error during polygon simplification of TEMPO data swaths, and special spatial query geometries such as EPA non-attainment regions, and geopolitical boundaries.

Spatial Metadata↗

Impulse position control algorithms for nonlinear systems

The article is devoted to the formalization and description of impulse-sliding regime in nonlinear dynamical systems that arise in the application of impulse position controls of a special kind. The concept of trajectory impulse-sliding regime formalized as some limiting network element Euler polygons generated by a discrete approximation of the impulse position control This paper differs from the previously published papers in that it uses a definition of solutions of systems with impulse controls, it based on the closure of the set of smooth solutions in the space of functions of bounded variation. The need for the study of such regimes is the fact that they often arise when parry disturbances acting on technical or economic control system.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Global Characterization of Polygonally Fractured Terrain on Venus and Implications for a Climate Change Origin

On Earth, polygonal fractures with spacings of 1-100 cm form in lava flows that cool slowly under isotropic stress conditions. On Venus, polygonal fractures are observed with typical fracture spacings of 1-2 km, covering regions 10s to 100s of km across. These features have been proposed to form via cooling of lava flows or above subsurface intrusions, or due to surface cooling caused by climate change. A watershed algorithm was modified to search the entire Magellan image database autonomously for terrains with polygonal fractures. Here we characterize the 204 polygon terrains found using this method (including over 170 newly identified regions) with respect to size, morphology, stratigraphy, and geologic setting. These results are used to examine different models of origin.

Smrekar, S. E.↗

Autonomous Intelligent Assembly Systems LDRD 105746 (Final Report)

This report documents a three-year to develop technology that enables mobile robots to perform autonomous assembly tasks in unstructured outdoor environments. This is a multi-tier problem that requires an integration of a large number of different software technologies including: command and control, estimation and localization, distributed communications, object recognition, pose estimation, real-time scanning, and scene interpretation. Although ultimately unsuccessful in achieving a target brick stacking task autonomously, numerous important component technologies were nevertheless developed. Such technologies include: a patent-pending polygon snake algorithm for robust feature tracking, a color grid algorithm for uniquely identification and calibration, a command and control framework for abstracting robot commands, a scanning capability that utilizes a compact robot portable scanner, and more. This report describes this project and these developed technologies.

Anderson, Robert J.↗

Algorithmic commonalities in the parallel environment

The ultimate aim of this project was to analyze procedures from substantially different application areas to discover what is either common or peculiar in the process of conversion to the Massively Parallel Processor (MPP). Three areas were identified: molecular dynamic simulation, production systems (rule systems), and various graphics and vision algorithms. To date, only selected graphics procedures have been investigated. They are the most readily available, and produce the most visible results. These include simple polygon patch rendering, raycasting against a constructive solid geometric model, and stochastic or fractal based textured surface algorithms. Only the simplest of conversion strategies, mapping a major loop to the array, has been investigated so far. It is not entirely satisfactory.

Mcanulty, Michael A.↗

Numerical Conformal Mapping Using Cross-Ratios and Delaunay Triangulation

We propose a new algorithm for computing the Riemann mapping of the unit disk to a polygon, also known as the Schwarz-Christoffel transformation. The new algorithm, CRDT, is based on cross-ratios of the prevertices, and also on cross-ratios of quadrilaterals in a Delaunay triangulation of the polygon. The CRDT algorithm produces an accurate representation of the Riemann mapping even in the presence of arbitrary long, thin regions in the polygon, unlike any previous conformal mapping algorithm. We believe that CRDT can never fail to converge to the correct Riemann mapping, but the correctness and convergence proof depend on conjectures that we have so far not been able to prove. We demonstrate convergence with computational experiments. The Riemann mapping has applications to problems in two-dimensional potential theory and to finite-difference mesh generation. We use CRDT to produce a mapping and solve a boundary value problem on long, thin regions for which no other algorithm can solve these problems.

Driscoll, Tobin A.↗

Surface property variations in Venusian fluidized ejecta blanket craters

A comprehensive study of Magellan Cycles 1 and 2 radar data from Venus reveals surface roughness and dielectric variations associated with fluidized ejecta blanket (FEB) craters that help illuminate styles of flow ejecta emplacement. This study develops new procedures of digital unit mapping and polygon-filling algorithms using Magellan synthetic aperture radar (SAR), altimetry, and radiometry data. These techniques allow the extraction of radiophysical information for FEB crater materials, nearby plains, and lava flows. Backscatter curve slopes of the FEBs studied here are consistent with surface textures that are transitional between a'a and pahoehoe-like. Average surface property values of ejecta units are relatively similar for a given crater, but are discernibly different from other craters. Individual crater ejecta reflectivity and emissivity values are relatively similar to those for the surrounding plains, which may suggest a link between plains material and ejecta dielectric properties. Increasing FEB roughness downflow are interpreted to be associated with more lava-like flows, while decreasing roughness are more similar to trends typical of gravity (pyroclastic-like or debris-like) flows. Most commonly, FEB crater flow materials exhibit transitions from proximal, lava/melt-like flow styles to distal, gravity flow-like styles. Some FEBs show more complicated behavior, however, or appear to be more dominated by dielectric differences downflow, as inferred from correlations between the data sets. Such transitions may result from changes in local topography or from overlapping of flow lobes during FEB emplacement.

Johnson, Jeffrey R.↗