登录 注册 会员服务 联系我们

Binary space partitioning trees as an alternative representation of polytopes

  • Published:1990-05 Issue:4 Volume:22 Page:250-252
  • ISSN:0010-4485
  • Container-title:Computer-Aided Design
  • language:en
  • Short-container-title:Computer-Aided Design

Author:

Naylor B.

Publisher

Elsevier BV

Subject

Industrial and Manufacturing Engineering,Computer Graphics and Computer-Aided Design,Computer Science Applications

Reference11 articles.

1. An algorithm for geometric set operations using cellular subdivision techniques;Carlbom,1987

2. Set operations on polyhedra using binary space partitioning trees;Thibault;Comput. Graph.,1987

3. A priori based techniques for determining visibility priority for 3D scenes;Naylor,1981

4. Application of BSP trees to ray-tracing and CSG evaluation;Naylor,1986

5. Application of binary space partitioning trees to geometric modeling and ray-tracing;Thibault,1987

Cited by 20 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Sketch-Based Design of Foundation Paper Pieceable Quilts;The 35th Annual ACM Symposium on User Interface Software and Technology;2022-10-28

2. An Efficient Parallel Algorithm for Polygons Overlay Analysis;Applied Sciences;2019-11-13

3. A Novel and Efficient Algorithm for three-dimensional Coverage and Deployment of Aerial Robots in Vector Spaces;Journal of Geospatial Information Technology;2018-06-01

4. Occlusion points identification algorithm;Computer-Aided Design;2017-10

5. An evaluation and classification ofnD topological data structures for the representation of objects in a higher-dimensional GIS;International Journal of Geographical Information Science;2015-02-17
同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3