Assertion: triangulation | /r/HasAspect | at most 2n − 2 − b triangles
Facets:
value: in the plane
type: LOCATION
Source sentences:
text: In the plane (d = 2), if there are b vertices on the convex hull, then any triangulation of the points has at most 2n − 2 − b triangles, plus one exterior face" should be
text: In the plane ( d = 2), if there are b vertices on the convex hull, then any triangulation of the points has at most 2 n − 2 − b triangles, plus one exterior face (see Euler characteristic).
text: "In the plane (d = 2), if there are b vertices that lie on the boundary of the convex hull, then any triangulation of the points has at most 2n − 2 − b triangles, plus one exterior face".
text: In the plane, if there are b vertices on the convex hull, then any triangulation of the points has at most 2n − 2 − b triangles, plus one exterior face (see Euler characteristic).
text: In the plane ( d = 2), if there are b vertices on the convex hull, then any triangulation of the points has at most 2 n − 2 − b triangles, plus one exterior face (see Euler characteristic).