GENERALIZATION OF CONTOUR TRACKING IN IMAGE SYNTHESIS, AND APPLICATION

Simple item page
dc.contributor.authorHegron, Gerarden_US
dc.contributor.editorC.E. Vandonien_US
dc.date.accessioned2015-09-29T08:29:33Z
dc.date.available2015-09-29T08:29:33Z
dc.date.issued1985en_US
dc.description.abstractIn this report, we propose to present most of the treatments about convex and nonconvex colored shapes from a data structure of their contour which is the general approach of contour tracking . Contour filling and oblique cross-hatching take advantage of the coherence between adjacent scan lines and adjacent hatching lines. The position of a point with respect to a nonconvex polygon is solved from filling logic, and the clipping of a line segment by a nonconvex polygon uses the slant cross-hatching idea. We present the clipping of the two nonconvex polygon set. From the area filling of non polygonal blobs, contour tracking is generalized to three geometric problems : position of a point, clipping of a line segment and of a circular arc by a non-polygonal contour, Finally, we discuss the general advantages of contour tracking and application in the writing of a text in a nonconvex polygon.en_US
dc.description.seriesinformationEurographics Conference Proceedingsen_US
dc.identifier.doi10.2312/eg.19851022en_US
dc.identifier.issn1017-4656en_US
dc.identifier.urihttps://doi.org/10.2312/eg.19851022en_US
dc.publisherThe Eurographics Associationen_US
dc.titleGENERALIZATION OF CONTOUR TRACKING IN IMAGE SYNTHESIS, AND APPLICATIONen_US
Files
Collections
EG1985 Proceedings (Technical Papers)