HOW MANY POTATOES ARE IN A MESH? Marc van Kreveld Maarten Lffler - PowerPoint PPT Presentation

UPPER BOUND M • Only count all G potatoes p containing p • Project all vertices from p and remove hit edges • Orient edges around p • Call resulting graph G 12

LEMMA M G p 13

LEMMA M The number of G potatoes in M p containing p is bounded by the number of cycles in G 13

LEMMA M The number of G potatoes in M p containing p is bounded by the number of cycles in G LEMMA 13