diff --git a/xatlas/xatlas.cpp b/xatlas/xatlas.cpp
index e118d03..1806925 100644
--- a/xatlas/xatlas.cpp
+++ b/xatlas/xatlas.cpp
@@ -2108,7 +2108,12 @@ public:
 	// This should compute convex hull and use rotating calipers to find the best box. Currently it uses a brute force method.
 	// If vertices are empty, the boundary vertices are used.
 	void compute(ConstArrayView<Vector2> vertices = ConstArrayView<Vector2>()) {
-		XA_DEBUG_ASSERT(!m_boundaryVertices.isEmpty());
+		//XA_DEBUG_ASSERT(!m_boundaryVertices.isEmpty());
+
+		if (m_boundaryVertices.isEmpty()) {
+			return;
+		}
+
 		if (vertices.length == 0)
 			vertices = m_boundaryVertices;
 		convexHull(m_boundaryVertices, m_hull, 0.00001f);