ConstrainedDelaunayTriangulationUsing
DelaunayVisibility
Yi-JunYang1,2,HuiZhang1,Jun-HaiYong1,WeiZeng3,
Jean-ClaudePaul1,andJiaguangSun1,2
2
3SchoolofSoftware,TsinghuaUniversity,Beijing,ChinaDepartmentofComputerScienceandTech.,TsinghuaUniversity,Beijing,ChinaInstituteofComputingTechnology,ChineseAcademyofSciences,Beijing,China1
Abstract.AnalgorithmforconstructingconstrainedDelaunaytrian-gulation(CDT)ofaplanarstraight-linegraph(PSLG)ispresented.Althoughtheuniformgridmethodcanreducethetimecostofvisibil-itydeterminations,thetimeneededtoconstructtheCDTisstilllong.Thealgorithmproposedinthispaperdecreasesthenumberofedgesinvolvedinthecomputationofvisibilitybyreplacingtraditionalvisi-bilitywithDelaunayvisibility.WithDelaunayvisibilityintroduced,allstronglyDelaunayedgesareexcludedfromthecomputationofvisibility.Furthermore,asu cientconditionforDT(CDTwhosetrianglesareallDelaunay)existenceispresentedtodecreasethetimesofvisibilityde-terminations.ThemeshgeneratorisrobustandexhibitsalineartimecomplexityforrandomlygeneratedPSLGs.
1Introduction
Triangulationofaplanarstraight-linegraph(PSLG)[1]playsanimportantroleinsurfacevisualization[2],stereolithography[3],garmentdesign[4],patternrecognition[5],surfacereconstruction[6,7,8]and niteelementanalysis[9,10,11].Qualityofthemeshstronglyin uencestheaccuracyande ciencyofdesignandanalysis.DelaunaytriangleshavedesirablepropertiessuchasmaximumminimumangleandsuitabilityforDelaunayre nementalgorithms[12].Delau-naytriangulations[13](Fig.1(b))areconvex.However,PSLGsusuallyarenot.PSLGshaveedgeconstraintsthatmustberespectedbythemesh(Fig.1(a)).Toaddressthisproblem,twomethodshavebeenestablished:conformingDelaunaytriangulationandconstrainedDelaunaytriangulation(CDT).
ConformingDelaunayapproaches[14,15,16]repeatedlyinsertSteinerpointsintothemesh,whilethemeshisDelaunayre nedaccordingly,untilconstraintsarerespectedbythemesh:eachedgeisrepresentedbyaunionofcontiguoussequenceofDelaunaytriangulationedges.AlltrianglesintheresultingmeshareDelaunay.Theproblemofwheretoinsertpointstoobtainconstraintconformityisdi culttosolve.Edelsbrunner[14]showsthatforanyPSLG,thereexistsaDelaunaytriangulationofO(m2n)pointsthatconformstothePSLGwherem,narethenumberofconstrainededgesandthenumberofpointsinthePSLGrespectively.WhetherthereexistsaPSLGthatreallyneedssomanySteinerG.Bebisetal.(Eds.):ISVC2006,LNCS4291,pp.682–691,2006.
cSpringer-VerlagBerlinHeidelberg2006
http://www.cescg.org/CESCG-2004/web/Domiter-Vid/ Constrained Delaunay Triangulation using Plane Subdivision Vid Domiter vid.domiter@un i-mb.si Un ...
Constrained Delaunay Tri... 暂无评价 10页 1财富值 Constrained_Delaunay_... Delaunay Triangulation Using a Uniform Grid Tsung-Pao Fang and Les A. ...
(Constrained Delaunay Triangulation ,以下简称为 CDT) 有别于一般的 Delaunay 三角划分(以下简称为 DT), 它不仅要满足 Delaunay 准则,而且最终的三角划分必须...
【Key words】constrained edge; Delaunay triangulation; diagonal 地学领域中的大量离散数据不是独立的,相互之间存在 着一定的约束关系,比如地表的山脊线、山谷线、...
of a conformal boundary recovery algorithm for 3D Delaunay triangulation...The constrained DT of the boundary points is obtained using modified Watson'...
Axis of a Polygonal Domain This example shows how to create an approximate Medial Axis of a polygonal domain using a constrained Delaunay triangulation. ...
DT) 和约 束 Delaunay 三 角剖分 ( Constrained Delaunay Triangulation, CDT...Since IEE meets with the two rules for CD - TIN, visibility and empty ...
A fast algorit hm generating constrained De2 [ 2 ] Xu Y A , Yang Q. The algorit hm of 3D constrained De2 launay triangulation [ J ] . Journal ...
广东 深圳 510030) 2 Extracting Center-lines and Building Street Network Based on Constrained Delaunay Triangulation AI Ting-hua1 , GUO Ren-zhong2 (1 ...
关键词: 三角剖分; 凸包; 支撑线 中图分类号: TP309 文献标识码: A Study on Growth Algorithm for Generating Constrained Delaunay Triangulation JIANG Hong ...
热门文档