Package gov.nih.mipav.model.structures

Class Triangulation

java.lang.Object
gov.nih.mipav.model.structures.Triangulation
public class Triangulation extends Object

  • Field Details

    • EPSILON

      private double EPSILON

    • i_save_heap

      int i_save_heap

    • j_save_heap

      int j_save_heap

    • k_heap

      int k_heap

    • k1_heap

      int k1_heap

    • n1_heap

      int n1_heap

  • Constructor Details

    • Triangulation

      public Triangulation()

  • Method Details

    • alpha_measure

      public void alpha_measure(int n, double[] z, int triangle_order, int triangle_num, int[] triangle_node, double[] alpha_min, double[] alpha_ave, double[] alpha_area)

    • angle_rad_2d

      public double angle_rad_2d(double[] p1, double[] p2, double[] p3)

    • area_measure

      public void area_measure(int n, double[] z, int triangle_order, int triangle_num, int[] triangle_node, double[] area_min, double[] area_max, double[] area_ratio, double[] area_ave, double[] area_std)

    • bandwidth

      public void bandwidth(int element_order, int element_num, int[] element_node, int[] ml, int[] mu, int[] m)

    • delaunay_swap_test

      public int delaunay_swap_test(double[] xy)

    • diaedg

      public int diaedg(double x0, double y0, double x1, double y1, double x2, double y2, double x3, double y3)

    • get_seed

      public int get_seed()

    • i4_modp

      public int i4_modp(int i, int j)

    • i4_power

      public int i4_power(int i, int j)

    • i4_sign

      public int i4_sign(int i)

    • i4_swap

      public void i4_swap(int[] i, int[] j)

    • i4_wrap

      int i4_wrap(int ival, int ilo, int ihi)

    • i4col_compare

      public int i4col_compare(int m, int n, int[] a, int i, int j)

    • i4col_sort_a

      public void i4col_sort_a(int m, int n, int[] a)

    • i4col_sorted_unique_count

      public int i4col_sorted_unique_count(int m, int n, int[] a)

    • i4col_swap

      public void i4col_swap(int m, int n, int[] a, int icol1, int icol2)

    • i4mat_transpose_print

      public void i4mat_transpose_print(int m, int n, int[] a, char[] title)

    • i4mat_transpose_print_some

      public void i4mat_transpose_print_some(int m, int n, int[] a, int ilo, int jlo, int ihi, int jhi, char[] title)

    • i4mat_transpose_print

      public void i4mat_transpose_print(int m, int n, int[] a, String title)

    • i4mat_transpose_print_some

      public void i4mat_transpose_print_some(int m, int n, int[] a, int ilo, int jlo, int ihi, int jhi, String title)

    • i4vec_heap_d

      public void i4vec_heap_d(int n, int[] a)

    • i4vec_indicator_new

      public int[] i4vec_indicator_new(int n)

    • i4vec_min

      public int i4vec_min(int n, int[] a)

    • i4vec_print

      public void i4vec_print(int n, int[] a, char[] title)

    • i4vec_print

      public void i4vec_print(int n, int[] a, String title)

    • i4vec_reverse

      public void i4vec_reverse(int n, int[] a)

    • i4vec_sort_heap_a

      public void i4vec_sort_heap_a(int n, int[] a)

    • i4vec_sorted_unique

      public int i4vec_sorted_unique(int n, int[] a)

    • i4vec2_compare

      public int i4vec2_compare(int n, int[] a1, int[] a2, int i, int j)

    • i4vec2_sort_a

      void i4vec2_sort_a(int n, int[] a1, int[] a2)

    • i4vec2_sorted_unique

      public int i4vec2_sorted_unique(int n, int[] a1, int[] a2)

    • lrline

      int lrline(double xu, double yu, double xv1, double yv1, double xv2, double yv2, double dv)

    • lvec_print

      public void lvec_print(int n, int[] a, char[] title)

    • lvec_print

      public void lvec_print(int n, int[] a, String title)

    • mesh_base_one

      public void mesh_base_one(int node_num, int element_order, int element_num, int[] element_node)

    • mesh_base_zero

      public void mesh_base_zero(int node_num, int element_order, int element_num, int[] element_node)

    • node_merge

      public void node_merge(int dim_num, int node_num, double[] node_xy, double tolerance, int[] node_rep)

    • ns_adj_col_set

      public int ns_adj_col_set(int node_num, int triangle_num, int variable_num, int[] triangle_node, int[] triangle_neighbor, int[] node_u_variable, int[] node_v_variable, int[] node_p_variable, int[] adj_col)

    • ns_adj_count

      public int ns_adj_count(int node_num, int triangle_num, int variable_num, int[] triangle_node, int[] triangle_neighbor, int[] node_u_variable, int[] node_v_variable, int[] node_p_variable)

    • ns_adj_insert

      public void ns_adj_insert(int v1, int v2, int variable_num, int adj_num, int[] adj_col_free, int[] adj_row)

    • ns_adj_row_set

      public void ns_adj_row_set(int node_num, int triangle_num, int variable_num, int[] triangle_node, int[] triangle_neighbor, int[] node_u_variable, int[] node_v_variable, int[] node_p_variable, int adj_num, int[] adj_col, int[] adj_row)

    • perm_check2

      public int perm_check2(int n, int[] p, int base)

    • perm_inverse

      public void perm_inverse(int n, int[] p)

    • points_delaunay_naive_2d

      public int[] points_delaunay_naive_2d(int node_num, double[] node_xy, int[] triangle_num)

    • points_hull_2d

      public void points_hull_2d(int node_num, double[] node_xy, int[] hull_num, int[] hull)

    • points_point_near_naive_nd

      public int points_point_near_naive_nd(int dim_num, int nset, double[] pset, double[] ptest, double[] d_min)

    • q_measure

      public void q_measure(int n, double[] z, int triangle_order, int triangle_num, int[] triangle_node, double[] q_min, double[] q_max, double[] q_ave, double[] q_area)

    • quad_convex_random

      public void quad_convex_random(int[] seed, double[] xy)

    • r8_acos

      public double r8_acos(double c)

    • r8_nint

      public int r8_nint(double x)

    • r8_uniform_01

      public double r8_uniform_01(int[] seed)

    • r8mat_print

      public void r8mat_print(int m, int n, double[] a, char[] title)

    • r8mat_print_some

      void r8mat_print_some(int m, int n, double[] a, int ilo, int jlo, int ihi, int jhi, char[] title)

    • r8mat_transpose_print

      public void r8mat_transpose_print(int m, int n, double[] a, char[] title)

    • r8mat_transpose_print_some

      public void r8mat_transpose_print_some(int m, int n, double[] a, int ilo, int jlo, int ihi, int jhi, char[] title)

    • r8mat_transpose_print

      public void r8mat_transpose_print(int m, int n, double[] a, String title)

    • r8mat_transpose_print_some

      public void r8mat_transpose_print_some(int m, int n, double[] a, int ilo, int jlo, int ihi, int jhi, String title)

    • r8mat_uniform_01

      public void r8mat_uniform_01(int m, int n, int[] seed, double[] r)

    • r8tris2

      public int r8tris2(int node_num, double[] node_xy, int[] triangle_num, int[] triangle_node, int[] triangle_neighbor)

    • r8vec_bracket

      public void r8vec_bracket(int n, double[] x, double xval, int[] left, int[] right)

    • r8vec_max

      public double r8vec_max(int n, double[] r8vec)

    • r8vec_min

      public double r8vec_min(int n, double[] r8vec)

    • r82vec_permute

      public void r82vec_permute(int n, int[] p, int base, double[] a)

    • r82vec_sort_heap_index_a

      public int[] r82vec_sort_heap_index_a(int n, int base, double[] a)

    • s_len_trim

      public int s_len_trim(char[] s)

    • sort_heap_external

      public void sort_heap_external(int n, int[] indx, int[] i, int[] j, int isgn)

    • swapec

      public int swapec(int i, int[] top, int[] btri, int[] bedg, int node_num, double[] node_xy, int triangle_num, int[] triangle_node, int[] triangle_neighbor, int[] stack)

    • timestamp

      public void timestamp()

    • triangle_angles_2d_new

      public double[] triangle_angles_2d_new(double[] t)

    • triangle_area_2d

      public double triangle_area_2d(double[] t)

    • triangle_circumcenter_2d

      public double[] triangle_circumcenter_2d(double[] t)

    • triangle_order3_physical_to_reference

      public void triangle_order3_physical_to_reference(double[] t, int n, double[] phy, double[] ref)

    • triangle_order3_reference_to_physical

      public void triangle_order3_reference_to_physical(double[] t, int n, double[] ref, double[] phy)

    • triangle_order6_physical_to_reference

      public void triangle_order6_physical_to_reference(double[] t, int n, double[] phy, double[] ref)

    • triangle_order6_reference_to_physical

      public void triangle_order6_reference_to_physical(double[] t, int n, double[] ref, double[] phy)

    • triangle_reference_sample

      public void triangle_reference_sample(int n, int[] seed, double[] p)

    • triangle_sample

      public void triangle_sample(double[] t, int n, int[] seed, double[] p)

    • triangulation_area

      public double triangulation_area(int node_num, double[] node_xy, int element_order, int element_num, int[] element_node)

    • triangulation_areas

      public double triangulation_areas(int node_num, double[] node_xy, int triangle_order, int triangle_num, int[] triangle_node, double[] triangle_area)

    • triangulation_delaunay_discrepancy_compute

      public double triangulation_delaunay_discrepancy_compute(int node_num, double[] node_xy, int triangle_order, int triangle_num, int[] triangle_node, int[] triangle_neighbor, double[] angle_min, int[] angle_min_triangle, double[] angle_max, int[] angle_max_triangle)

    • triangulation_neighbor_elements

      public int[] triangulation_neighbor_elements(int triangle_order, int triangle_num, int[] triangle_node)

    • triangulation_node_order

      public int[] triangulation_node_order(int triangle_order, int triangle_num, int[] triangle_node, int node_num)

    • triangulation_order3_adj_count

      public int triangulation_order3_adj_count(int node_num, int triangle_num, int[] triangle_node, int[] triangle_neighbor, int[] adj_col)

    • triangulation_order3_adj_set

      public int[] triangulation_order3_adj_set(int node_num, int triangle_num, int[] triangle_node, int[] triangle_neighbor, int adj_num, int[] adj_col)

    • triangulation_order3_adj_set2

      public void triangulation_order3_adj_set2(int node_num, int triangle_num, int[] triangle_node, int[] triangle_neighbor, int adj_num, int[] adj_col, int[] ia, int[] ja)

    • triangulation_order3_adjacency

      public int[] triangulation_order3_adjacency(int node_num, int element_num, int[] element_node)

    • triangulation_order3_boundary_edge_count

      public int triangulation_order3_boundary_edge_count(int triangle_num, int[] triangle_node)

    • triangulation_order3_boundary_edge_count_euler

      public int triangulation_order3_boundary_edge_count_euler(int node_num, int triangle_num, int hole_num)

    • triangulation_order3_boundary_node

      public int[] triangulation_order3_boundary_node(int node_num, int triangle_num, int[] triangle_node)

    • triangulation_order3_check

      public int triangulation_order3_check(int node_num, int triangle_num, int[] triangle_node)

    • triangulation_order3_edge_check

      public int triangulation_order3_edge_check(int triangle_num, int[] triangle_node)

    • triangulation_order3_example1

      public void triangulation_order3_example1(int node_num, int triangle_num, double[] node_xy, int[] triangle_node, int[] triangle_neighbor)

    • triangulation_order3_example1_size

      public void triangulation_order3_example1_size(int[] node_num, int[] triangle_num, int[] hole_num)

    • triangulation_order3_example2

      void triangulation_order3_example2(int node_num, int triangle_num, double[] node_xy, int[] triangle_node, int[] triangle_neighbor)

    • triangulation_order3_example2_size

      public void triangulation_order3_example2_size(int[] node_num, int[] triangle_num, int[] hole_num)

    • triangulation_order3_neighbor

      public void triangulation_order3_neighbor(int triangle_num, int[] triangle_node, int t1, int s1, int[] t2, int[] s2)

    • triangulation_order3_neighbor_nodes

      public void triangulation_order3_neighbor_nodes(int node_num, int triangle_num, int[] triangle_node, int[] nabes_first, int[] nabes_num, int nabes_max, int[] nabes_dim, int[] nabes)

    • triangulation_order3_neighbor_nodes_print

      void triangulation_order3_neighbor_nodes_print(int node_num, int[] nabes_first, int[] nabes_num, int nabes_dim, int[] nabes)

    • triangulation_order3_print

      public void triangulation_order3_print(int node_num, int triangle_num, double[] node_xy, int[] triangle_node, int[] triangle_neighbor)

    • quad_fun

      public void quad_fun(int n, double[] xy_vec, double[] f_vec)

    • triangulation_order3_quad

      public void triangulation_order3_quad(int node_num, double[] node_xy, int triangle_order, int triangle_num, int[] triangle_node, int quad_num, double[] quad_xy, double[] quad_w, double[] quad_value, double[] region_area)

    • triangulation_order3_refine_compute

      public void triangulation_order3_refine_compute(int node_num1, int triangle_num1, double[] node_xy1, int[] triangle_node1, int node_num2, int triangle_num2, int[] edge_data, double[] node_xy2, int[] triangle_node2)

    • triangulation_order3_refine_size

      public void triangulation_order3_refine_size(int node_num1, int triangle_num1, int[] triangle_node1, int[] node_num2, int[] triangle_num2, int[] edge_data)

    • triangulation_order3_sample

      public void triangulation_order3_sample(int node_num, double[] node_xy, int triangle_num, int[] triangle_node, int num_ran, int[] seed, double[] xd, int[] td)

    • triangulation_order6_adj_count

      public int triangulation_order6_adj_count(int node_num, int triangle_num, int[] triangle_node, int[] triangle_neighbor, int[] adj_col)

    • triangulation_order6_adj_set

      public int[] triangulation_order6_adj_set(int node_num, int triangle_num, int[] triangle_node, int[] triangle_neighbor, int adj_num, int[] adj_col)

    • triangulation_order6_boundary_edge_count

      public int triangulation_order6_boundary_edge_count(int triangle_num, int[] triangle_node)

    • triangulation_order6_boundary_edge_count_euler

      public int triangulation_order6_boundary_edge_count_euler(int node_num, int triangle_num, int hole_num)

    • triangulation_order6_boundary_node

      public int[] triangulation_order6_boundary_node(int node_num, int triangle_num, int[] triangle_node)

    • triangulation_order6_example1

      public void triangulation_order6_example1(int node_num, int triangle_num, double[] node_xy, int[] triangle_node, int[] triangle_neighbor)

    • triangulation_order6_example1_size

      public void triangulation_order6_example1_size(int[] node_num, int[] triangle_num, int[] hole_num)

    • triangulation_order6_example2

      public void triangulation_order6_example2(int node_num, int triangle_num, double[] node_xy, int[] triangle_node, int[] triangle_neighbor)

    • triangulation_order6_example2_size

      public void triangulation_order6_example2_size(int[] node_num, int[] triangle_num, int[] hole_num)

    • triangulation_order6_neighbor

      public void triangulation_order6_neighbor(int triangle_num, int[] triangle_node, int t1, int s1, int[] t2, int[] s2)

    • triangulation_order6_print

      public void triangulation_order6_print(int node_num, int triangle_num, double[] node_xy, int[] triangle_node, int[] triangle_neighbor)

    • triangulation_order6_refine_compute

      public void triangulation_order6_refine_compute(int node_num1, int triangle_num1, double[] node_xy1, int[] triangle_node1, int node_num2, int triangle_num2, int[] edge_data, double[] node_xy2, int[] triangle_node2)

    • triangulation_order6_refine_size

      public void triangulation_order6_refine_size(int node_num1, int triangle_num1, int[] triangle_node1, int[] node_num2, int[] triangle_num2, int[] edge_data)

    • triangulation_order6_to_order3

      public int[] triangulation_order6_to_order3(int triangle_num1, int[] triangle_node1)

    • triangulation_order6_vertex_count

      public int triangulation_order6_vertex_count(int tri_num, int[] triangle_node)

    • triangulation_search_delaunay

      public void triangulation_search_delaunay(int node_num, double[] node_xy, int triangle_order, int triangle_num, int[] triangle_node, int[] triangle_neighbor, double[] p, int[] triangle_index, double[] alpha, double[] beta, double[] gamma, int[] edge, int[] step_num)

    • triangulation_search_naive

      public int triangulation_search_naive(int node_num, double[] node_xy, int triangle_order, int triangle_num, int[] triangle_node, double[] p)

    • vbedg

      public void vbedg(double x, double y, int node_num, double[] node_xy, int triangle_num, int[] triangle_node, int[] triangle_neighbor, int[] ltri, int[] ledg, int[] rtri, int[] redg)

    • voronoi_polygon_area

      public double voronoi_polygon_area(int node, int neighbor_num, int[] neighbor_index, int node_num, double[] node_xy)

    • voronoi_polygon_centroid

      public double[] voronoi_polygon_centroid(int node, int neighbor_num, int[] neighbor_index, int node_num, double[] node_xy)

    • voronoi_polygon_vertices

      public void voronoi_polygon_vertices(int node, int neighbor_num, int[] neighbor_index, int node_num, double[] node_xy, double[] v)

    • test01

      public void test01()

    • test02

      public void test02()

    • test025

      public void test025()

    • test026

      public void test026()

    • test03

      public void test03()

    • test04

      public void test04()

    • test05

      public void test05()

    • test06

      public void test06()

    • test07

      public void test07()

    • test08

      public void test08()

    • test09

      public void test09()

    • test10

      public void test10()

    • test11

      public void test11()

    • test12

      public void test12()

    • test125

      public void test125()

    • test127

      public void test127()

    • test13

      public void test13()

    • test14

      public void test14()

    • test15

      public void test15()

    • test16

      public void test16()

    • test17

      public void test17()

    • test18

      public void test18()

    • test19

      public void test19()

    • test20

      public void test20()

    • test21

      public void test21()

    • test213

      public void test213()

    • test215

      public void test215()

    • test217

      public void test217()

    • test219

      public void test219()

    • test22

      public void test22()

    • test23

      public void test23()

    • test24

      public void test24()

    • test25

      public void test25()

    • test26

      public void test26()

    • test265

      public void test265()

    • test27

      public void test27()

    • test31

      public void test31()

    • test32

      public void test32()

    • test33

      public void test33()