文档下载 文档下载导航
设为首页 | 加入收藏
搜索 请输入内容:  
 导航当前位置: 文档下载 > 所有分类 > Accurate Computation of Geodesic Distance Fields for Polygonal Curves on Triangle Meshes Ab
侵权投诉

Accurate Computation of Geodesic Distance Fields for Polygonal Curves on Triangle Meshes Ab

We present an algorithm for the efficient and accurate computation of geodesic distance fields on triangle meshes. We generalize the algorithm originally proposed by Surazhsky et al. [1]. While the original algorithm is able to compute geodesic distances t

2Previouswork

Inthispaperweaddresstwoelementarymeshoper-ations,geodesicdistancecomputationandadaptivere nement.

Dijkstra’salgorithmforcomputingshortestpathsalongedgescanbeusedasanapproximationforthegeodesic eld.Lanthieretal.[3]improvedtheinitialpoorresultsbyaddingmanyextraedgestothemesh.

KimmelandSethian[4]adaptedthefastmarchingmethodtocomputecloserapproximationsofgeodesicdistances.Onwell-shapedinputmeshesthismethodperformsverygood,butinthecaseofobtuseanglesorneedletrianglesevenimprovedupdaterulesandspecialhandlingasproposedbe-fore[5,6,7]canleadtolargeerrors.Fastmarchingalgorithmsareabletoapproximatethegeodesicdistance eldinducedbypolygonalsources,butthequalitystronglydependsonthemeshstructurenearthemedialaxis,whichistypicallynotsuitedtorepresentthegeodesic eld,asweshowinthispaper.

ThemostfamousexactalgorithmwasdevelopedbyMitchelletal.[2]in1987andthe rstpracticalimplementationwasproposedeighteenyearslaterbySurazhskyetal.[1].TheyshowedthattheworstcasecomplexityofO(n2logn)isquitepessimisticandinpracticetheaverageisclosetoO(n1.5)whichmakesthealgorithmpracticalforcommonmodelcomplexities.Detailsofthisalgorithmarepresentedinthenextsection.Theyalsointroduceamergingoperationtodesignanapproximationalgorithmwithguaranteederrorbounds.Liuetal.[8]studiedarobustimplementationstrategywhichhandlesalldegeneratecasesthatoccurinrealworlddata.Inthispaperwewillgeneralizethisexactandapproximatealgorithmfrompointsourcestoarbitrarysourcepolygons.

Inthecontextofadaptivemeshre nementtwocommontechniques,triangulations[10][11]and√namelyred-green-leadtoregular√structuresandpreservethetrianglequal-ity.

iscomposedofone-to-threetrianglesplitsandedge ipswhichchangesnotonlythetessellationbutalsothegeometry(andhencethegeodesicdistance eld)ofatrianglemeshandisthusnotsuitedforourapplication.

Accurate Computation of Geodesic Distance Fields for Polygonal Curves on Triangle Meshes Ab

x

Accurate Computation of Geodesic Distance Fields for Polygonal Curves on Triangle Meshes Ab

(a)(b)

Figure2:(a)Startingonthepointsourcesa(shaded)pencilofraysispropagatedthroughthreeunfoldedtrianglesalongofstraightlines.Eachwin-dowishighlightedbyanarcwhichisalwaysontheedgesidepointingtothesource.(b)Anedgealignedtwodimensionalcoordinatesystemisusedtocomputenewwindowswhichareinducedfromwindoww.

Atthecoreofred-green-triangulationsistheone-to-fourtrianglesplit.Redandgreentagsareusedtopreserveconsistency.There nementconservestheoriginalgeometryandcouldbeintegratedintoourframework.Howeverforourapplicationasimplerandmorelocalre nementispossiblewhichweproposeinsection6.

3Theexactgeodesicalgorithm

Sinceouralgorithmisanextensionof[1]webrie yexplainthebasicprinciplesandtheresultingbasealgorithm.

Intheplane,thegeodesicdistancecoincideswiththeEuclideandistance.Hence,withrespecttoanisolatedpoint,itisthesquarerootofaquadraticfunction.Onatrianglemesh,i.e.onapiecewiseplanarsurface,thegeodesicdistancewithrespecttoapointturnsouttobeapiecewisefunctionwhereineachsegmentthedistanceisgivenbythesquarerootofaquadraticfunctionplusanoptionalconstantoffset.Thisoffsethastobeintroducedtoproperlyhandlesaddlepointsonthesurface.Thecentralideaofthealgorithm[1]istoprop-agateexactdistanceinformationfromonetriangletoitsneighborswithaDijkstra-typealgorithm.Thekeyobservationisthatitissuf cienttostorethepiecewisedistancefunctionontheedgesofthetri-

上一页第2页

你可能喜欢

热门文档

相关文档

站点地图 | 文档上传 | 侵权投诉 | 手机版
本站所有资源均来自互联网,本站只负责收集和整理,均不承担任何法律责任,如有侵权等其它行为请联系我们.
文档下载 Copyright 2013 doc.guandang.net All Rights Reserved.  -  email