multi-level 思想在图形分割的应用的应用
andNielson[1980](seealso[Renka1988]),wherepolynomiallo-calapproximationsQi(x)are used incombinationwith“inverse-distance”singularweightswi(x)forinterpolationpurposes.GivenasetofscatteredpointsPequippedwithnormalsN,weapproximatethesigneddistancefunctionf(x)fromP.Incontrasttotheapproachesmentionedabove,weintroduceanadaptivepro-cedureforgeneratingthesubdivisionandproblem-speci capprox-imationsets.First,weuseanoctree-basedadaptivespacesubdivi-sionof .Thisallowsustocontroltheerroroftheapproximationwhileadaptingthecomplexityoftherepresentationtothecomplex-ityoftheshape(seeSection3).Second,weusepiecewisequadraticfunctionsresultingfromBooleanoperationsfortheaccuraterepre-sentationofsharpfeatures.Theclassi cationoflocalshapesandappropriateapproximationsetsarediscussedinSection4.
ForapproximationpurposesweusethequadraticB-splineb(t)togenerateweightfunctions
3x ci(3)wi(x)=b
2Ri

Figure2:Left:adaptivesubdivisioncoupledwithleast-squares tting.Right:

enlarg-

ing

thesphericaldomainforthelocalapproximationtomakeitmorerobust.
centeredatciandhavingasphericalsupportofradiusRi.
IfaninterpolationofPisrequired,weusetheinverse-distancesingularweights[FrankeandNielson1980;Renka1988]
2 Ri x ci+aifa>0,where(a)+=(4)wi(x)=0otherwiseRix ci
Figure3:Left:asetofpointsequippedwithnormals.Middle:thecircles(2Dballs)
correspondingtotheadaptivesubdivisionareshownhereat50%oftheirrealsize.Right:thedistancefunctionisreconstructed,andthezerolevelsetislocatedbetweentheyellowandgreenbands.
3AdaptiveOctree-basedApproximation
ThealgorithmforconstructinganMPUimplicitisdrivenbyre-peatedsubdivisionoftheregionofspacethatisoccupiedbytheinputsetofpoints.First,thepointsinParerescaledsothatanaxis-alignedboundingcubehasaunit-lengthmaindiagonal.Wethenapplyanadaptiveoctree-basedsubdivisiontotheboundingcube.Consideracubiccellthatwasgeneratedduringthesubdivi-sionprocess,andletcbethecenteranddthelengthofthemaindiagonalofthecell.
Wede nethesupportradiusRfortheweightfunction(3)forthecelltobeproportionaltoitsdiagonal:
R=αd.(5)
Wetypicallyuseα=0.75.Alargervalueforαyieldsbetter(smoother)interpolationandapproximationresultsattheexpenseofcomputationtime.Timecomplexityisroughlyquadraticinα.Figure11illustratestheeffectofα,especiallyfortheaccurateap-proximationofthedistancefunctionawayfromthezerolevelset.Foreachcellgeneratedduringthesubdivisionprocess,alocalshapefunctionQ(x)isbuiltusingaleast-squares ttingprocedure,asshownintheleftdrawingofFigure2.
Sometimes(especiallyifthedensityofPisnotuniform)theballofradiusRforacelldoesnotcontainenoughpointsforarobustestimationofQ(x).IfthenumberofpointsislessthanNmin(inour
implementationwesetNmin=15),aballwithincreasedradiusR
isdeterminedthatcontainsatleastNminpoints.Thisisdoneby
=RandtheniteratingstartingwithR
=R +λRR(6)
untiltheballcontainstheminimumnumberofpoints(inourim-plementationwesetλ=0.1).Nowthepointsenclosedbytheball
areusedtoestimatealocalshapefunctionQ(x),asofradiusR
demonstratedintherightdrawingofFigure2.
Weuseakd-treepartitioningforef cientsolvingoftheserangesearchingproblems.
IftheballaroundanoctreecellwithinitialradiusR=αdisempty,anapproximationofthedistancefunctioniscomputedasexplainedaboveanditwillnotbesubdividedfurther.Otherwise,alocalmax-normapproximationerrorisestimatedaccordingtotheTaubindistance[Taubin1991]
ε=max|Qpi| Qpi .(7)

