From 5a2b89981cdf033c50bf24cdb80084501e3659ea Mon Sep 17 00:00:00 2001
From: Marius Kintel <marius@kintel.net>
Date: Mon, 5 Jan 2015 17:37:14 -0500
Subject: [PATCH] Minor fix: If we know that a PolySet is convex, there is no
 need to perform a computationally expensive test. Should improve #1090

---
 src/cgalutils.cc | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/src/cgalutils.cc b/src/cgalutils.cc
index e9f348b6..971f12f7 100644
--- a/src/cgalutils.cc
+++ b/src/cgalutils.cc
@@ -45,7 +45,7 @@ static CGAL_Nef_polyhedron *createNefPolyhedronFromPolySet(const PolySet &ps)
 	// we tessellate the polyset before checking.
 	PolySet psq(ps);
 	psq.quantizeVertices();
-    PolySet ps_tri(3);
+	PolySet ps_tri(3, psq.convexValue());
 	PolysetUtils::tessellate_faces(psq, ps_tri);
 	if (ps_tri.is_convex()) {
 		typedef CGAL::Exact_predicates_inexact_constructions_kernel K;