Counting and cutting cycles of lines and rods in space

A number of rendering algorithms in computer graphics sort three-dimensional objects by depth and assume that there is no cycle that makes the sorting impossible. One way to resolve the problem caused by cycles is to cut the objects into smaller pieces. The problem of estimating how many such cuts are always sufficient is addressed. A few related algorithmic and combinatorial geometry problems are considered.<<ETX>>

[1]  János Pach,et al.  Weaving Patterns of Lines and Segments in Space , 1990, SIGAL International Symposium on Algorithms.

[2]  An optimal algorithm for intersecting line segments in the plane , 1992, JACM.

[3]  Walter Whiteley.  Rigidity and polarity , 1989 .

[4]  Henry Fuchs,et al.  On visible surface generation by a priori tree structures , 1980, SIGGRAPH '80.

[5]  Alfred V. Aho,et al.  Data Structures and Algorithms , 1983 .

[6]  Micha Sharir,et al.  Output-sensitive hidden surface removal , 1989, 30th Annual Symposium on Foundations of Computer Science.

[7]  Herbert Edelsbrunner,et al.  Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.

[8]  Leonidas J. Guibas,et al.  Combinatorial complexity bounds for arrangements of curves and spheres , 1990, Discret. Comput. Geom..

[9]  F. Frances Yao,et al.  Binary partitions with applications to hidden surface removal and solid modelling , 1989, SCG '89.

[10]  B. Bollobás,et al.  Extremal Graph Theory , 2013 .

[11]  Kurt Mehlhorn,et al.  Data Structures and Algorithms 1: Sorting and Searching , 2011, EATCS Monographs on Theoretical Computer Science.

[12]  Endre Szemerédi,et al.  Extremal problems in discrete geometry , 1983, Comb..

[13]  E. J. F. Primrose.  Analytic Geometry of Three Dimensions, Vol. II. By G. Salmon. Pp. xvi, 334. $4.95. 1965. (Chelsea, New York) , 1967 .

[14]  Kurt Mehlhorn,et al.  Data Structures and Algorithms 2: Graph Algorithms and NP-Completeness , 1984, EATCS Monographs on Theoretical Computer Science.

[15]  Prof. Dr. Kurt Mehlhorn,et al.  Data Structures and Algorithms 1 , 1984, EATCS.

[16]  F. Frances Yao,et al.  Optimal binary space partitions for orthogonal objects , 1990, SODA '90.