Characterizing and efficiently computing quadrangulations of planar point sets

Computer Aided Geometric Design

Volumn 14, Issue 8, 1997, Pages 763-785

  Bose, Prosenjit ^a   Toussaint, Godfried ^b  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^b MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER AIDED DESIGN; PROBLEM SOLVING;

CONVEX QUADRILATERALS; PLANAR POINT SETS; QUADRANGULATIONS; SPIRALING ROTATING CALIPERS (SRC) ALGORITHMS;

COMPUTATIONAL GEOMETRY;

EID: 0031245851     PISSN: 01678396     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8396(97)00013-7     Document Type: Article

References (44)

1. Arkin, E., Held, M., Mitchell, J. and Skiena, S. (1994), Hamiltonian triangulations for fast rendering, in: van Leeuwen, J., ed., Algorithms-ESA '94, Utrecht, NL, LNCS 855, 36-47.
2. Asano, T., Asano, T. and Imai, H. (1986), Partitioning a polygonal region into trapezoids, Journal of the ACM 33, 290-312.
3. Barequet, G. and Sharir, M. (1994), Piecewise-linear interpolation between polygonial slices, in: Proceedings of the 10th Annual Symposium on Computational Geometry, 93-102.
4. Baumgarten, H., Jung, H. and Mehlhorm, K. (1994), Dynamic point location in general subdivisions, Journal of Algorithms 17, 342-380.
5. Bondy, J. and Murty, U.S.R. (1976), Graph Theory with Applications, Elsevier Science, New York.
6. Chazelle, B. (1985), On the convex layers of a planar set, IEEE Transactions on Information Theory IT-31, 509-517.
7. Cheng, S. and Janardan, R. (1992), New results on dynamic planar point location, SIAM Journal on Computing 21, 972-999.
8. 3 log n) time, in: Proceedings of the 28th Allerton Conference on Comm. Control and Computing, 788-797.
9. deBerg, M. (1992), appears as "personal communication, 1992" in (Everett et al., 1992).
10. Everett, H., Lenhart, W., Overmars, M., Shermer, T. and Urrutia, J. (1992), Strictly convex quadrilateralizations of polygons, in: Proceedings of the 4th Canadian Conference on Computational Geometry, 77-83.
11. Fary, I. (1948), On straight lines representation of planar graphs, Acta Sci. Math. Szeged 11, 229-233.
12. Franke, R. (1982), Scattered data interpolation: Tests of some methods, Math. Comp. 38, 181-200.
13. Franke, R., Hagen, H. and Nielson, G. (1994), Least squares surface approximation to scattered data using multiquadric functions, Advances in Computational Mathematics 2, 81-99.
14. Fournier, A. and Montuno, D.Y. (1984), Triangulating simple polygons and equivalent problems, ACM Transactions on Graphics 3, 153-174.
15. Heighway, E. (1983), A mesh generator for automatically subdividing irregular polygons into quadrilaterals, IEEE Trans. Magn. 19, 2535-2538.
16. Hershberger, J. and Suri, S. (1990), Applications of a semi-dynamic convex hull algorithm, in: Proceedings of the Second S.W.A.T., Lecture Notes in Computer Science 447, Bergen, Sweden, 380-392.
17. Ho-Le, K. (1988), Finite element mesh generation methods: A review and classification, Computer-Aided Design 20, 27-38.
18. Johnston, B., Sullivan, J. and Kwasnik, A. (1991), Automatic conversion of triangular finite element meshes to quadrilateral elements, International Journal for Numerical Methods in Engineering 31, 67-84.
19. Kahn, J., Klawe, M. and Kleitman, D. (1983), Traditional galleries require fewer watchmen, SIAM J. Algebraic Discrete Methods 4, 194-206.
20. Keil, J.M. and Sack, J.R. (1985), Minimum decompositions of polygonal objects, in: Toussaint, G.T., ed., Computational Geometry, North-Holland, Amsterdam, 197-216.
21. 1 piecewise cubic polynomials.
22. 2 piecewise polynomials of degree six, in: Third Workshop on Proximity Graphs, Mississippi State University, Starkville, Mississippi.
23. Lipski, W., Lodr, E., Luccio, F., Mugnal, C. and Pagli, L. (1979), On two dimensional data organization II, Fundamenta Informaticae 2, 245-260.
24. Lubiw, A. (1985), Decomposing polygonal regions into convex quadrilaterals, in: Proceedings of the 1st ACM Symposium on Computational Geometry, 97-106.
25. Nielson, G. (1993), Scattered data modelling, IEEE Computer Graphics and Applications 13, 60-70.
26. Ohtsuki, T. (1982), Minimum dissection of rectilinear regions, in: Proc. IEEE International Symposium on Circuits and Systems, Rome, 1210-1213.
27. Okabe, A., Boots, B. and Sugihara, K. (1992), Spatial Tessellations: Concepts and Applications of Voronoi Diagrams, Wiley, Chichester, England.
28. O'Rourke, J. (1994). Computational Geometry in C, Cambridge University Press.
29. Paul, W. and Simon, J. (1980), Decision Trees and Random Access Machines, Logic and Algorithmics, Monograph 30, L'Enseignement Mathematique.
30. Preparata, F. and Shamos, M. (1985), Computational Geometry: An Introduction, Springer, New York.
31. Preparata, F. and Tamassia, R. (1989), Fully dynamic point location in a monotone subdivision, SIAM Journal on Computing 18, 811-830.
32. Sack, J. and Toussaint, G. (1981), A linear-time algorithm for decomposing rectilinear star-shaped polygons into convex quadrilaterals, in: Proc. 19th Annual Conf. on Communications, Control and Computing, Allerton, 21-30.
33. Sack, J. and Toussaint, G. (1988), Guard placement in rectilinear polygons, in: Toussaint, G., ed., Computational Morphology, North-Holland, 153-175.
34. Schroeder, W. and Shephard, M. (1988), Geometry-based fully automatic mesh generation and the Delaunay triangulation, International Journal for Numerical Methods in Engineering 24, 2503-2515.
35. Schumaker, L. (1993), Computing optimal triangulations using simulated annealing, Computer Aided Geometric Design 10, 329-345.
36. Stein, S. (1951), Convex maps, Proc. Amer. Math. Soc. 2, 464-466.
37. Sugiyama, N. and Saitoh, K. (1979), Electron-beam exposure system AMDES, Computer-Aided Design 11, 59-65.
38. Toussaint, G. (1983), Solving geometric problems with the rotating calipers, in: Proc. IEEE MELECON 83, Athens, Greece, A10002/1-4.
39. Toussaint, G. (1986), New results in computational geometry relevant to pattern recognition in practice, in: Gelsema, E.S. and Kanal, L.N., eds., Pattern Recognition in Practice II, North-Holland, 135-146.
40. Wagner, K. (1936), Bemerkungen zum Vierfarbenproblem, Jber. Deutsch. Math.-Verein 46, 26-32.
41. 2-quintic spline interpolation scheme on triangulation, Computer Aided Geometric Design 9, 379-386.
42. Wang, Y. and Aggarwal, J. (1986), Surface reconstruction and representation of 3-d scenes, Pattern Recognition 19, 197-207.
43. Wismath, S. (1980), Triangulations: An algorithmic study, Technical Report 80-106, Queens University, Kingston, Canada.
44. Yoeli, P. (1975), Compilation of data for computer-assisted relief cartography, in: Davis, J. and McCullagh, M., eds., Display and Analysis of Spatial Data, Wiley, New York.