Efficient one-sided linearization of spline geometry

DOI10.1007/B11966MaRDI QIDQ5305913zbMATH OpenOpenAlexFDO

Authors Jörg Peters

Publication date 23 March 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b11966

Mathematics Subject Classification ID

Numerical computation using splines (65D07) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• Sleves for planar spline curves
• Computational geometry in a curved world
• Tight linear envelopes for splines
• Efficient intersection between splines of clothoids
• Decomposition and intersection of simple splinegons

Cited in

(4)

• Polynomials root-finding using a SLEFE-based clipping method
• scientific article; zbMATH DE number 16803 (Why is no real title available?)
• A simple and efficient approximation of a Bézier piece by its cutdown polygon
• Consolidated sharp bounds for Bézier curve approximation with cutdown polygon and corner cutting polygon

This page was built for publication: Efficient one-sided linearization of spline geometry

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5305913)