Show simple item record

dc.contributor.authorRuf, Eriken_US
dc.contributor.editorCarsten Dachsbacher and William Mark and Jacopo Pantaleonien_US
dc.date.accessioned2016-02-18T11:01:49Z
dc.date.available2016-02-18T11:01:49Z
dc.date.issued2011en_US
dc.identifier.isbn978-1-4503-0896-0en_US
dc.identifier.issn2079-8687en_US
dc.identifier.urihttp://dx.doi.org/10.1145/2018323.2018346en_US
dc.description.abstractWe describe a simple mechanism for bounding the portion of the plane lying between a quadratic Beizer curve segment and its offset curve at distance d. Instead of comprising one or more partial bounding polygons, our representation consists of only a single approximate offset curve segment, also in quadratic Bezier form. Evaluated on a corpus of real-world curves, this technique avoids 68-99% of antialias-distance queries and 41-96% of brushparameter queries. A proof of correctness is provided.en_US
dc.publisherACMen_US
dc.subjectI.3.5 [Computer Graphics]en_US
dc.subjectComputational Geometryand Object Modeling Boundary representationsen_US
dc.subjectoffset curveen_US
dc.subjectbounding techniqueen_US
dc.subjectaccelerationen_US
dc.titleAn Inexpensive Bounding Representation for Offsets of Quadratic Curvesen_US
dc.description.seriesinformationEurographics/ ACM SIGGRAPH Symposium on High Performance Graphicsen_US
dc.description.sectionheadersGeometric Computationsen_US
dc.identifier.doi10.1145/2018323.2018346en_US
dc.identifier.pages143-150en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record