Intersecting maps Point location Computing intersection areas of overlaid 2 D meshes

V=∑(v ∘ t̂ )(v∘ n̂)(v ∘ b̂)÷6 Algorithm: output adjacencies that are input adjacencies 1.Input adjacency: h , w.l.o.g., h in M0 2.h is adjacent to two faces fl,fr 3.Vertex of h: v -– v is in a face f’ of M1 4.h is part of two outfaces: (fl,f’) and (fr,f’) 5.Normal vector of h may need to be negated 6.Area component (outface-id, area) computed for each outface 7.Total area of each outface obtained by summing its components l rit : t t j c ci s t t r i t j c ci s .I t j c cy: , .l. . ., i 0 . is j c t t t f c s fl,fr . rt x f : v v is i f c f’ f 1 . is rt f t tf c s: (fl,f’) (fr,f’) . r l v ct r f y t t . r c t ( tf c -i , r ) c t f r c tf c . t l r f c tf c t i y s i its c ts