Binary Plane Partitions for Disjoint Line Segments

被引：3

作者：

Toth, Csaba D. ^{[1
]}

机构：

[1] Univ Calgary, Dept Math & Stat, Calgary, AB T2N 1N4, Canada

来源：

DISCRETE & COMPUTATIONAL GEOMETRY | 2011年 / 45卷 / 04期

基金：

加拿大自然科学与工程研究理事会;

关键词：

Binary space partitions; Line segments; SPACE PARTITIONS; FAT RECTANGLES; BSP TREES; SCENES; RAY;

D O I：

10.1007/s00454-011-9341-0

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

A binary space partition (BSP) for a set of disjoint objects in Euclidean space is a recursive decomposition where each step partitions the space (and possibly some of the objects) along a hyperplane and recurses on the objects clipped in each of the two open half-spaces. The size of a BSP is defined as the number of resulting fragments of the input objects. It is shown that every set of n disjoint line segments in the plane admits a BSP of size O(nlog n/log log n). This bound is the best possible.

引用

页码：617 / 646

页数：30

共 50 条

[1] Binary Plane Partitions for Disjoint Line Segments
Csaba D. Tóth
[J]. Discrete & Computational Geometry, 2011, 45 : 617 - 646
[2] Binary Plane Partitions for Disjoint Line Segments
Toth, Csaba D.
[J]. PROCEEDINGS OF THE TWENTY-FIFTH ANNUAL SYMPOSIUM ON COMPUTATIONAL GEOMETRY (SCG'09), 2009, : 71 - 79
[3] Illuminating Disjoint Line Segments in the Plane
Csaba D. Tóth
[J]. Discrete & Computational Geometry, 2003, 30 : 489 - 505
[4] Illuminating disjoint line segments in the plane
Tóth, CD
[J]. DISCRETE & COMPUTATIONAL GEOMETRY, 2003, 30 (03) : 489 - 505
[5] OPTIMAL BINARY SPACE PARTITIONS FOR SEGMENTS IN THE PLANE
De Berg, Mark
Khosravi, Amirali
[J]. INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 2012, 22 (03) : 187 - 205
[6] Every Set of Disjoint Line Segments Admits a Binary Tree
P. Bose
M. E. Houle
G. T. Toussaint
[J]. Discrete & Computational Geometry, 2001, 26 : 387 - 410
[7] Every set of disjoint line segments admits a binary tree
Bose, P
Houle, ME
Toussaint, GT
[J]. DISCRETE & COMPUTATIONAL GEOMETRY, 2001, 26 (03) : 387 - 410
[8] Binary space partitions or line segments with a limited number of directions
Tóth, CD
[J]. SIAM JOURNAL ON COMPUTING, 2003, 32 (02) : 307 - 325
[9] Binary space partitions for line segments with a limited number of directions
Tóth, CD
[J]. PROCEEDINGS OF THE THIRTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2002, : 465 - 471
[10] Forcing disjoint segments in the plane
Goddard, W
Katchalski, M
Kleitman, DJ
[J]. EUROPEAN JOURNAL OF COMBINATORICS, 1996, 17 (04) : 391 - 395

← 1 2 3 4 5 →