Revit二次开发 获取墙相交的墙,获取墙垂直的墙、平行的墙

获取墙相交且垂直的墙

 /// <summary>
        /// 获取墙相交且垂直的墙
        /// </summary>
        /// <param name="srcWall"></param>
        /// <param name="resLstWall"></param>
        public static void GetIntersectVerticalWall(this Wall srcWall, ref List<Wall> resLstWall, double HorOffset = 0.0027, double VerOffset = 0.0027, double bottomOffset = 0)
        {
            if (resLstWall == null)
            {
                resLstWall = new List<Wall>();
            }
            List<Wall> tmpLstWall = new List<Wall>();

            //连接的墙
            ICollection<ElementId> colIds = JoinGeometryUtils.GetJoinedElements(srcWall.Document, srcWall);
            foreach (ElementId eid in colIds)
            {
                Wall tmpWall = srcWall.Document.GetElement(eid) as Wall;
                if (tmpWall == null)
                {
                    continue;
                }
                if (CheckTwoWallRelation(srcWall, tmpWall) == 1)
                {
                    tmpLstWall.Add(tmpWall);
                }
            }

            //利用墙底面做solid寻找相交并且垂直的墙
            ElementClassFilter ecFilter = new ElementClassFilter(typeof(Wall));
            List<Element> lstEle = GetAllWallIntersectElement(srcWall, ecFilter, HorOffset, VerOffset, bottomOffset);
            foreach (Element ele in lstEle)
            {
                if (ele is Wall)
                {
                    if (CheckTwoWallRelation(srcWall, ele as Wall) == 1)
                    {
                        tmpLstWall.Add(ele as Wall);
                    }
                }
            }
            //记录墙体id筛除重复
            List<int> lstIds = new List<int>();
            //筛出重复
            foreach (Wall tmpWall in tmpLstWall)
            {
                if (lstIds.Contains(tmpWall.Id.IntegerValue))
                {
                    continue;
                }
                lstIds.Add(tmpWall.Id.IntegerValue);
                resLstWall.Add(tmpWall);
            }
        }

获取墙相交且平行的墙

 /// <summary>
        /// 获取墙相交且平行的墙
        /// </summary>
        /// <param name="srcWall"></param>
        /// <param name="resLstWall"></param>
        public static void GetIntersectParallelWall(this Wall srcWall, ref List<Wall> resLstWall)
        {
            if (resLstWall == null)
            {
                resLstWall = new List<Wall>();
            }
            List<Wall> tmpLstWall = new List<Wall>();

            //连接的墙
            ICollection<ElementId> colIds = JoinGeometryUtils.GetJoinedElements(srcWall.Document, srcWall);
            foreach (ElementId eid in colIds)
            {
                Wall tmpWall = srcWall.Document.GetElement(eid) as Wall;
                if (tmpWall == null)
                {
                    continue;
                }
                if (CheckTwoWallRelation(srcWall, tmpWall) == 0)
                {
                    tmpLstWall.Add(tmpWall);
                }
            }

            //利用墙底面做solid寻找相交并且垂直的墙
            ElementClassFilter ecFilter = new ElementClassFilter(typeof(Wall));
            List<Element> lstEle = GetAllWallIntersectElement(srcWall, ecFilter);
            foreach (Element ele in lstEle)
            {
                if (ele is Wall)
                {
                    if (CheckTwoWallRelation(srcWall, ele as Wall) == 0)
                    {
                        tmpLstWall.Add(ele as Wall);
                    }
                }
            }
            //记录墙体id筛除重复
            List<int> lstIds = new List<int>();
            //筛出重复
            foreach (Wall tmpWall in tmpLstWall)
            {
                if (lstIds.Contains(tmpWall.Id.IntegerValue) || tmpWall.Id.IntegerValue == srcWall.Id.IntegerValue)
                {
                    continue;
                }
                lstIds.Add(tmpWall.Id.IntegerValue);
                resLstWall.Add(tmpWall);
            }
        }
  • 0
    点赞
  • 2
    收藏
    觉得还不错? 一键收藏
  • 1
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值