跨职能团队协作工具在2026年的技术跃迁：从线性列表到阵列拓扑

/**
 * 检测卡片在阵列中的插入位置是否与现有卡片产生空间冲突
 * @param {Array} existingCards - 当前阵列中已存在的卡片对象数组，每项包含x, y, width, height
 * @param {Object} newCard - 待插入的卡片，包含期望的x, y, width, height
 * @param {Object} viewport - 视口边界 { width, height }
 * @returns {Object} { isCollision, suggestedPosition, compressionRatio }
 */
function detectSpatialCollision(existingCards, newCard, viewport) {
    // 基础边界检测：是否超出视口
    const exceedsBounds = newCard.x + newCard.width > viewport.width ||
                          newCard.y + newCard.height > viewport.height ||
                          newCard.x < 0 || newCard.y < 0;
    
    // 与其他卡片的矩形重叠检测（轴对齐包围盒算法）
    let hasOverlap = false;
    let overlapCount = 0;
    
    for (const card of existingCards) {
        const overlapX = Math.max(0, Math.min(newCard.x + newCard.width, card.x + card.width) - 
                                      Math.max(newCard.x, card.x));
        const overlapY = Math.max(0, Math.min(newCard.y + newCard.height, card.y + card.height) - 
                                      Math.max(newCard.y, card.y));
        const overlapArea = overlapX * overlapY;
        
        if (overlapArea > 0) {
            hasOverlap = true;
            overlapCount++;
        }
    }
    
    // 计算当前区域的信息压缩比（高压缩比意味着需要用户关注）
    const occupiedArea = existingCards.reduce((sum, card) => sum + (card.width * card.height), 0);
    const totalArea = viewport.width * viewport.height;
    const compressionRatio = occupiedArea / totalArea;
    
    // 建议位置：如果发生碰撞，返回右侧或下方的第一个空闲网格点
    let suggestedPosition = null;
    if (hasOverlap || exceedsBounds) {
        suggestedPosition = {
            x: (newCard.x + newCard.width + 20) % viewport.width,
            y: newCard.y + newCard.height + 10
        };
    }
    
    return {
        isCollision: hasOverlap || exceedsBounds,
        suggestedPosition: suggestedPosition,
        compressionRatio: parseFloat(compressionRatio.toFixed(2)),
        overlapCount: overlapCount,
        needsAutoCompaction: compressionRatio > 0.65
    };
}