ELF>E@@&%   UH@dH%(HD$81HHt$HD$HFHD$$D$ t0H|$1HT$8dH+%(uhH@]@HT$H|$H5|$HtHt+HH5HPtHuH1Huff.fUSHHdH%(HD$81HHt$HD$HFHD$$D$ HD$t6H|$1HT$8dH+%(utHH[]fHt$H|$tHl$H=HtHH=uHuHc@HSH0fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u=H(HtD$9D$t:H111HT$(dH+%(uuH0[fDHHuӐt$W0fH~HufHn@HHH;u_0fH~ffH~fSH0fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u=H(HtD$9D$t:H111HT$(dH+%(uuH0[fDHHuӐt$W8fH~HufHn@HHH;u_8fH~ffH~fUH@fnFdH%(HD$81HHt$HD$HGfnȉD$(fbfD$ uLHo(Ht!D$ +D$$tFH|$1HT$8dH+%(H@]fDHHuϐHt$H|$tD$$D$t?f.E0ztHEE0HHuHHzf.HEHH;uf.E0ztE0HH@UH@fnFdH%(HD$81HHt$HD$HGfnȉD$(fbfD$ uLHo(Ht!D$ +D$$tFH|$1HT$8dH+%(H@]fDHHuϐHt$H|$tD$$D$t?f.E8ztHEE8HHuHHzf.HEHH;uf.E8ztE8HH@ATUSH@fnFdH%(HD$81HHt$HD$HGfnȉD$(fbfD$ uYHD$Ho(Ht!\$ +\$$tJH|$1HT$8dH+%(H@[]A\HHuːHt$H|$tD$$Ld$uXHELH@H;u\H=tLH=u)HeHcZfDLL@HЉfATH0fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$uDH(HtD$9D$tIH11E1HD$(dH+%(H0LA\@HHufHHRxH;IMtoI$H5LPtZHuLIHoHbL1HHP@L8fE1H"DIjfATL%H HH5LuLHLA\ATIUHHt HH5LHtHmtH]A\HH]A\AWAVAUATUHPfnFdH%(HD$H1HHt$ HD$(HGfnȉD$8fbfD$0(Ho(Ht!D$0+D$4t:H|$ 1HT$HdH+%(HP]A\A]A^A_fL|$Lt$ LH5L|$ItLH5L|$ItHt$LtLH5L|$jLLHD$RD$4LL$HL$LD$uQHEHLLfH~HfHn@HHfHLLfH~f.G0zufHG0G0f.G8zufHG8G8SafeDownCastvtkObjectBaseIsTypeOfGetLowerBoundGetUpperBoundSetLowerBoundSetUpperBoundIsANewInstanceComputeMetricvtkDataSetvtkDataArrayvtkAbstractArrayvtkReebGraphSimplificationMetricvtkReebGraphSimplificationMetric - abstract class for custom Reeb graph simplification metric design. Superclass: vtkObject This class makes it possible to design customized simplification metric evaluation algorithms, enabling the user to control the definition of what should be considered as noise or signal in the topological filtering process. References: "Topological persistence and simplification", H. Edelsbrunner, D. Letscher, and A. Zomorodian, Discrete Computational Geometry, 28:511-533, 2002. "Extreme elevation on a 2-manifold", P.K. Agarwal, H. Edelsbrunner, J. Harer, and Y. Wang, ACM Symposium on Computational Geometry, pp. 357-365, 2004. "Simplifying flexible isosurfaces using local geometric measures", H. Carr, J. Snoeyink, M van de Panne, IEEE Visualization, 497-504, 2004 "Loop surgery for volumetric meshes: Reeb graphs reduced to contour trees", J. Tierny, A. Gyulassy, E. Simon, V. Pascucci, IEEE Trans. on Vis. and Comp. Graph. (Proc of IEEE VIS), 15:1177-1184, 2009. See Graphics/Testing/Cxx/TestReebGraph.cxx for an example of concrete implemetnation. vtkCommonDataModelPython.vtkReebGraphSimplificationMetricV.IsTypeOf(string) -> int C++: static vtkTypeBool IsTypeOf(const char *type) Return 1 if this class type is the same type of (or a subclass of) the named class. Returns 0 otherwise. This method works in combination with vtkTypeMacro found in vtkSetGet.h. V.IsA(string) -> int C++: vtkTypeBool IsA(const char *type) override; Return 1 if this class is the same type of (or a subclass of) the named class. Returns 0 otherwise. This method works in combination with vtkTypeMacro found in vtkSetGet.h. V.SafeDownCast(vtkObjectBase) -> vtkReebGraphSimplificationMetric C++: static vtkReebGraphSimplificationMetric *SafeDownCast( vtkObjectBase *o) V.NewInstance() -> vtkReebGraphSimplificationMetric C++: vtkReebGraphSimplificationMetric *NewInstance() V.SetLowerBound(float) C++: virtual void SetLowerBound(double _arg) Set the lowest possible value for the custom metric space. This value can be set prior to launching the Reeb graph simplification and then used inside the ComputeMetric call to make sure the returned value of ComputeMetric call is indeed between 0 and 1. V.GetLowerBound() -> float C++: virtual double GetLowerBound() Set the lowest possible value for the custom metric space. This value can be set prior to launching the Reeb graph simplification and then used inside the ComputeMetric call to make sure the returned value of ComputeMetric call is indeed between 0 and 1. V.SetUpperBound(float) C++: virtual void SetUpperBound(double _arg) Set the highest possible value for the custom metric space. This value can be set prior to launching the Reeb graph simplification and then used inside the ComputeMetric call to make sure the returned value of ComputeMetric call is indeed between 0 and 1. V.GetUpperBound() -> float C++: virtual double GetUpperBound() Set the highest possible value for the custom metric space. This value can be set prior to launching the Reeb graph simplification and then used inside the ComputeMetric call to make sure the returned value of ComputeMetric call is indeed between 0 and 1. V.ComputeMetric(vtkDataSet, vtkDataArray, int, vtkAbstractArray, int) -> float C++: virtual double ComputeMetric(vtkDataSet *mesh, vtkDataArray *field, vtkIdType startCriticalPoint, vtkAbstractArray *vertexList, vtkIdType endCriticalPoint) Function to implement in your simplification metric algorithm. Given the input mesh and the Ids of the vertices living on the Reeb graph arc to consider for removal, you should return a value between 0 and 1 (the smallest the more likely the arc will be removed, depending on the user-defined simplification threshold). vtkObjectUH=Hu]ÐHH=tH]HHHDGCC: (Ubuntu 11.4.0-1ubuntu1~22.04) 11.4.0GNUzRx 0 DX l  EDPa AE <EY B W(EAD`j AAJ ED@ AG (ED@ AG LLEDP AG pLEDP AG 0^FAA D`  AABH gFD@ EE MFF0OFDD n ABA DDB<@PFBB B(A0D 0A(B BBBC     4u6Lx0L^g2_@   $$)2.@3N8\=`ClIzOU[(a" " " " =i" AR"< 5TcuP M O*?Kj,DYn_ZL44PyvtkReebGraphSimplificationMetric_StaticNewv_ZL47PyvtkReebGraphSimplificationMetric_SafeDownCastP7_objectS0__ZL43PyvtkReebGraphSimplificationMetric_IsTypeOfP7_objectS0__ZL48PyvtkReebGraphSimplificationMetric_GetLowerBoundP7_objectS0__ZL48PyvtkReebGraphSimplificationMetric_GetUpperBoundP7_objectS0__ZL48PyvtkReebGraphSimplificationMetric_SetLowerBoundP7_objectS0__ZL48PyvtkReebGraphSimplificationMetric_SetUpperBoundP7_objectS0__ZL38PyvtkReebGraphSimplificationMetric_IsAP7_objectS0__ZL46PyvtkReebGraphSimplificationMetric_NewInstanceP7_objectS0__ZL39PyvtkReebGraphSimplificationMetric_Type_ZL42PyvtkReebGraphSimplificationMetric_Methods_GLOBAL__sub_I_vtkReebGraphSimplificationMetricPython.cxx_ZL48PyvtkReebGraphSimplificationMetric_ComputeMetricP7_objectS0_.LC0.LC1.LC2.LC4.LC3.LC5.LC6.LC7.LC8.LC9.LC10.LC12.LC13.LC14.LC15.LC11_ZN32vtkReebGraphSimplificationMetric13SetLowerBoundEd_ZN32vtkReebGraphSimplificationMetric13GetLowerBoundEv_ZN32vtkReebGraphSimplificationMetric13SetUpperBoundEd_ZN32vtkReebGraphSimplificationMetric13GetUpperBoundEv_ZN32vtkReebGraphSimplificationMetric3NewEv_ZNK32vtkReebGraphSimplificationMetric19NewInstanceInternalEv_ZN13vtkPythonArgs13ArgCountErrorEii_ZN13vtkPythonArgs17GetArgAsVTKObjectEPKcRbPyErr_Occurred_ZN13vtkPythonUtil20GetObjectFromPointerEP13vtkObjectBase__stack_chk_fail_ZN32vtkReebGraphSimplificationMetric3IsAEPKcstrcmp_ZN13vtkObjectBase8IsTypeOfEPKc_ZN13vtkPythonArgs8GetValueERPcPyLong_FromLong_ZN13vtkPythonArgs19GetSelfFromFirstArgEP7_objectS1_PyFloat_FromDouble_GLOBAL_OFFSET_TABLE__ZN13vtkPythonArgs8GetValueERd_Py_NoneStructPyVTKObject_CheckPyVTKObject_GetObjectPyVTKObject_SetFlagPyvtkReebGraphSimplificationMetric_ClassNewPyVTKClass_AddPyvtkObject_ClassNewPyType_ReadyPyVTKAddFile_vtkReebGraphSimplificationMetricPyDict_SetItemString_Py_Dealloc_ZN13vtkPythonArgs8GetValueERx_ZN32vtkReebGraphSimplificationMetric13ComputeMetricEP10vtkDataSetP12vtkDataArrayxP16vtkAbstractArrayxPyType_TypePyVTKObject_DeletePyVTKObject_ReprPyVTKObject_StringPyObject_GenericGetAttrPyObject_GenericSetAttrPyVTKObject_AsBufferPyVTKObject_TraversePyVTKObject_GetSetPyVTKObject_NewPyObject_GC_Del,`123435 J1}9773:85 N1q;3<*,5!N1q;3<*.5"Z1;>3*?*+(5Q#1;>3)*?N*-x5$11;K9n*6w|773:85%O1y;*0/34@A B$ 3C 5Y g n v D|  E  F C  H &v 1 ' 2 ( 2 J ) 2 JX 3k <y ; K 5/ I/7&+788*L p0MXNOPQRST8U@V    \(8 @ HX ` `hx H @  $  N0 @  2  l  4H\p ,Pt0P  @T .symtab.strtab.shstrtab.rela.text.data.bss.text._ZN32vtkReebGraphSimplificationMetric13SetLowerBoundEd.text._ZN32vtkReebGraphSimplificationMetric13GetLowerBoundEv.text._ZN32vtkReebGraphSimplificationMetric13SetUpperBoundEd.text._ZN32vtkReebGraphSimplificationMetric13GetUpperBoundEv.rela.text._ZNK32vtkReebGraphSimplificationMetric19NewInstanceInternalEv.rodata.str1.1.rodata.str1.8.rodata._ZN32vtkReebGraphSimplificationMetric3IsAEPKc.str1.1.rela.text._ZN32vtkReebGraphSimplificationMetric3IsAEPKc.rela.text.startup.rela.init_array.rela.data.rel.rela.data.rel.local.comment.note.GNU-stack.note.gnu.property.rela.eh_frame.group@#+H#,P#-X#.` #0l #6  @P3 #&* ,* 10 nP `  * %@=#n2 }2@ 2N `<@(=x#@=0#@=#+ &@= #:`@ 5@?#J0,Sc {v@A#!"($+ *XC