Read without ads and support Scribd by becoming a Scribd Premium Reader.
 
ANEWAPPROACHTOWARDSDELAUNAY-CONFORMITYIN3DIMENSIONS
Philippe
P.Pebay,
INRIA-Rocquencourt,GammaProjectBP105,
78153
LeChesnayCedex,FranceMAPLY-INSA,UMRCNRS-5585,Bat.40120avoEinstein,
69621
VilleurbanneCedex,FranceE-mail:philippe.pebay@insa-Iyon.fr
ABSTRACT
Thiscommunicationfollows
[Pebay-Oxc]
andpresentsanewapproachforredefining
apriori
athree-dimensionalfieldofconstraintsrepresentedbyaasetofedgesandtriangularfaces.
It
isshownthat,surprisingly,two-dimensional
a
priori
Delaunay-conformityresultsdonotextendnaturallytosegmentsinthreedimensions.Consequently,anewstrongDelaunay-conformitytheoremisdetailed,allowingtodecidewhetherornotasegmentwillappearinanyDelaunay-triangulationoftheconvexhulloftherelatedsetofvertices.Thisresultprovidesnewperspectivesfortriangularfacesredefinition.Inparticular,anewalgorithmisproposedandarepresentativesetofexamplesemphasizesitsreliabilityandefficiency.
Keywords:Triangulation,Delaunaytriangulation,constrainedtriangulation,surfacetriangulation.
INTRODUCTION
Inthecontextofnumericalsimulationsbasedonfiniteelementmethods,Delaunay-triangulationshavenicepropertiesandcanbeeasilyimple-mentedinordertocomputegoodmeshes.How-ever,thesetriangulationslackanessentialprop-erty,
i.e.
theabilitytotakeintoaccounttopologi-calrequirements,suchasboundariesorinterfaces.Moreprecisely,iftheinputdataiscomposedofanon-convexsetofedgesandpossiblyfaces
I'
(i.
e.,
theconstraint),ofwhichtheverticesformasubset
S
(f)
ofthesetofvertices
S,
I'
isanotnecessarilyasubsetofaDelaunaytriangulation
T
ofConv(S).Therefore,theneedtoretrievethedesiredmissingitemsleadtoconsidertwodifferentapproaches:
1.
aposteriori
recoveryofthetopologicalre-quirementsoftheconstraint,iftheconstraintintegrityisrequired;
2.a
priori
redefinitionoftheconstraint,ifatopologicalandgeometricalequivalentissat-isfactory,sothatitappearsintheDelaunaytriangulationoftheconvexhullofthesetofvertices.Inordertorecovertheconstraint,
aposteri-ori
methodsapplylocaloperatorsupontheini-tialtriangulation,suchasedgesorfacesswapsorSteinerverticesinsertion.Althoughconver-gencein2dimensionscanbeachieved,three-dimensionalalgorithmsuseheuristicsandnoneofthemasbeenprovedtobeconvergent,leavingunresolvedjammedconfigurations.Inaddition,theglobalpropertyofDelaunay-conformitygen-erallyvanishes,sincetheselocaloperatorsdonot
1
 
