Incremental Triangulation by Way of Edge Swapping and Local Optimization

Author:   National Aeronaut Administration (Nasa)
Publisher:   Createspace Independent Publishing Platform
ISBN:  

9781722301132


Pages:   52
Publication Date:   05 July 2018
Format:   Paperback
Availability:   Available To Order   Availability explained
We have confirmation that this item is in stock with the supplier. It will be ordered in for you and dispatched immediately.

Our Price $47.49 Quantity:  
Add to Cart

Share |

Incremental Triangulation by Way of Edge Swapping and Local Optimization


Overview

This document is intended to serve as an installation, usage, and basic theory guide for the two dimensional triangulation software 'HARLEY' written for the Silicon Graphics IRIS workstation. This code consists of an incremental triangulation algorithm based on point insertion and local edge swapping. Using this basic strategy, several types of triangulations can be produced depending on user selected options. For example, local edge swapping criteria can be chosen which minimizes the maximum interior angle (a MinMax triangulation) or which maximizes the minimum interior angle (a MaxMin or Delaunay triangulation). It should be noted that the MinMax triangulation is generally only locally optical (not globally optimal) in this measure. The MaxMin triangulation, however, is both locally and globally optical. In addition, Steiner triangulations can be constructed by inserting new sites at triangle circumcenters followed by edge swapping based on the MaxMin criteria. Incremental insertion of sites also provides flexibility in choosing cell refinement criteria. A dynamic heap structure has been implemented in the code so that once a refinement measure is specified (i.e., maximum aspect ratio or some measure of a solution gradient for the solution adaptive grid generation) the cell with the largest value of this measure is continually removed from the top of the heap and refined. The heap refinement strategy allows the user to specify either the number of cells desired or refine the mesh until all cell refinement measures satisfy a user specified tolerance level. Since the dynamic heap structure is constantly updated, the algorithm always refines the particular cell in the mesh with the largest refinement criteria value. The code allows the user to: triangulate a cloud of prespecified points (sites), triangulate a set of prespecified interior points constrained by prespecified boundary curve(s), Steiner triangulate the interior/exterior of prespecified boundary curve(s), ...

Full Product Details

Author:   National Aeronaut Administration (Nasa)
Publisher:   Createspace Independent Publishing Platform
Imprint:   Createspace Independent Publishing Platform
Dimensions:   Width: 21.60cm , Height: 0.30cm , Length: 27.90cm
Weight:   0.145kg
ISBN:  

9781722301132


ISBN 10:   1722301139
Pages:   52
Publication Date:   05 July 2018
Audience:   General/trade ,  General
Format:   Paperback
Publisher's Status:   Active
Availability:   Available To Order   Availability explained
We have confirmation that this item is in stock with the supplier. It will be ordered in for you and dispatched immediately.

Table of Contents

Reviews

Author Information

Tab Content 6

Author Website:  

Countries Available

All regions
Latest Reading Guide

April RG 26_2

 

Shopping Cart
Your cart is empty
Shopping cart
Mailing List