Stabbing information of a simple polygon

Discrete Applied Mathematics

Volumn 91, Issue 1-3, 1999, Pages 67-82

  Everett, Hazel ^a   Hurtado, Ferran ^b   Noy, Marc ^b  

^a UNIVERSITÉ DU QUÉBEC À MONTRÉAL   (Canada)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0347797286     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(98)00144-9     Document Type: Article

References (10)

1. B. Chazelle, Triangulating a simple polygon in linear time, Discrete Comput. Geometry (1991) 485-524.
2. B. Chazelle, L. Guibas, D.T. Lee, The power of geometric duality, BIT 25 (1985) 76-90.
3. H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer, Berlin, Germany, 1987.
4. H. Edelsbrunner, J. O'Rourke, R. Seidel, Constructing arrangements of lines and hyperplanes, with applications, SIAM J. Comput. 15 (1986) 341-363.
5. H. Everett, A. Lubiw, J. O'Rourke, Recovery of convex hulls from external visibility graphs, Proc. 5th Canadian Conf. on Comp. Geom., 1993, pp. 309-314.
6. J. Goodman, R. Pollack, Multidimensional sorting, SIAM J. Comput. 12 (1983) 484-507.
7. J. Goodman, R. Pollack, Allowable sequences and order types in discrete and computational geometry, in: J. Pach (Eds.), New Trends in Discrete and Computational Geometry, Springer, Berlin, 1993, pp. 103-134.
8. J. Hershberger, An optimal visibility graph algorithm for triangulated simple polygons, Algorithmica 4 (1989) 141-155.
9. A. Melkman, On-line construction of the convex hull of a simple polyline, Inform. Process. Lett. 25 (1987) 11-12.
10. J. O'Rourke and I. Pashchenko, Zero-parity stabbing information, Proc. Japan Conf. Discrete Comput. Geom. '98, Tokyo, 1998, to appear.