Abstract
The objective of metafile compositing is to retrieve multi-layered Windows Metafile command records from a picture file and translate them into a set of closed contours in a single layer that delineates a set of contiguous non-overlapping regions. Such processing is useful for a variety of engineering applications including vector graphic compression and optimization which is discussed here. Primary concerns here are the multitude of degeneracies that exist when implementing a geometric algorithm of this nature. These issues are left largely unaddressed in previous literature but can be of substantial importance when attempting to develop a robust implementation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Song, M.: Robust Graphics Metafile Compositing: A Variation of the Map Overlay Problem Within Computational Geometry. Master’s thesis, Binghamton University (2003)
Reed, T.: A Metafile for Efficient Sequential And Random Display of Graphics. In: Proceedings of the 9th annual conference on Computer graphics and interactive techniques, vol. 16, pp. 39–43. ACM, New York (1982)
Carson, S., Dam, A.V., Puk, D., Henderson, L.R.: The history of Computer Graphics Standards Development. In: SIGGRAPH Computer Graphics, vol. 32, pp. 34–38. ACM, New York (1998)
Goldman, D., Song, M., Eckert, R.R.: Metafile Compositing for Automated Embroidery Design Generation. In: International Conference on Graphics, Vision and Image Processing (GVIP 2005), Cairo, Egypt (December 2005)
Bentley, J.L., Ottamann, T.A.: Algorithms for reporting and counting geometric intersections. IEEE Trans. Comput. C-28, 643–647 (1979)
Boissonnat, J., Preparata, F.P.: Robust Plane Sweep for Intersecting Segments. SIAM Journal on Computing 29(5), 1401–1421 (2000)
Wylie, C., Romney, G.W., Evans, D.C., Erdahl, A.C.: Halftone Perspective Drawings by Computer. In: Proceedings of the Fall Joint Computer Conference, pp. 49–58. Thomson Books (1967)
Courant, R., Robbins, H.: What is Mathematics? Oxford University Press, Oxford (1941)
Balaban, I.J.: An optimal algorithm for finding segments intersections. In: Proceedings of the 11th Annual ACM Symposium on Computational Geometry, Vancouver, Canada, pp. 211–219 (1995)
Mantyla, M.: Boolean Operations of 2-Manifolds through Vertex Neighborhood classification. ACM Transactions on Graphics 5(1), 1–29 (1986)
Sutherland, E.E., Hodgeman, G.W.: Reentrant polygon clipping, Commun. ACM 17, 32–42 (1974)
Liang, Y., Barskey, B.A.: An analysis and algorithm for polygon clipping, Commun. ACM 11 (1983), pp. 868-977
Weiler, K., Atherton, P.: Hidden Surface Removal Using Polygon Area Sorting. In: ACM SIGGRAPH, pp. 214–222 (1977)
Greiner, G., Hormann, K.: Efficient Clipping of Arbitrary Polygons. In: Trans. On Graphics, vol. 17, pp. 71–83. ACM, New York (1998)
Vatti, B.R.: A generic solution to polygon clipping. Commun. ACM 35, 56–63 (1992)
Frank, A.U.: Overlay processing in spatial information systems. AutoCarto 8, 12–31 (1987)
Badawy, W.M., Aref, W.G.: On Local Heuristics to Speed Up Polygon-Polygon Intersection Tests. In: ACM GIS, Kansas City, MO USA, vol. 11 (1999)
Brown, W.S.: A simple but realistic model of floating-point computation. In: ACM Trans. Math. Softw., pp. 445–480 (1981)
Burnikel, C., Mehlhorn, K., Schirra, S.: On degeneracy in geometric computations. In: Proceedings of the 5th ACM-SIAM Symposium on Discrete Algorithms, Arlington, VA, pp. 16–23 (1994)
Chazelle, B., Edelsbrunner, H.: An optimal algorithm for intersecting line segments in the plane. Journal of ACM 39, 1–54 (1992)
DeBerg, M.: Computing half-plane and strip discrepancy of planar point sets. Comput. Geom. Theory Appl. 6, 69–83 (1996)
Goldberg, D.: What Every computer Scientist Should Know About Floating-Point Arithmetic. ACM Computer Surveys 23(1), 5–48 (1991)
Mount, D.M.: Intersection Detection and Separators for Simple Polygons. In: Proc. of the Eighth Annual ACM Symp. on Computational Geometry, pp. 303–311 (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Song, M., Eckert, R.R., Goldman, D.A. (2006). Algorithms for Vector Graphic Optimization and Compression. In: Nishita, T., Peng, Q., Seidel, HP. (eds) Advances in Computer Graphics. CGI 2006. Lecture Notes in Computer Science, vol 4035. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11784203_64
Download citation
DOI: https://doi.org/10.1007/11784203_64
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35638-7
Online ISBN: 978-3-540-35639-4
eBook Packages: Computer ScienceComputer Science (R0)