Javascript 在数组中查找重叠对象并仅返回那些重叠对象

const arr = [
    {
        "id": "line-23746045",
        "line_top": 543,
        "line_bottom": 521
    },
    {
        "id": "line-23746033",
        "line_top": 132,
        "line_bottom": 110
    },
    {
        "id": "line-23746031",
        "line_top": 138,
        "line_bottom": 116
    },
    {
        "id": "line-23746029",
        "line_top": 143,
        "line_bottom": 121
    }
]

const intersected = new Set;
const intersect = (val, item) => val >= item.line_bottom && val <= item.line_top;
const result = arr.filter((item, idx, arr) => {
  let found = false;
  for(let i = idx + 1; i < arr.length; i++){
    const next = arr[i];
    if(intersect(item.line_bottom, next) || intersect(item.line_top, next)){
      intersected.add(next);
      found = true;
    }
  }
  return found || intersected.has(item);
});

console.log(result);

const arr = [
    {
        "id": "line-23746045",
        "line_top": 543,
        "line_bottom": 521
    },
    {
        "id": "line-23746033",
        "line_top": 132,
        "line_bottom": 110
    },
    {
        "id": "line-23746031",
        "line_top": 138,
        "line_bottom": 116
    },
    {
        "id": "line-23746045",
        "line_top": 580,
        "line_bottom": 530
    },
    {
        "id": "line-23746029",
        "line_top": 143,
        "line_bottom": 121
    }
]

const groups = [];
const intersected = new Map;
const intersect = (val, item) => val >= item.line_bottom && val <= item.line_top;

for(let j = 0; j < arr.length; j++){
  const item = arr[j];
  let found = false;
  const intersected = []; // collect intersected groups and merge them
  for(const group of groups){
    debugger;
    if(intersect(item.line_bottom, group) || intersect(item.line_top, group)){
      intersected.push(group);
    }
  }
  if(!intersected.length){
    groups.push({line_bottom: item.line_bottom, line_top: item.line_top, items: [item]});
  } else {
    // merge groups
    const first = intersected[0];
    let min = first.line_bottom, max = first.line_top;
    for(let i = 1; i < intersected.length; i++){
      const group = intersected[i];
      first.items.push(...group.items);
      if(min > group.line_bottom) min = group.line_bottom;
      if(max < group.line_top) max = group.line_top;
      groups.splice(groups.indexOf(group), 1);
    }
    if(min > item.line_bottom) min = item.line_bottom;
    if(max < item.line_top) max = item.line_top;
    first.line_bottom = min;
    first.line_top = max;
    first.items.push(item);
  }
}

console.log(groups);

.as-console-wrapper{ max-height: 100% !important}