Interrogation of Offsets of Polynomial Surface Patches

Simple item page
dc.contributor.authorVafiadou, Maria - Elenien_US
dc.contributor.authorPatrikalakis, Nicholas M.en_US
dc.date.accessioned2015-10-05T07:56:48Z
dc.date.available2015-10-05T07:56:48Z
dc.date.issued1991en_US
dc.description.abstractThis paper presents an algorithm for computing the intersection of the offset (or parallel) surface of a polynomial surface patch ( rogenitor) of arbitrary degree, with a straight line. The rogenitor patch is expressed in the tensor product Bernstein form. The intersection problem is reformulated in terms of computing the intersection of two algebraic curves within the parameter s ace of the patch. The tensor product Bernstein form is emplo ed for the representation of these algebraic curves. The solution method is based on subdivision relying on the convex hull roperty of the Bernstein representation of algebraic curves and minimization techniques. The resulting algorithm can form the basis for accurate visualization of offset surfaces through ray tracing methods.en_US
dc.description.seriesinformationEG 1991-Technical Papersen_US
dc.identifier.doi10.2312/egtp.19911018en_US
dc.identifier.issn1017-4656en_US
dc.identifier.urihttps://doi.org/10.2312/egtp.19911018en_US
dc.publisherEurographics Associationen_US
dc.titleInterrogation of Offsets of Polynomial Surface Patchesen_US
Files
Collections
EG1991 Proceedings (Technical Papers)
EG1991 Proceedings (Technical Papers)