Boolean operations of 2-manifolds through vertex neighborhood classification
ACM Transactions on Graphics (TOG)
What every computer scientist should know about floating-point arithmetic
ACM Computing Surveys (CSUR)
A generic solution to polygon clipping
Communications of the ACM
Intersection detection and separators for simple polygons
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
An optimal algorithm for intersecting line segments in the plane
Journal of the ACM (JACM)
An optimal algorithm for finding segments intersections
Proceedings of the eleventh annual symposium on Computational geometry
Computing half-plane and strip discrepancy of planar point sets
Computational Geometry: Theory and Applications
Efficient clipping of arbitrary polygons
ACM Transactions on Graphics (TOG)
The history of computer graphics standards development
ACM SIGGRAPH Computer Graphics
On degeneracy in geometric computations
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
On local heuristics to speed up polygon-polygon intersection tests
Proceedings of the 7th ACM international symposium on Advances in geographic information systems
Robust Plane Sweep for Intersecting Segments
SIAM Journal on Computing
A Simple but Realistic Model of Floating-Point Computation
ACM Transactions on Mathematical Software (TOMS)
An analysis and algorithm for polygon clipping
Communications of the ACM
Communications of the ACM
Hidden surface removal using polygon area sorting
SIGGRAPH '77 Proceedings of the 4th annual conference on Computer graphics and interactive techniques
A Metafile for efficient sequential and random display of graphics
SIGGRAPH '82 Proceedings of the 9th annual conference on Computer graphics and interactive techniques
Algorithms for Reporting and Counting Geometric Intersections
IEEE Transactions on Computers
Half-tone perspective drawings by computer
AFIPS '67 (Fall) Proceedings of the November 14-16, 1967, fall joint computer conference
| Hi-index | 0.00 |
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.