u were given a convex polyhedron. Your task is to modify it into a similar-looking convex polyhedron that has no triangular faces. You are only permitted to add new faces of negligible dimensions (when compared to original faces) by truncating vertices. Come up with the best possible approximation algorithm for determining the minimal number of vertices to truncate. Not a program.