登入選單
返回Google圖書搜尋
出版Department of Computer Science, Utrecht University, 1993
URLhttp://books.google.com.hk/books?id=lIzjGwAACAAJ&hl=&source=gbs_api
註釋Abstract: "In this paper we discuss some results on perfect binary space partitions on sets of non-intersecting line segments in two dimensions. A binary space partition is a scheme for recursively dividing a configuration of objects by hyperplanes until all objects are separated. A binary space partition is called perfect when none of the objects is cut by the hyperplanes used by the binary space partition. Given a set of n non-intersecting line segments, our method constructs a perfect binary space partition, or decides that no perfect binary space partition exists for the arrangement of line segments, in O(n2 log n) time."