Erased arrangements of lines and convex decompositions of polyhedra
暂无分享,去创建一个
[1] Micha Sharir,et al. On Disjoint Concave Chains in Arrangements of (Pseudo) Lines , 1994, Inf. Process. Lett..
[2] B. Joe. Tetrahedral mesh generation in polyhedral regions based on convex polyhedron decompositions , 1994 .
[3] Raimund Seidel,et al. On the difficulty of triangulating three-dimensional Nonconvex Polyhedra , 1992, Discret. Comput. Geom..
[4] Richard Pollack,et al. Discrete and Computational Geometry: Papers from the DIMACS Special Year , 1991, Discrete and Computational Geometry.
[5] Tamal K. Dey,et al. Triangulation and CSG representation of polyhedra with arbitrary genus , 1991, SCG '91.
[6] F. Frances Yao,et al. Efficient binary space partitions for hidden-surface removal and solid modeling , 1990, Discret. Comput. Geom..
[7] Leonidas J. Guibas,et al. Combinatorial complexity bounds for arrangements of curves and spheres , 1990, Discret. Comput. Geom..
[8] Rephael Wenger,et al. Upper bounds on geometric permutations for convex sets , 1990, Discret. Comput. Geom..
[9] Bernard Chazelle,et al. Triangulating a non-convex polytype , 1989, SCG '89.
[10] Kenneth L. Clarkson,et al. Applications of random sampling in computational geometry, II , 1988, SCG '88.
[11] Herbert Edelsbrunner,et al. On the maximal number of edges of many faces in an arrangement , 1986, J. Comb. Theory, Ser. A.
[12] Kurt Mehlhorn,et al. Sorting Jordan Sequences in Linear Time Using Level-Linked Search Trees , 1986, Inf. Control..
[13] Micha Sharir,et al. Nonlinearity of davenport—Schinzel sequences and of generalized path compression schemes , 1986, FOCS.
[14] Kurt Mehlhorn,et al. Sorting Jordan sequences in linear time , 1985, SCG '85.
[15] L. Guibas,et al. Primitives for the manipulation of general subdivisions and the computation of Voronoi , 1985, TOGS.
[16] Bernard Chazelle,et al. Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm , 1984, SIAM J. Comput..
[17] Leonidas J. Guibas,et al. Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams , 1983, STOC.
[18] Raimund Seidel,et al. Constructing arrangements of lines and hyperplanes with applications , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[19] Leonidas J. Guibas,et al. The power of geometric duality , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[20] Andrzej Lingas,et al. The Power of Non-Rectilinear Holes , 1982, ICALP.
[21] R. Canham. A theorem on arrangements of lines in the plane , 1969 .
[22] E. Wright,et al. An Introduction to the Theory of Numbers , 1939 .
[23] Bruce G. Baumgart. A polyhedron representation for computer vision , 1975, AFIPS '75.
[24] Bernard Chazelle,et al. Triangulating a nonconvex polytope , 1990, Discret. Comput. Geom..
[25] David Eppstein,et al. Horizon Theorems for Lines and Polygons , 1990, Discrete and Computational Geometry.
[26] Herbert Edelsbrunner,et al. Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.