Erased arrangements of lines and convex decompositions of polyhedra

Computational Geometry: Theory and Applications

Volumn 9, Issue 3, 1998, Pages 129-143

  Hershberger, J E ^a   Snoeyink, J S ^b  

^a MENTOR GRAPHICS CORPORATION   (United States)

^b UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

Arrangements; Computational geometry; Convex decomposition; Horizon theorems; Polyhedra

Indexed keywords

EID: 0040843488     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(97)00024-2     Document Type: Article

References (24)

1. B. Baumgart, A polyhedral representation for computer vision, in: Proceedings of the AFIPS National Computer Conference, 1975, pp. 589-596.
2. M. Bern, D. Eppstein, P. Plassmann, F. Yao, Horizon theorems for lines and polygons, in: J.E. Goodman, R. Pollack, W. Steiger (eds.), Discrete and Computational Geometry: Papers from the DIMACS Special Year, American Mathematical Society, Providence, RI, 1991, pp. 45-66.
3. R.J. Canham, A theorem on arrangements of lines in the plane, Israel J. Math. 7 (1969) 393-397.
4. B. Chazelle, Convex partitions of polyhedra: A lower bound and worst-case optimal algorithm, SIAM J. Comput. 13 (3) (1984) 488-507.
5. B. Chazelle, L.J. Guibas, D.T. Lee, The power of geometric duality, BIT 25 (1985) 76-90.
6. B. Chazelle, L. Palios, Triangulating a nonconvex polytope, Discrete Comput. Geom. 5 (1990) 505-526.
7. K.L. Clarkson, H. Edelsbrunner, L. Guibas, M. Sharir, E. Welzl, Combinatorial complexity bounds for arrangements of curves and spheres, Discrete Comput. Geom. 5 (1990) 99-160.
8. K.L. Clarkson, P.W. Shor, Applications of random sampling in computational geometry, II, Discrete Comput. Geom. 4 (1989) 387-421.
9. T.K. Dey, Triangulation and CSG representation of polyhedra with arbitrary genus, in: Proc. 7th Ann. ACM Symp. Comput. Geom., 1991, pp. 364-372.
10. D. Dobkin, L. Guibas, J. Hershberger, J. Snoeyink, An efficient algorithm for finding the CSG representation of a simple polygon, Algorithmica 10 (1993) 1-23.
11. H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer, Berlin, 1987.
12. H. Edelsbrunner, J. O'Rourke, R. Seidel, Constructing arrangements of lines and hyperplanes with applications, SIAM J. Comput. 15 (1986) 341-363.
13. H. Edelsbrunner, E. Welzl, On the maximal number of edges of many faces in an arrangement, J. Combin. Theory Ser. A 41 (1986) 159-166.
14. L. Guibas, J. Stolfi, Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams, ACM Trans. Graph. 4 (2) (1985) 74-123.
15. D. Halperin, M. Sharir, On disjoint concave chains in arrangements of pseudolines, Inform. Process. Lett. 40 (1991) 189-192.
16. G.H. Hardy, E.M. Wright, An Introduction to the Theory of Numbers, Oxford, 1979.
17. S. Hart, M. Sharir, Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes, Combinatorica 6 (1986) 151-177.
18. K. Hoffmann, K. Mehlhorn, P. Rosenstiehl, R.E. Tarjan, Sorting Jordan sequences in linear time, Inform. Control 68 (1986) 170-184.
19. B. Joe, Tetrahedral mesh generation in polyhedral regions based on convex polyhedron decompositions, Internat. J. Numer. Methods Engrg. 37 (1994) 693-713.
20. T. Kövári, V.T. Sós, P. Turan, On a problem of K. Zarankeiwìcz, Colloq. Math. 3 (1954) 50-57.
21. A. Lingas, On the power of non-rectilinear holes, in: Proc. 9th ICALP, Lecture Notes in Computer Science 140, Springer, New York, 1982, pp. 369-383.
22. M.S. Paterson, F.F. Yao, Efficient binary space partitions for hidden-surface removal and solid modelling, Discrete Comput. Geom. 5 (1990) 485-503.
23. J. Ruppert, R. Seidel, On the difficulty of triangulating three-dimensional nonconvex polyhedra, Discrete Comput. Geom. 7 (1992) 227-253.
24. R. Wenger, Upper bounds on geometric permutations for convex sets, Discrete Comput. Geom. 5 (1990) 27-33.