merge_r.h
Go to the documentation of this file.
1 /*<html><pre> -<a href="qh-merge_r.htm"
2  >-------------------------------</a><a name="TOP">-</a>
3 
4  merge_r.h
5  header file for merge_r.c
6 
7  see qh-merge_r.htm and merge_r.c
8 
9  Copyright (c) 1993-2015 C.B. Barber.
10  $Id: //main/2015/qhull/src/libqhull_r/merge_r.h#2 $$Change: 2042 $
11  $DateTime: 2016/01/03 13:26:21 $$Author: bbarber $
12 */
13 
14 #ifndef qhDEFmerge
15 #define qhDEFmerge 1
16 
17 #include "libqhull_r.h"
18 
19 
20 /*============ -constants- ==============*/
21 
22 /*-<a href="qh-merge_r.htm#TOC"
23  >--------------------------------</a><a name="qh_ANGLEredundant">-</a>
24 
25  qh_ANGLEredundant
26  indicates redundant merge in mergeT->angle
27 */
28 #define qh_ANGLEredundant 6.0
29 
30 /*-<a href="qh-merge_r.htm#TOC"
31  >--------------------------------</a><a name="qh_ANGLEdegen">-</a>
32 
33  qh_ANGLEdegen
34  indicates degenerate facet in mergeT->angle
35 */
36 #define qh_ANGLEdegen 5.0
37 
38 /*-<a href="qh-merge_r.htm#TOC"
39  >--------------------------------</a><a name="qh_ANGLEconcave">-</a>
40 
41  qh_ANGLEconcave
42  offset to indicate concave facets in mergeT->angle
43 
44  notes:
45  concave facets are assigned the range of [2,4] in mergeT->angle
46  roundoff error may make the angle less than 2
47 */
48 #define qh_ANGLEconcave 1.5
49 
50 /*-<a href="qh-merge_r.htm#TOC"
51  >--------------------------------</a><a name="MRG">-</a>
52 
53  MRG... (mergeType)
54  indicates the type of a merge (mergeT->type)
55 */
56 typedef enum { /* in sort order for facet_mergeset */
57  MRGnone= 0,
58  MRGcoplanar, /* centrum coplanar */
59  MRGanglecoplanar, /* angle coplanar */
60  /* could detect half concave ridges */
61  MRGconcave, /* concave ridge */
62  MRGflip, /* flipped facet. facet1 == facet2 */
63  MRGridge, /* duplicate ridge (qh_MERGEridge) */
64  /* degen and redundant go onto degen_mergeset */
65  MRGdegen, /* degenerate facet (!enough neighbors) facet1 == facet2 */
66  MRGredundant, /* redundant facet (vertex subset) */
67  /* merge_degenredundant assumes degen < redundant */
68  MRGmirror, /* mirror facet from qh_triangulate */
69  ENDmrg
70 } mergeType;
71 
72 /*-<a href="qh-merge_r.htm#TOC"
73  >--------------------------------</a><a name="qh_MERGEapex">-</a>
74 
75  qh_MERGEapex
76  flag for qh_mergefacet() to indicate an apex merge
77 */
78 #define qh_MERGEapex True
79 
80 /*============ -structures- ====================*/
81 
82 /*-<a href="qh-merge_r.htm#TOC"
83  >--------------------------------</a><a name="mergeT">-</a>
84 
85  mergeT
86  structure used to merge facets
87 */
88 
89 typedef struct mergeT mergeT;
90 struct mergeT { /* initialize in qh_appendmergeset */
91  realT angle; /* angle between normals of facet1 and facet2 */
92  facetT *facet1; /* will merge facet1 into facet2 */
93  facetT *facet2;
94  mergeType type;
95 };
96 
97 
98 /*=========== -macros- =========================*/
99 
100 /*-<a href="qh-merge_r.htm#TOC"
101  >--------------------------------</a><a name="FOREACHmerge_">-</a>
102 
103  FOREACHmerge_( merges ) {...}
104  assign 'merge' to each merge in merges
105 
106  notes:
107  uses 'mergeT *merge, **mergep;'
108  if qh_mergefacet(),
109  restart since qh.facet_mergeset may change
110  see <a href="qset_r.h#FOREACHsetelement_">FOREACHsetelement_</a>
111 */
112 #define FOREACHmerge_( merges ) FOREACHsetelement_(mergeT, merges, merge)
113 
114 /*============ prototypes in alphabetical order after pre/postmerge =======*/
115 
116 void qh_premerge(qhT *qh, vertexT *apex, realT maxcentrum, realT maxangle);
117 void qh_postmerge(qhT *qh, const char *reason, realT maxcentrum, realT maxangle,
118  boolT vneighbors);
119 void qh_all_merges(qhT *qh, boolT othermerge, boolT vneighbors);
120 void qh_appendmergeset(qhT *qh, facetT *facet, facetT *neighbor, mergeType mergetype, realT *angle);
121 setT *qh_basevertices(qhT *qh, facetT *samecycle);
122 void qh_checkconnect(qhT *qh /* qh.new_facets */);
123 boolT qh_checkzero(qhT *qh, boolT testall);
124 int qh_compareangle(const void *p1, const void *p2);
125 int qh_comparemerge(const void *p1, const void *p2);
126 int qh_comparevisit(const void *p1, const void *p2);
127 void qh_copynonconvex(qhT *qh, ridgeT *atridge);
128 void qh_degen_redundant_facet(qhT *qh, facetT *facet);
129 void qh_degen_redundant_neighbors(qhT *qh, facetT *facet, facetT *delfacet);
130 vertexT *qh_find_newvertex(qhT *qh, vertexT *oldvertex, setT *vertices, setT *ridges);
131 void qh_findbest_test(qhT *qh, boolT testcentrum, facetT *facet, facetT *neighbor,
132  facetT **bestfacet, realT *distp, realT *mindistp, realT *maxdistp);
133 facetT *qh_findbestneighbor(qhT *qh, facetT *facet, realT *distp, realT *mindistp, realT *maxdistp);
134 void qh_flippedmerges(qhT *qh, facetT *facetlist, boolT *wasmerge);
135 void qh_forcedmerges(qhT *qh, boolT *wasmerge);
136 void qh_getmergeset(qhT *qh, facetT *facetlist);
137 void qh_getmergeset_initial(qhT *qh, facetT *facetlist);
138 void qh_hashridge(qhT *qh, setT *hashtable, int hashsize, ridgeT *ridge, vertexT *oldvertex);
139 ridgeT *qh_hashridge_find(qhT *qh, setT *hashtable, int hashsize, ridgeT *ridge,
140  vertexT *vertex, vertexT *oldvertex, int *hashslot);
141 void qh_makeridges(qhT *qh, facetT *facet);
142 void qh_mark_dupridges(qhT *qh, facetT *facetlist);
143 void qh_maydropneighbor(qhT *qh, facetT *facet);
144 int qh_merge_degenredundant(qhT *qh);
145 void qh_merge_nonconvex(qhT *qh, facetT *facet1, facetT *facet2, mergeType mergetype);
146 void qh_mergecycle(qhT *qh, facetT *samecycle, facetT *newfacet);
147 void qh_mergecycle_all(qhT *qh, facetT *facetlist, boolT *wasmerge);
148 void qh_mergecycle_facets(qhT *qh, facetT *samecycle, facetT *newfacet);
149 void qh_mergecycle_neighbors(qhT *qh, facetT *samecycle, facetT *newfacet);
150 void qh_mergecycle_ridges(qhT *qh, facetT *samecycle, facetT *newfacet);
151 void qh_mergecycle_vneighbors(qhT *qh, facetT *samecycle, facetT *newfacet);
152 void qh_mergefacet(qhT *qh, facetT *facet1, facetT *facet2, realT *mindist, realT *maxdist, boolT mergeapex);
153 void qh_mergefacet2d(qhT *qh, facetT *facet1, facetT *facet2);
154 void qh_mergeneighbors(qhT *qh, facetT *facet1, facetT *facet2);
155 void qh_mergeridges(qhT *qh, facetT *facet1, facetT *facet2);
156 void qh_mergesimplex(qhT *qh, facetT *facet1, facetT *facet2, boolT mergeapex);
157 void qh_mergevertex_del(qhT *qh, vertexT *vertex, facetT *facet1, facetT *facet2);
158 void qh_mergevertex_neighbors(qhT *qh, facetT *facet1, facetT *facet2);
159 void qh_mergevertices(qhT *qh, setT *vertices1, setT **vertices);
160 setT *qh_neighbor_intersections(qhT *qh, vertexT *vertex);
161 void qh_newvertices(qhT *qh, setT *vertices);
162 boolT qh_reducevertices(qhT *qh);
163 vertexT *qh_redundant_vertex(qhT *qh, vertexT *vertex);
164 boolT qh_remove_extravertices(qhT *qh, facetT *facet);
165 vertexT *qh_rename_sharedvertex(qhT *qh, vertexT *vertex, facetT *facet);
166 void qh_renameridgevertex(qhT *qh, ridgeT *ridge, vertexT *oldvertex, vertexT *newvertex);
167 void qh_renamevertex(qhT *qh, vertexT *oldvertex, vertexT *newvertex, setT *ridges,
168  facetT *oldfacet, facetT *neighborA);
169 boolT qh_test_appendmerge(qhT *qh, facetT *facet, facetT *neighbor);
170 boolT qh_test_vneighbors(qhT *qh /* qh.newfacet_list */);
171 void qh_tracemerge(qhT *qh, facetT *facet1, facetT *facet2);
172 void qh_tracemerging(qhT *qh);
173 void qh_updatetested(qhT *qh, facetT *facet1, facetT *facet2);
174 setT *qh_vertexridges(qhT *qh, vertexT *vertex);
175 void qh_vertexridges_facet(qhT *qh, vertexT *vertex, facetT *facet, setT **ridges);
176 void qh_willdelete(qhT *qh, facetT *facet, facetT *replace);
177 
178 #endif /* qhDEFmerge */
qh_mergecycle
void qh_mergecycle(qhT *qh, facetT *samecycle, facetT *newfacet)
Definition: merge_r.c:1750
qhT
Definition: libqhull.h:465
qh_mark_dupridges
void qh_mark_dupridges(qhT *qh, facetT *facetlist)
Definition: merge_r.c:1459
qh_mergevertex_neighbors
void qh_mergevertex_neighbors(qhT *qh, facetT *facet1, facetT *facet2)
Definition: merge_r.c:2749
qh_hashridge_find
ridgeT * qh_hashridge_find(qhT *qh, setT *hashtable, int hashsize, ridgeT *ridge, vertexT *vertex, vertexT *oldvertex, int *hashslot)
Definition: merge_r.c:1318
mergeT::facet2
facetT * facet2
Definition: merge.h:93
boolT
#define boolT
Definition: libqhull.h:121
qh_comparemerge
int qh_comparemerge(const void *p1, const void *p2)
Definition: merge.c:581
setT
Definition: qset.h:83
qh_updatetested
void qh_updatetested(qhT *qh, facetT *facet1, facetT *facet2)
Definition: merge_r.c:3502
qh_mergevertices
void qh_mergevertices(qhT *qh, setT *vertices1, setT **vertices)
Definition: merge_r.c:2787
qh_renameridgevertex
void qh_renameridgevertex(qhT *qh, ridgeT *ridge, vertexT *oldvertex, vertexT *newvertex)
Definition: merge_r.c:3150
ENDmrg
Definition: merge_r.h:69
qh_hashridge
void qh_hashridge(qhT *qh, setT *hashtable, int hashsize, ridgeT *ridge, vertexT *oldvertex)
Definition: merge_r.c:1275
octree.p1
tuple p1
Definition: octree.py:55
qh_mergecycle_all
void qh_mergecycle_all(qhT *qh, facetT *facetlist, boolT *wasmerge)
Definition: merge_r.c:1840
qh_degen_redundant_facet
void qh_degen_redundant_facet(qhT *qh, facetT *facet)
Definition: merge_r.c:647
mergeT::angle
realT angle
Definition: merge.h:91
qh_tracemerging
void qh_tracemerging(qhT *qh)
Definition: merge_r.c:3460
qh_remove_extravertices
boolT qh_remove_extravertices(qhT *qh, facetT *facet)
Definition: merge_r.c:3028
qh_mergecycle_facets
void qh_mergecycle_facets(qhT *qh, facetT *samecycle, facetT *newfacet)
Definition: merge_r.c:1928
qh_getmergeset
void qh_getmergeset(qhT *qh, facetT *facetlist)
Definition: merge_r.c:1150
qh_flippedmerges
void qh_flippedmerges(qhT *qh, facetT *facetlist, boolT *wasmerge)
Definition: merge_r.c:981
qh_findbestneighbor
facetT * qh_findbestneighbor(qhT *qh, facetT *facet, realT *distp, realT *mindistp, realT *maxdistp)
Definition: merge_r.c:913
qh_postmerge
void qh_postmerge(qhT *qh, const char *reason, realT maxcentrum, realT maxangle, boolT vneighbors)
Definition: merge_r.c:129
qh_copynonconvex
void qh_copynonconvex(qhT *qh, ridgeT *atridge)
Definition: merge_r.c:613
qh_vertexridges
setT * qh_vertexridges(qhT *qh, vertexT *vertex)
Definition: merge_r.c:3545
qh_makeridges
void qh_makeridges(qhT *qh, facetT *facet)
Definition: merge_r.c:1369
mergeT::type
mergeType type
Definition: merge.h:94
qh_redundant_vertex
vertexT * qh_redundant_vertex(qhT *qh, vertexT *vertex)
Definition: merge_r.c:2996
qh_findbest_test
void qh_findbest_test(qhT *qh, boolT testcentrum, facetT *facet, facetT *neighbor, facetT **bestfacet, realT *distp, realT *mindistp, realT *maxdistp)
Definition: merge_r.c:860
qh_basevertices
setT * qh_basevertices(qhT *qh, facetT *samecycle)
Definition: merge_r.c:384
qh_renamevertex
void qh_renamevertex(qhT *qh, vertexT *oldvertex, vertexT *newvertex, setT *ridges, facetT *oldfacet, facetT *neighborA)
Definition: merge_r.c:3212
qh_vertexridges_facet
void qh_vertexridges_facet(qhT *qh, vertexT *vertex, facetT *facet, setT **ridges)
Definition: merge_r.c:3586
qh_test_appendmerge
boolT qh_test_appendmerge(qhT *qh, facetT *facet, facetT *neighbor)
Definition: merge_r.c:3292
MRGanglecoplanar
Definition: merge_r.h:59
mergeType
mergeType
Definition: merge.h:56
qh_mergecycle_neighbors
void qh_mergecycle_neighbors(qhT *qh, facetT *samecycle, facetT *newfacet)
Definition: merge_r.c:1986
qh_mergecycle_ridges
void qh_mergecycle_ridges(qhT *qh, facetT *samecycle, facetT *newfacet)
Definition: merge_r.c:2083
qh_degen_redundant_neighbors
void qh_degen_redundant_neighbors(qhT *qh, facetT *facet, facetT *delfacet)
Definition: merge_r.c:703
MRGconcave
Definition: merge_r.h:61
MRGdegen
Definition: merge_r.h:65
mergeT
Definition: merge.h:90
qh_all_merges
void qh_all_merges(qhT *qh, boolT othermerge, boolT vneighbors)
Definition: merge_r.c:215
qh
#define qh
Definition: libqhull.h:457
libqhull_r.h
qh_merge_nonconvex
void qh_merge_nonconvex(qhT *qh, facetT *facet1, facetT *facet2, mergeType mergetype)
Definition: merge_r.c:1672
qh_mergefacet2d
void qh_mergefacet2d(qhT *qh, facetT *facet1, facetT *facet2)
Definition: merge_r.c:2421
qh_mergeridges
void qh_mergeridges(qhT *qh, facetT *facet1, facetT *facet2)
Definition: merge_r.c:2544
qh_mergefacet
void qh_mergefacet(qhT *qh, facetT *facet1, facetT *facet2, realT *mindist, realT *maxdist, boolT mergeapex)
Definition: merge_r.c:2270
qh_test_vneighbors
boolT qh_test_vneighbors(qhT *qh)
Definition: merge_r.c:3375
MRGmirror
Definition: merge_r.h:68
qh_find_newvertex
vertexT * qh_find_newvertex(qhT *qh, vertexT *oldvertex, setT *vertices, setT *ridges)
Definition: merge_r.c:773
qh_tracemerge
void qh_tracemerge(qhT *qh, facetT *facet1, facetT *facet2)
Definition: merge_r.c:3411
qh_comparevisit
int qh_comparevisit(const void *p1, const void *p2)
Definition: merge.c:593
qh_mergesimplex
void qh_mergesimplex(qhT *qh, facetT *facet1, facetT *facet2, boolT mergeapex)
Definition: merge_r.c:2611
MRGredundant
Definition: merge_r.h:66
qh_appendmergeset
void qh_appendmergeset(qhT *qh, facetT *facet, facetT *neighbor, mergeType mergetype, realT *angle)
Definition: merge_r.c:320
qh_mergeneighbors
void qh_mergeneighbors(qhT *qh, facetT *facet1, facetT *facet2)
Definition: merge_r.c:2496
MRGridge
Definition: merge_r.h:63
qh_compareangle
int qh_compareangle(const void *p1, const void *p2)
Definition: merge.c:569
qh_neighbor_intersections
setT * qh_neighbor_intersections(qhT *qh, vertexT *vertex)
Definition: merge_r.c:2840
mergeType
mergeType
Definition: merge_r.h:56
qh_rename_sharedvertex
vertexT * qh_rename_sharedvertex(qhT *qh, vertexT *vertex, facetT *facet)
Definition: merge_r.c:3087
MRGnone
Definition: merge_r.h:57
mergeT::facet1
facetT * facet1
Definition: merge.h:92
qh_maydropneighbor
void qh_maydropneighbor(qhT *qh, facetT *facet)
Definition: merge_r.c:1523
qh_newvertices
void qh_newvertices(qhT *qh, setT *vertices)
Definition: merge_r.c:2886
qh_merge_degenredundant
int qh_merge_degenredundant(qhT *qh)
Definition: merge_r.c:1583
MRGcoplanar
Definition: merge_r.h:58
qh_reducevertices
boolT qh_reducevertices(qhT *qh)
Definition: merge_r.c:2924
qh_premerge
void qh_premerge(qhT *qh, vertexT *apex, realT maxcentrum, realT maxangle)
Definition: merge_r.c:56
qh_forcedmerges
void qh_forcedmerges(qhT *qh, boolT *wasmerge)
Definition: merge_r.c:1055
qh_checkconnect
void qh_checkconnect(qhT *qh)
Definition: merge_r.c:425
qh_getmergeset_initial
void qh_getmergeset_initial(qhT *qh, facetT *facetlist)
Definition: merge_r.c:1223
qh_willdelete
void qh_willdelete(qhT *qh, facetT *facet, facetT *replace)
Definition: merge_r.c:3609
qh_mergevertex_del
void qh_mergevertex_del(qhT *qh, vertexT *vertex, facetT *facet1, facetT *facet2)
Definition: merge_r.c:2723
qh_mergecycle_vneighbors
void qh_mergecycle_vneighbors(qhT *qh, facetT *samecycle, facetT *newfacet)
Definition: merge_r.c:2185
qh_checkzero
boolT qh_checkzero(qhT *qh, boolT testall)
Definition: merge_r.c:488
MRGflip
Definition: merge_r.h:62
realT
#define realT
Definition: user.h:154

hpp-fcl
Author(s):
autogenerated on Fri Jun 2 2023 02:39:01