 				{
 					x = xyCoordinates[ix];
 					y = xyCoordinates[ix + 1];
-					
+
 					// check for part marker
 					if (isNaN(x) && isNaN(y))
 					{

		public function addPoint(vertexID:int, importance:Number, x:Number, y:Number):void
		{
			var partID:int = VectorUtils.binarySearch(partMarkers, vertexID, false);
			
			// special case - if this vertex is exactly at a part marker, it should go to the next part
			if (partID < partMarkers.length && partMarkers[partID] == vertexID)
				partID++;
			
			var part:BLGTree = parts[partID] as BLGTree;
			part.insert(vertexID, importance, x, y);
		}

						}
						continue; // haven't seen beginning of part yet
					}

					// skip invalid points
					if (!isFinite(x) || !isFinite(y))
						continue;

					// create chain link for this coordinate
					newVertex = VertexChainLink.getUnusedInstance(firstVertexID + numPoints, x, y);
					if (numPoints == 0)
