No Quadrangulation is extremely odd

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1004, Issue , 1995, Pages 372-381

  Bose, Prosenjit ^a   Toussaint, Godfried ^b  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^b MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

CONVEX HULL; EXTREME POINTS; PLANAR SUBDIVISION; QUADRANGULATION; TIME BOUND;

ARTIFICIAL INTELLIGENCE;

EID: 21844504391     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0015443     Document Type: Conference Paper

References (15)

1. Arkin, E., M. Held, J. Mitchell, and S. Skiena, Hamiltonian triangulations for fast rendering, Algorithms-ESA’94, J. van Leeuwen, ed., Utrecht, NL, LNCS 855, pp. 36-47, September 1994.
2. Bondy, J. and U.S.R. Murty, Graph Theory with Applications. Elsevier Science, New York, New York, 1976.
3. Bose, P. and G. Toussaint, No Quadrangulation is Extremely Odd. Tech. Rpt. 95-03, Dept. of Comp. Sci., University of British Columbia, Vancouver, Canada, 1995.
4. Chazelle, B., On the convex layers of a planar set, IEEE Transactions on Information Theory, IT-31, pp. 509-517, 1985.
5. Everett, H., W. Lenhart, M. Overmars, T. Shermer, and J. Urrutia, Strictly convex quadrilateralizations of polygons, in Proceedings of the 4th Canadian Conference on Computational Geometry, pp. 77-83, 1992.
6. Hershberger, J., and S. Suri, Applications of a semi-dynamic convex hull algorithm, in Proceedings of the second S.W.A.T., Lecture Notes in Computer Science 441, Bergen, Sweden, pp. 380-392, 1990.
7. Kahn, J., M. Klawe, D. Kleitman, Traditional galleries require fewer watchmen, SI AM J. Algebraic Discrete Methods, 4, pp. 194-206, 1983.
8. Lai, M., Scattered data interpolation and approximation by using C1 piecewise cubic polynomials, submitted for publication.
9. Lai, M., and L. Schumaker, Scattered data interpolation using C2 piecewise polynomials of degree six, Third Workshop on Proximity Graphs, Mississippi State University, Starkville, Mississippi, December 1-3, 1994.
10. Lubiw, A., Decomposing polygonal regions into convex quadrilaterals, in Proceedings of the 1st ACM Symposium on Computational Geometry, pp.97-106, 1985.
11. O’Rourke, J., Computational Geometry in C, Cambridge University Press, 1994.
12. Preparata, F., and M. Shamos, Computational Geometry: An Introduction, Springer-Verlag, New York, 1985.
13. Sack, J., and G. Toussaint, A linear-time algorithm for decomposing rectilinear star-shaped polygons into convex quadrilaterals, Proc. 19th Annual Conf. on Communications, Control and Computing, Allerton, pp. 21-30, 1981.
14. Sack, J., and G. Toussaint, Guard placement in rectilinear polygons, in Computational Morphology, G. Toussaint, ed., North-Holland, pp. 153-175, 1988.
15. Toussaint, G., Solving geometric problems with the rotating calipers, Proc. IEEE MELECON 83, Athens, Greece, pp. A10002/1-4, 1983.