|pi c|<R
Ifεisgreaterthanauser-speci edthresholdε0,thecellissubdi-videdandthe ttingprocessisperformedforthechildcells.
Figure3demonstrateshowouradaptivesubdivisionschemeworksin2D.
ThefollowingpseudocodedescribesarecursiveprocedureforassemblinganMPUapproximationatpointxwithprecisionε0.
MPUapprox(x,ε0)EvaluateMPUapprox(x,ε0)
SwQ=Sw=0;
root->MPUapprox(x,ε0);returnSwQ/Sw;
if(|x ci|>Ri)thenreturn;if(Qiisnotcreatedyet)thenCreateQiandcomputeεi;if(εi>ε0)then
if(Nochilds)thenCreatechilds;foreachchild
child->MPUapprox(x,ε0);else
SwQ=SwQ+wi(x) Qi(x);Sw=Sw+wi(x);
Here,SwandSwQdenote∑wi(x)and∑Qi(x)wi(x),respectively,seeEqs.1and2.
Thisprocedureiseasytoimplement.Wehopethatthiswillmakeourapproachanditsimplementationaccessibletoawiderangeofusers.
Notethatweabandonthelocalapproximationsthatarecon-structedatthenon-leafcellsoftheoctree.ThisallowsustousedifferentlocalapproximationsofthedistancefunctionfarfromPandneartoP,aswellasspeci csharpfeatureapproximations,withoutcompensatingfortheeffectsofcoarseapproximations.In-heritingcoarseapproximationswouldalsorequireustocounteractalreadygeneratedzero-setsinemptyballs.Inaddition,avoidingcoarseapproximationssavesmemoryandresultsinfasterevalua-tionoftheimplicitfunction.
4EstimatingLocalShapeFunctions
Ourlocal ttingstrategydependsonthenumberofpointsintheballofagivencellandthedistributionofnormalsofthosepoints.Atagivencellweusethemostappropriateoneofthesethreelocalapproximations:
(a)ageneral3Dquadric,
(b)abivariatequadraticpolynomialinlocalcoordinates,(c)apiecewisequadricsurfacethat tsanedgeoracorner.Roughlyspeaking,(a)isusedtoapproximatelargerpartsofthesurface,whichcouldbeunboundedorcontainmorethanonesheet,(b)isusedtoapproximatealocalsmoothpatch,and(c)isemployed
Multi-level Partition of Unity Implicits Di e go S a l ume Octob e r 2 3 rd , 2 0 1 3 A u t h o r: O hta ke , et . a l . Over...
Partition of Unity for a Class of Nonlinear Parabolic Equation on Overlapping Non-Matching Grids_专业资料。维普资讯 http://www.cqvip.com NUMERICAL ATHEMATI...
Two-grid partition of unity method for second order elliptic problems 隐藏>> 维普资讯 http://www.cqvip.com Ap1MahMeh一n1E.20,94:2—3 p.t.c.Eg.d...
Multi-level Partition of... 8页 2财富值 辞职后五险一金怎么处理? 11页 ...a partition of unity method to solve large-scale, scattered data problems....
免费 The partition of unity m... 暂无评价 24页 免费 A Method for the Horizon... 暂无评价 20页 免费 Multi-level Partition of... 8页 2财富值喜欢...
Integrated importance measure for multi-state coherent systems of k level_数学_自然科学_专业资料。Journal of Systems Engineering and Electronics Vo1.24,NJour...
Overview of Partition ... 20页 免费 Multi-level Partition ... 8页 1下载...Engng 2003; 00:1–44 PARTITION OF UNITY ENRICHMENT FOR BIMATERIAL INTERFACE...
Multi-level Partition ... 8页 1下载券 A Particle-Partition o... 暂无评价...'Partition of Unity' RBF Networks are Universal Function Approximators y Dept...
Teleportation of Three-Level Multi-partite Entangled State by a Partial Three-Level Bipartite En_专业资料。维普资讯 http://www.cqvip.com Cmmu.ho.hs(eigCi...
The coupling of partition of unity techniques to level set methods is an ...of natural neighbors that was intro- nodal discretizations in multi-dimensions...
热门文档