The following pages link to Michael Kallay (Q750075):
Displaying 19 items.
- (Q236509) (redirect page) (← links)
- Optimal twist vectors as a tool for interpolating a network of curves with a minimum energy surface (Q750076) (← links)
- Finite sets which contain their Radon points (Q799243) (← links)
- The complexity of incremental convex hull algorithms in \(R^ d\) (Q800085) (← links)
- The minimal number of circuits in a finite set in \(R^{2k-1}\) (Q1063236) (← links)
- Method to approximate the space curve of least energy and prescribed length (Q1109504) (← links)
- Approximating a composite cubic curve by one with fewer pieces (Q1109505) (← links)
- Indecomposable polytopes (Q1171284) (← links)
- General \(B\)-spline Hermite interpolation (Q1175518) (← links)
- Computing the unit normal on a degenerate edge (Q1195304) (← links)
- Subdivision algorithms and the kernel of a polyhedron (Q1196202) (← links)
- Monotone linear rational spline interpolation (Q1200991) (← links)
- The extreme bodies in the set of plane convex bodies with a given width function (Q1223631) (← links)
- Object-oriented paradigm for NURBS curve and surface design (Q1347208) (← links)
- Reconstruction of a plane convex body from the curvature of its boundary (Q1845383) (← links)
- Plane curves of minimal energy (Q3026493) (← links)
- Computing Tight Bounds for a Bézier Curve (Q4457688) (← links)
- (Q5186274) (← links)
- A geometric Newton-Raphson strategy (Q5958643) (← links)
