Home
last modified time | relevance | path

Searched refs:newfacet (Results 1 – 25 of 167) sorted by relevance

1234567

/dports/science/berkeleygw/BGW-2.0.0/Common/qhull/
H A Dpoly.c192 ridge->top= newfacet; in qh_attachnewfacets()
480 facetT *newfacet; in qh_makenewfacet() local
489 newfacet= qh_newfacet(); in qh_makenewfacet()
494 qh_appendfacet(newfacet); in qh_makenewfacet()
495 return(newfacet); in qh_makenewfacet()
514 facetT *newfacet; in qh_makenewplanes() local
591 newfacet->f.samecycle= newfacet; in qh_makenew_nonsimplicial()
631 return newfacet; in qh_makenew_nonsimplicial()
679 newfacet->f.samecycle= newfacet; in qh_makenew_simplicial()
690 return newfacet; in qh_makenew_simplicial()
[all …]
H A Dpoly.h89 #define FORALLnew_facets for ( newfacet=qh newfacet_list;newfacet && newfacet->next;newfacet=newfac…
125 #define FORALLsame_(newfacet) for (same= newfacet->f.samecycle; same != newfacet; same= same->f.sam… argument
137 #define FORALLsame_cycle_(newfacet) \ argument
138 for (same= newfacet->f.samecycle; \
139 same; same= (same == newfacet ? NULL : same->f.samecycle))
180 #define FOREACHnewfacet_(facets) FOREACHsetelement_(facetT, facets, newfacet)
222 void qh_matchneighbor(facetT *newfacet, int newskip, int hashsize,
/dports/science/afni/afni-AFNI_21.3.16/src/qhulldir/
H A Dpoly.c192 ridge->top= newfacet; in qh_attachnewfacets()
480 facetT *newfacet; in qh_makenewfacet() local
489 newfacet= qh_newfacet(); in qh_makenewfacet()
494 qh_appendfacet(newfacet); in qh_makenewfacet()
495 return(newfacet); in qh_makenewfacet()
514 facetT *newfacet; in qh_makenewplanes() local
591 newfacet->f.samecycle= newfacet; in qh_makenew_nonsimplicial()
631 return newfacet; in qh_makenew_nonsimplicial()
679 newfacet->f.samecycle= newfacet; in qh_makenew_simplicial()
690 return newfacet; in qh_makenew_simplicial()
[all …]
H A Dpoly.h89 #define FORALLnew_facets for ( newfacet=qh newfacet_list;newfacet && newfacet->next;newfacet=newfac…
125 #define FORALLsame_(newfacet) for (same= newfacet->f.samecycle; same != newfacet; same= same->f.sam… argument
137 #define FORALLsame_cycle_(newfacet) \ argument
138 for (same= newfacet->f.samecycle; \
139 same; same= (same == newfacet ? NULL : same->f.samecycle))
180 #define FOREACHnewfacet_(facets) FOREACHsetelement_(facetT, facets, newfacet)
222 void qh_matchneighbor(facetT *newfacet, int newskip, int hashsize,
/dports/math/py-matplotlib2/matplotlib-2.2.4/extern/libqhull/
H A Dpoly.c192 ridge->top= newfacet; in qh_attachnewfacets()
480 facetT *newfacet; in qh_makenewfacet() local
489 newfacet= qh_newfacet(); in qh_makenewfacet()
494 qh_appendfacet(newfacet); in qh_makenewfacet()
495 return(newfacet); in qh_makenewfacet()
514 facetT *newfacet; in qh_makenewplanes() local
591 newfacet->f.samecycle= newfacet; in qh_makenew_nonsimplicial()
631 return newfacet; in qh_makenew_nonsimplicial()
679 newfacet->f.samecycle= newfacet; in qh_makenew_simplicial()
690 return newfacet; in qh_makenew_simplicial()
[all …]
H A Dpoly.h89 #define FORALLnew_facets for ( newfacet=qh newfacet_list;newfacet && newfacet->next;newfacet=newfac…
125 #define FORALLsame_(newfacet) for (same= newfacet->f.samecycle; same != newfacet; same= same->f.sam… argument
137 #define FORALLsame_cycle_(newfacet) \ argument
138 for (same= newfacet->f.samecycle; \
139 same; same= (same == newfacet ? NULL : same->f.samecycle))
180 #define FOREACHnewfacet_(facets) FOREACHsetelement_(facetT, facets, newfacet)
222 void qh_matchneighbor(facetT *newfacet, int newskip, int hashsize,
/dports/cad/meshlab/meshlab-Meshlab-2020.05/src/external/qhull-2003.1/src/
H A Dpoly.c188 ridge->bottom= newfacet; in qh_attachnewfacets()
190 ridge->top= newfacet; in qh_attachnewfacets()
464 facetT *newfacet; in qh_makenewfacet() local
479 return(newfacet); in qh_makenewfacet()
498 facetT *newfacet; in qh_makenewplanes() local
575 newfacet->f.samecycle= newfacet; in qh_makenew_nonsimplicial()
615 return newfacet; in qh_makenew_nonsimplicial()
663 newfacet->f.samecycle= newfacet; in qh_makenew_simplicial()
674 return newfacet; in qh_makenew_simplicial()
857 if (facet == newfacet) in qh_matchnewfacets()
[all …]
H A Dpoly.h85 #define FORALLnew_facets for( newfacet=qh newfacet_list;newfacet && newfacet->next;newfacet=newface…
121 #define FORALLsame_(newfacet) for (same= newfacet->f.samecycle; same != newfacet; same= same->f.sam… argument
133 #define FORALLsame_cycle_(newfacet) \ argument
134 for (same= newfacet->f.samecycle; \
135 same; same= (same == newfacet ? NULL : same->f.samecycle))
176 #define FOREACHnewfacet_(facets) FOREACHsetelement_(facetT, facets, newfacet)
218 void qh_matchneighbor (facetT *newfacet, int newskip, int hashsize,
/dports/math/libmesh/libmesh-1.6.2/contrib/qhull/2012.1/src/libqhull/
H A Dpoly.c192 ridge->top= newfacet; in qh_attachnewfacets()
480 facetT *newfacet; in qh_makenewfacet() local
489 newfacet= qh_newfacet(); in qh_makenewfacet()
494 qh_appendfacet(newfacet); in qh_makenewfacet()
495 return(newfacet); in qh_makenewfacet()
514 facetT *newfacet; in qh_makenewplanes() local
591 newfacet->f.samecycle= newfacet; in qh_makenew_nonsimplicial()
631 return newfacet; in qh_makenew_nonsimplicial()
679 newfacet->f.samecycle= newfacet; in qh_makenew_simplicial()
690 return newfacet; in qh_makenew_simplicial()
[all …]
H A Dpoly.h89 #define FORALLnew_facets for ( newfacet=qh newfacet_list;newfacet && newfacet->next;newfacet=newfac…
125 #define FORALLsame_(newfacet) for (same= newfacet->f.samecycle; same != newfacet; same= same->f.sam… argument
137 #define FORALLsame_cycle_(newfacet) \ argument
138 for (same= newfacet->f.samecycle; \
139 same; same= (same == newfacet ? NULL : same->f.samecycle))
180 #define FOREACHnewfacet_(facets) FOREACHsetelement_(facetT, facets, newfacet)
222 void qh_matchneighbor(facetT *newfacet, int newskip, int hashsize,
/dports/graphics/py-gdal/gdal-3.3.3/alg/internal_libqhull/
H A Dpoly.c192 ridge->top= newfacet; in qh_attachnewfacets()
480 facetT *newfacet; in qh_makenewfacet() local
489 newfacet= qh_newfacet(); in qh_makenewfacet()
494 qh_appendfacet(newfacet); in qh_makenewfacet()
495 return(newfacet); in qh_makenewfacet()
514 facetT *newfacet; in qh_makenewplanes() local
591 newfacet->f.samecycle= newfacet; in qh_makenew_nonsimplicial()
631 return newfacet; in qh_makenew_nonsimplicial()
679 newfacet->f.samecycle= newfacet; in qh_makenew_simplicial()
690 return newfacet; in qh_makenew_simplicial()
[all …]
H A Dpoly.h89 #define FORALLnew_facets for ( newfacet=qh newfacet_list;newfacet && newfacet->next;newfacet=newfac…
125 #define FORALLsame_(newfacet) for (same= newfacet->f.samecycle; same != newfacet; same= same->f.sam… argument
137 #define FORALLsame_cycle_(newfacet) \ argument
138 for (same= newfacet->f.samecycle; \
139 same; same= (same == newfacet ? NULL : same->f.samecycle))
180 #define FOREACHnewfacet_(facets) FOREACHsetelement_(facetT, facets, newfacet)
222 void qh_matchneighbor(facetT *newfacet, int newskip, int hashsize,
/dports/cad/PrusaSlicer/PrusaSlicer-version_2.3.3/src/qhull/src/libqhull/
H A Dpoly.c192 ridge->top= newfacet; in qh_attachnewfacets()
480 facetT *newfacet; in qh_makenewfacet() local
489 newfacet= qh_newfacet(); in qh_makenewfacet()
494 qh_appendfacet(newfacet); in qh_makenewfacet()
495 return(newfacet); in qh_makenewfacet()
514 facetT *newfacet; in qh_makenewplanes() local
591 newfacet->f.samecycle= newfacet; in qh_makenew_nonsimplicial()
631 return newfacet; in qh_makenew_nonsimplicial()
679 newfacet->f.samecycle= newfacet; in qh_makenew_simplicial()
690 return newfacet; in qh_makenew_simplicial()
[all …]
H A Dpoly.h89 #define FORALLnew_facets for ( newfacet=qh newfacet_list;newfacet && newfacet->next;newfacet=newfac…
125 #define FORALLsame_(newfacet) for (same= newfacet->f.samecycle; same != newfacet; same= same->f.sam… argument
137 #define FORALLsame_cycle_(newfacet) \ argument
138 for (same= newfacet->f.samecycle; \
139 same; same= (same == newfacet ? NULL : same->f.samecycle))
180 #define FOREACHnewfacet_(facets) FOREACHsetelement_(facetT, facets, newfacet)
222 void qh_matchneighbor(facetT *newfacet, int newskip, int hashsize,
/dports/math/py-pyhull/pyhull-2015.2.1/src/libqhull/
H A Dpoly.c192 ridge->top= newfacet; in qh_attachnewfacets()
480 facetT *newfacet; in qh_makenewfacet() local
489 newfacet= qh_newfacet(); in qh_makenewfacet()
494 qh_appendfacet(newfacet); in qh_makenewfacet()
495 return(newfacet); in qh_makenewfacet()
514 facetT *newfacet; in qh_makenewplanes() local
591 newfacet->f.samecycle= newfacet; in qh_makenew_nonsimplicial()
631 return newfacet; in qh_makenew_nonsimplicial()
679 newfacet->f.samecycle= newfacet; in qh_makenew_simplicial()
690 return newfacet; in qh_makenew_simplicial()
[all …]
H A Dpoly.h89 #define FORALLnew_facets for ( newfacet=qh newfacet_list;newfacet && newfacet->next;newfacet=newfac…
125 #define FORALLsame_(newfacet) for (same= newfacet->f.samecycle; same != newfacet; same= same->f.sam… argument
137 #define FORALLsame_cycle_(newfacet) \ argument
138 for (same= newfacet->f.samecycle; \
139 same; same= (same == newfacet ? NULL : same->f.samecycle))
180 #define FOREACHnewfacet_(facets) FOREACHsetelement_(facetT, facets, newfacet)
222 void qh_matchneighbor(facetT *newfacet, int newskip, int hashsize,
/dports/graphics/p5-Geo-GDAL/gdal-3.3.3/alg/internal_libqhull/
H A Dpoly.c192 ridge->top= newfacet; in qh_attachnewfacets()
480 facetT *newfacet; in qh_makenewfacet() local
489 newfacet= qh_newfacet(); in qh_makenewfacet()
494 qh_appendfacet(newfacet); in qh_makenewfacet()
495 return(newfacet); in qh_makenewfacet()
514 facetT *newfacet; in qh_makenewplanes() local
591 newfacet->f.samecycle= newfacet; in qh_makenew_nonsimplicial()
631 return newfacet; in qh_makenew_nonsimplicial()
679 newfacet->f.samecycle= newfacet; in qh_makenew_simplicial()
690 return newfacet; in qh_makenew_simplicial()
[all …]
H A Dpoly.h89 #define FORALLnew_facets for ( newfacet=qh newfacet_list;newfacet && newfacet->next;newfacet=newfac…
125 #define FORALLsame_(newfacet) for (same= newfacet->f.samecycle; same != newfacet; same= same->f.sam… argument
137 #define FORALLsame_cycle_(newfacet) \ argument
138 for (same= newfacet->f.samecycle; \
139 same; same= (same == newfacet ? NULL : same->f.samecycle))
180 #define FOREACHnewfacet_(facets) FOREACHsetelement_(facetT, facets, newfacet)
222 void qh_matchneighbor(facetT *newfacet, int newskip, int hashsize,
/dports/math/qhull8/qhull-8.0.2/src/libqhull/
H A Dpoly.c80 vertex->newfacet= True; in qh_appendvertex()
532 facetT *newfacet; in qh_makenewfacet() local
541 newfacet= qh_newfacet(); in qh_makenewfacet()
547 qh_appendfacet(newfacet); in qh_makenewfacet()
548 return(newfacet); in qh_makenewfacet()
567 facetT *newfacet; in qh_makenewplanes() local
651 newfacet->f.samecycle= newfacet; in qh_makenew_nonsimplicial()
691 return newfacet; in qh_makenew_nonsimplicial()
744 newfacet->f.samecycle= newfacet; in qh_makenew_simplicial()
755 return newfacet; in qh_makenew_simplicial()
[all …]
/dports/math/qhull/qhull-7.3.2/src/libqhull/
H A Dpoly.c80 vertex->newfacet= True; in qh_appendvertex()
532 facetT *newfacet; in qh_makenewfacet() local
541 newfacet= qh_newfacet(); in qh_makenewfacet()
547 qh_appendfacet(newfacet); in qh_makenewfacet()
548 return(newfacet); in qh_makenewfacet()
567 facetT *newfacet; in qh_makenewplanes() local
651 newfacet->f.samecycle= newfacet; in qh_makenew_nonsimplicial()
691 return newfacet; in qh_makenew_nonsimplicial()
744 newfacet->f.samecycle= newfacet; in qh_makenew_simplicial()
755 return newfacet; in qh_makenew_simplicial()
[all …]
/dports/science/py-scipy/scipy-1.7.1/scipy/spatial/qhull_src/src/
H A Dpoly_r.c80 vertex->newfacet= True; in qh_appendvertex()
198 ridge->top= newfacet; in qh_attachnewfacets()
532 facetT *newfacet; in qh_makenewfacet() local
536 if (!vertex->newfacet) { in qh_makenewfacet()
548 return(newfacet); in qh_makenewfacet()
567 facetT *newfacet; in qh_makenewplanes() local
651 newfacet->f.samecycle= newfacet; in qh_makenew_nonsimplicial()
691 return newfacet; in qh_makenew_nonsimplicial()
745 newfacet->f.samecycle= newfacet; in qh_makenew_simplicial()
756 return newfacet; in qh_makenew_simplicial()
[all …]
/dports/math/qhull8/qhull-8.0.2/src/libqhull_r/
H A Dpoly_r.c80 vertex->newfacet= True;
198 ridge->top= newfacet;
532 facetT *newfacet;
536 if (!vertex->newfacet) {
548 return(newfacet);
567 facetT *newfacet;
651 newfacet->f.samecycle= newfacet;
691 return newfacet;
745 newfacet->f.samecycle= newfacet;
756 return newfacet;
[all …]
/dports/math/qhull/qhull-7.3.2/src/libqhull_r/
H A Dpoly_r.c80 vertex->newfacet= True; in qh_appendvertex()
198 ridge->top= newfacet; in qh_attachnewfacets()
532 facetT *newfacet; in qh_makenewfacet() local
536 if (!vertex->newfacet) { in qh_makenewfacet()
548 return(newfacet); in qh_makenewfacet()
567 facetT *newfacet; in qh_makenewplanes() local
651 newfacet->f.samecycle= newfacet; in qh_makenew_nonsimplicial()
691 return newfacet; in qh_makenew_nonsimplicial()
745 newfacet->f.samecycle= newfacet; in qh_makenew_simplicial()
756 return newfacet; in qh_makenew_simplicial()
[all …]
/dports/math/R-cran-geometry/geometry/src/
H A Dpoly_r.c192 ridge->top= newfacet; in qh_attachnewfacets()
480 facetT *newfacet; in qh_makenewfacet() local
489 newfacet= qh_newfacet(qh); in qh_makenewfacet()
495 return(newfacet); in qh_makenewfacet()
514 facetT *newfacet; in qh_makenewplanes() local
591 newfacet->f.samecycle= newfacet; in qh_makenew_nonsimplicial()
631 return newfacet; in qh_makenew_nonsimplicial()
679 newfacet->f.samecycle= newfacet; in qh_makenew_simplicial()
690 return newfacet; in qh_makenew_simplicial()
924 if (newfacet->normal) in qh_matchnewfacets()
[all …]
/dports/cad/PrusaSlicer/PrusaSlicer-version_2.3.3/src/qhull/src/libqhull_r/
H A Dpoly_r.c192 ridge->top= newfacet; in qh_attachnewfacets()
480 facetT *newfacet; in qh_makenewfacet() local
489 newfacet= qh_newfacet(qh); in qh_makenewfacet()
495 return(newfacet); in qh_makenewfacet()
514 facetT *newfacet; in qh_makenewplanes() local
591 newfacet->f.samecycle= newfacet; in qh_makenew_nonsimplicial()
631 return newfacet; in qh_makenew_nonsimplicial()
679 newfacet->f.samecycle= newfacet; in qh_makenew_simplicial()
690 return newfacet; in qh_makenew_simplicial()
924 if (newfacet->normal) in qh_matchnewfacets()
[all …]

1234567