takeintoaccounttheempty-ballcriterion.Now,nonDelaunay-conformingtriangulationsareun-suitedforsomeapplications,suchasmedialaxisormid-surfacecomputationorspecificfinitevol-umesmethods.
Apriori
redefinition,
i.e.
findinganewconstraint,topologicallyandgeometricallyequivalenttotheinitialone,suchthatitappearsintoanyDelaunaytriangulationoftherelatedsetofvertices,allowstoprovideDelaunay-conformingresultingtriangu-lations,aswellastoavoidthesepossiblydiverging
aposteriori
recoveryoperations.Therefore,itisdesirabletoinvestigatethisapproach,in2and3dimensionsandtrytoproposeefficientandreli-ablealgorithms.
Relatedwork
Aconvergent
apriori
two-dimensionalconstraintsredefinitionalgorithm,withcomplexitybound,hasbeenproposedby[Edelsbrunner,Tan-93].However,thisapproachshouldberegardedasatheoreticalproofratherthanapracticalredefinitionmethod,providinganewstronglyDelaunay-conformingconstraint.Afirstapproachtowardsanefficientalgorithmcanbefoundin[George,Borouchaki-1997],butitscon-vergenceisensuredonlyformanifoldconstraintswithoutacuteangles.[Pebay-98c]addressedtheproblemandprovidedaconvergentalgorithm,nowproposedasapublicdomainsoftware.'Thethree-dimensionalcase,however,ismuchmorecomplicatedsinceageometricresultin1R?cannotbeextendedto
1R
3.
Therefore,ithasremainedwidelyopenuntilrecently.[Pebay-98c]proposedan
apriori
classificationfunctionandtheoremal-lowingtodecidewhetherornotanyfacewillap-pearinanyDelaunay-triangulationoftherelatedsetofvertices.Basedonthisresult,aheuristicbutreliablealgorithminordertoredefineathree-dimensionalconstrainthasbeenintroduced.Sincethen,[Murphy
etal.-OO]
provedthatatleastonetheoreticalconvergentalgorithmexists,butdidnotimplementednorevaluatedit,sinceitiscom-putationallyimpractical.Therefore,thisimpor-tanttheoreticalresultdidnotsolvetheproblemoffindingareliableaswellasusablealgorithm.
Outline
Firstofall,thecontextofconstrainedDelaunay-triangulationsisshortlyrecalledSec-tion
1.
GeometricissuesofDelaunay-conformity
in3dimensionsarediscussedSection2;sincefacesclassificationhasbeenproposedin[Pebay-98c],itisverybrieflyrecalledinthiscommunication,whileitfocusesonthree-dimensionalsegments.
In
particular,thereasonswhytwo-dimensionalsegmentsclassificationdoesnotextendnaturallyto3dimensionsaredetailedandanew
apriori
Delaunay-conformitytheoremforthesesegmentsisgiven.Basedontheseresults,anewalgorithmicapproachtoredefinetheconstraintisproposedandexemplifiedinSection3.Finally,Section4summarizesongoingandfurtherdevelopments.
1.
CONTEXT
Theaimofthissectionistoshortlyrecallafewbasicdefinitionsandresultsrequiredforfurtherunderstanding,see[Frey,George-OO]forfurtherde-tails.Given
S
C
1R
3,
finitesetofdistinctpoints,itmaybeusefultorecallthata
conformingmesh
T
ofasubset
n
c
1R
3
isapolyhedralcovering-upof
n,
sothatanyfaceofanypolyhedraof
T
iseitherafaceofanotherelementorbelongsto
an.
In
particular,a
triangulation
isaconformingmeshwhichcontainsonlysimplicialelements.
Voronoldiagram
The
Voronoi"cell
ofany
Pi
E
S
isdefinedas:The1,2and3-dimensionalintersectionsofcellsarerespectivelycalled
Voronoi"points,edges
and
faces
of
S.
Naturally,the
Voronoi"diagram
of
S,
referredas
V(S),
isthesetof
Voronoi
points,edgesandpossiblyfacesof
S.
Forthesakeofconcision,a
k-
Voronoi-face
denotesanyk-dimensionalentityofthe
Voronoi
diagram.Noticethatif
S
doesnotcontainanyquintupleofcosphericalpoints,thenthepointsaresaidtobein
regularposition.
DelaunayTriangulation
TheDelaunaytrian-gulationcanbedefinedasthegeometricaldual,inasense,ofthe
Voronoi
diagram.Morepre-cisely,if
f
isak-faceofthe
Voronoi
diagramof
S,
suchthattheonly
Voronoi
cellscontaining
f
aretheonesassociatedtothepointsoftheset
FeS,
then
F
issaidtobea(3-k)-Delaunay-faceoftheconvexhullof
F.
NotethatifafaceisDelaunay-conforming,soareitsthreeedges,while
 
