摘要
用计算机绘制巷道平面和立体图时,巷道是用双线表示的,对各类巷道及斜井、竖井进行立体投影时,经常产生巷道与巷道,巷道与井筒之间的交叉。目前国内在绘制巷道图时,不能自动判别巷道立体交叉及消去隐藏巷道的问题。本文详细介绍了解决此问题的基本原理和数学基础,并利用高级语言 Pascal编写了相应的程序。这个程序具有快速,高效的特点,所绘图形还能转到Anto CAD软件包进行其它编辑工作。最后简要论述了巷道立体图在矿山有关数据库管理中的应用和作用。
In computer drawing of 2-D and 3-D tunnel maps, the tunnels are usually represented by double lines. Intersetions between different tunnels as well as between tunnels and shafts are often existed after they are projected on a plane. At present, no easy solutions have been found in the automated detection of the intersections and the deletion of hidden tunnels when drawing underground tunnel maps. This paper introduces the basic principles and the mathematical foundations for solving this problem. The authors have also written the corresponding computer program using Pascal language. The program is quick and efficient, and the results obtained can be transfered into AutoCAD package for editing. The usage and application of the 3-D tunnel maps in mine data manegement are also briefly discussed.
出处
《中国矿业大学学报》
EI
CAS
CSCD
北大核心
1992年第3期33-39,共7页
Journal of China University of Mining & Technology
基金
高校博士点专项科研基金资助课题研究的成果之一
关键词
立体交叉
隐藏巷道
矿图
计算机
project, spatial intersection, hidden tunnels
