Abstract

The amount of time used by a pen plotter in drawing a set of line segments depends on the order and directions in which the segments are drawn, and can generally be reduced by reordering and redirecting the segments. This paper presents practical techniques of reducing plotting time. A method is proposed in which a buffer of segments is maintained, and the criterion used in choosing a segment from the buffer to draw is that of closeness to the current pen position. By storing the segment endpoints in a quadtree data structure, it is possible to find the closest endpoint in an amount of time which is essentially independent of the buffer size. The author gives algorithms for inserting, deleting, and finding closest point in the quadtree. The performance of the plotting time reduction program in a sample of real-world applications is given. Test cases from data plotting, computer-aided design and VLSI design are used. 8 references.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.