theconverseisuntrue.Theset
Vs
formedwith
S
andallthek-Delaunay-facesdefinedby
V(S)
iscalledthe
Delaunaycovering-up
of
S.
Thefol-lowingresultisusuallyknownasthe
emptyballproperty
[Delaunay-34]:Theorem1..1(Emptyballcriterion).
Un-
derthepreviousassumptions,
Vs
is
aconformingmeshoftheconvexhullConv(S)ofS.Ad-simplex
K
is
anelementof
Vs
ifandonlyiftheclosedcircumscribedballBKof
K
doesnotcontainanypointofSbuttheverticesof
K.
NoticethattheDelaunay-covering-up
Vs
isatri-angulation,theso-called
Delaunaytriangulation
of
S,
ifandonlyifthepointsof
S
areinreg-ularposition.TheDelaunaytriangulationisnotunique,sincenon-simplicialelementsoftheuniquecovering-up
Vs
allowsseveralsimplicialdecompo-sitions.ConstrainedtriangulationLetconsiderafi-nitepointset
S
andatopologicalconstraint
r
(setofedgesandpossiblytriangularfaces).Thever-ticesof
r
formasubset
S(r)
of
S.
Moreprecisely,afinitesetofedgesandpossiblytriangularfaces
r
of
IRd
iscalleda
fieldofconstraints
ifitsver-ticesbelongto
S,
anditsedges(resp.faces)havenointersectionbuttheirendpoints(resp.bound-aries).Inaddition,anypointof
S
shallnotbelongtotheinteriorofanyentityof
r.
Atriangulation
T
exactly
complieswithafieldofconstraints
r
ifanycomponentof
r
fullyexistsin
T.
However,theuniqueDelaunay-covering-up
Vs
of
S
doesnotgenerallyallowexactcompliancewith
r,
since
Vs
isacovering-upoftheconvexhull.Therefore,itisusefultoproposeaweakeneddefinitionforacon-strainedtriangulation,ofamoregeneralusage.Atriangulation
T
weakly
complieswithafieldofconstraints
r
ifanycomponentof
r
existsexactlyorbycovering-upin
T.
Inotherwords,weakcom-plianceof
r
isequivalenttoexactcomplianceofafieldofconstraints
I",
theedgesandpossiblyfacesofwhichareobtainedbylocalmodificationsofentitiesof
r.
2.GEOMETRICISSUES
2.1FacesThe0
3
function,presentedin[Pebay-98c],isshortlyrecalledsinceitisre-usedthroughoutthispaper.Definition2..
1.
Givenf
=
[PiPjPk]
E
r
antitscircumscribedcircle
C
ijk,theball(resp.sphere)sothat
C
ijk
is
oneofitsbigcircles
is
called
smallball
(resp.
smallsphere)
of
t,
denotedasBijk(resp.8Bijk.1itkand1iijkarethetwoopenhalf-spaceslimitedbytheplane(PiPjPk),andSijk
=
BijknS.Thecircumscribedballofanon-degeneratedtetra-hedront
is
denotedasB
t.
Providedthesenota-tions,the
face-type
of
t,
denotedas0
3
(1),
is
de-finedas:IfSijk
=
{Pi,Pj,Pk},then0
3
(1)
=
o.
IfSijk\{Pi,Pj,Pd
=
E
-I-
0,
sothatE
C
1itkorE
C
1iijk'considerQ*
E
EsothattheradiusofthecircumscribedballB
t
oft
=
PiPjPkQ*
is
maximal;ifQ*
E
8Bijkorif
s,
n
S{Pi,Pj,Pk,Q*},then0
3
(1)
=
1.0,.
o
if
s,
nS
-I-
0,
then0
3
(1)
=
1.1,.
o
ifQ*
tJ_
8BijkandB
t
n
S
=
0
and(B
t
n
S)\{Pi,Pj,Pk,Q
"l
=
F
-I-
0,
then:
*
ifF
U
{Q*}
C
1itkorifF
U
{Q*}
C
1iijk'then0
3
(1)
=
1.2.0,.
*
if(F
U
{Q*})
n
1itk
-I-
0
and(F
U
{Q*})
n
1iijk
-I-
0,
then
0
3
(1)
=
1.2.1.
IfSijk
n
1iijk
=
{Pi,Pj,Pd,Sijk
n
1itk
-I-
0
andSijk
n
1iijk
-I-
0,
then0
3
(1)
=
2.
IfSijk
n
1iijk
-I-
{Pi,Pj,Pk},then0
3
(1)
=
3.Thefollowingtheoremallowstodecidewhetherornotagiven
fEr
willappearinanyDelaunay-triangulationofConv
(S):
Theorem2..
1.
Aface
fEr
is
stronglyDelaunay-conformingifandonlyif
0
3
(1)
E
{O;
1.0;1.2.0}.
Proof.
Forthesakeofconcision,theproofofthistheoremisnotgivenhere,sinceithasbeencitedin[Pebay-98c].Afullproofisdetailedinthedownload-able/[Pebay-98a].D
Search History:
Searching...
Result 00 of 00
00 results for result for
  • p.
  • Notes
    Load more