Lines in Space: Combinatorics and Algorithms

Algorithmica (New York)

Volumn 15, Issue 5, 1996, Pages 428-447

  Chazelle, B ^a   Edelsbrunner, H ^b   Guibas, L J ^c,e   Sharir, M ^d,f   Stolfi, J ^e  

^a Princeton University   (United States)

^b University of Illinois at Urbana Champaign   (United States)

^c STANFORD UNIVERSITY   (United States)

^d TEL AVIV UNIVERSITY   (Israel)

^e HEWLETT PACKARD COMPANY   (United States)

^f NEW YORK UNIVERSITY   (United States)

Author keywords

Computational geometry; Lines in space; Pl cker coordinates; Nets

Indexed keywords

EID: 0000901879     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01955043     Document Type: Article

References (37)

1. P. Agarwal, Geometric partitioning and its applications, in Discrete and Computational Geometry Papers from the DIMACS Special Year, American Mathematical Society, Providence, RI, 1991.
2. B. Aronov, M. Pellegrini, and M. Sharir, On the zone of a surface in a hyperplane arrangement, In preparation. See also Proc. 2nd WADS Workshop, 1991, Lecture Notes in Computer Science, Vol. 519, Springer-Verlag, Berlin, pp. 13-19, for an early version by two of the authors.
3. O. Bottema and B. Roth, Theoretical Kinematics, Dover, New York, 1990.
4. B. Chazelle, H. Edelsbrunner, L. Guibas, R. Pollack, R. Seidel, M. Sharir, and J. Snoeyink, Counting and cutting cycles of lines and line segments in space, Proc. 31st IEEE Symp. on Foundations of Computer Sciencè, 1990, pp. 242-251.
5. B. Chazelle, H. Edelsbrunner, L. Guibas, and M. Sharir, Algorithms for Dichromatic line segment problems and polyhedral terrains, In preparation. An earlier version of this paper, combined with the current paper, has appeared in Proc. 21st ACM Symp. on Theory of Computing, 1989, pp. 382-393.
6. B. Chazelle, H. Edelsbrunner, L. Guibas, and M. Sharir, A singly-exponential stratification scheme for real semi-algebraic varieties and its applications, Proc. 16th ICALP Colloq., Lectures Notes in Computer Science, Vol. 372, Springer-Verlag, Berlin, 1989, pp. 179-193.
7. K. Clarkson, H. Edelsbrunner, L. Guibas, M. Sharir, and E. Welzl, Combinatorial complexity bounds for arrangements of curves and surfaces, Proc. 29th IEEE Symp. on Foundations of Computer Science, 1988, pp. 568-579.
8. B. Chazelle and J. Friedman, A deterministic view of random sampling and its use in geometry, Combinatorica, 10 (1990), 229-249.
9. B. Chazelle, An optimal convex hull algorithm and new results on cuttings, Proc. 32nd Symp. on Foundations of Computer Science, 1991, pp. 29-38.
10. K. Clarkson, New applications of random sampling in computational geometry. Discrete Comput. Geom., 2 (1987), 195-222.
11. K. Clarkson, A probabilistic algorithm for the post office problem, Proc. 17th ACM Symp. on Theory of Computing, 1985, pp. 175-184.
12. K. Clarkson, Applications of random sampling in computational geometry, Discrete Comput. Geom., 4 (1989), 387-421.
13. H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer-Verlag, Heidelberg, 1987.
14. H. Edelsbrunner, L. Guibas, and M. Sharir, The complexity of many faces in arrangements of lines and of segments, Proc. 4th ACM Symp. on Computational Geometry, 1988, pp. 44-55.
15. H. Edelsbrunner, L. Guibas, and M. Sharir, The complexity of many faces in arrangements of planes and related problems, Discrete Comput. Geom., 5 (1990), 197-216.
16. G. Fano and A. Terracini, Lezioni di Geometria Analitica e Proiettiva, Paravia, 1939.
17. Z. Gigus, J. Canny, and R. Seidel, Efficiently computing and representing aspect graphs of polyhedral objects, Technical Report UCB/CSD 88/432, Univesrity of California at Berkeley, August 1988.
18. W. Hodge and D. Pedoe, Methods of Algebraic Geometry, Cambridge University Press, Cambridge, 1952.
19. K. Hunt, Kinematic Geometry of Mechanisms, Oxford, 1990.
20. D. Haussler and E. Welzl, Epsilon nets and simplex range searching. Discrete Comput. Geom., 2 (1987), 127-151.
21. A. Inselberg, N-dimensional graphics. Part I - lines and hyperplanes. Scientific Center Report G320-2711, IBM, Los Angeles, CA, 1981.
22. C. M. Jessop, A Treatise on the Line Complex, Chelsea, New York, 1969.
23. J. Matoušek, Construction of ε-nets. Discrete Comput. Geom., 5 (1990), 427-448.
24. J. Matoušek, Cutting hyperplane arrangements, Discrete Comput. Geom., 6 (1991), 385-406.
25. J. Matoušek, Approximations and optimal geometric divide-and-conquer, Proc. 23rd Annual ACM Symp. on Theory of Computing, 1991, pp. 506-511.
26. M. McKenna, Arrangements of lines in 3-space: a data structure with applications, Ph.D. Dissertation, Johns Hopkins University, 1989.
27. J. Milnor. On the Betti numbers of real varieties, Proc. Amer. Math. Soc., 15 (1964), 275-280.
28. M. McKenna and J. O'Rourke, Arrangements of lines in 3-space: a data structure with applications, Proc. 4th ACM Symp. on Computational Geometry, 1988, pp. 371-380.
29. M. Paterson, Personal communication.
30. W. H. Plantinga and C. R. Dyer, An algorithm for constructing the aspect graph, Proc. 27th IEEE Symp. on Foundations of Computer Science, 1986, pp. 123-131.
31. J. Plücker, On a new geometry of space, Philos. Trans. Roy. Soc. London, 155 (1865), 725-791.
32. J. Pach, R. Pollack, and E. Welzl, Weaving patterns of lines and line segments, Proc. 1st SlGAL Symp., Lecture Notes in Computer Science, Vol. 450, Springer-Verlag, Berlin, 1990, pp. 437-446.
33. R. Seidel, Constructing higher dimensional convex hulls at logarithmic cost per face, Proc. 18th ACM Symp. on Theory of Computing, 1986, pp. 404-413.
34. M. Sharir, On k-sets in arrangements of curves and surfaces, Discrete Comput. Geom., 6 (1991), 593-613.
35. M. Sharir, On joints in arrangements of lines in space and related problems. In preparation.
36. D. M. Y. Sommerville, Analytical Geometry of Three Dimensions, Springer-Verlag, Heidelberg, 1987.
37. J. Stolfi, Oriented Protective Geometry, Academic Press, New York, 1991.