登入選單
返回Google圖書搜尋
其他書名
Combinatorics and Algorithms
出版Department of Computer Science, University of Illinois at Urbana-Champaign, 1990
URLhttp://books.google.com.hk/books?id=pMIVwGwXrR0C&hl=&source=gbs_api
註釋Abstract: "Questions about lines in space arise frequently as subproblems in 3-dimensional Computational Geometry. In this paper we study a number of fundamental combinatorial and algorithmic problems involving arrangements of n lines in 3-dimensional space. Our main results include: 1. A tight [Theta](n[superscript 2]) bound on the maximum combinatorial description complexity of the set of all oriented lines that have specified orientations relative to the n given lines. 2. A similar bound of [Theta](n[superscript 3]) for the complexity of the set of all lines passing above the n given lines