A course in spatial visualisation.
A general class of nonlinear univariate subdivision algorithms and their -smoothness.
A Generalized Vertex Truncation Scheme to Construct Intriguing Polyhedral Shapes
A limit theorem for one-parameter alteration of two knots of B-spline curves.
A Linear Algorithm for Construction of Optimal Digital Convex 2k-gons
A linear time algorithm for the computation of some distance functions between convex polygons
A method of changing a color scheme with Kansei scales.
A new algorithm for recognizing the unknot.
A New Technique To Compute Polygonal Schema for 2-Manifolds with Application to Null-Homotopy Detection.
A Non-Recursive Algorithm for Polygon Triangulation
A note on rectilinearity and angular resolution.
A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra.
A Software for the Visualisationof Differential Geometry
About the geometry of milling paths.
Algebraic representation formulas for null curves in Sl(2,ℂ)
We study curves in Sl(2,ℂ) whose tangent vectors have vanishing length with respect to the biinvariant conformal metric induced by the Killing form, so-called null curves. We establish differential invariants of them that resemble infinitesimal arc length, curvature and torsion of ordinary curves in Euclidean 3-space. We discuss various differential-algebraic representation formulas for null curves. One of them, a modification of the Bianchi-Small formula, gives an Sl(2,ℂ)-equivariant bijection...
Algorithms for incremental orthogonal graph drawing in three dimensions.
Almost Optimal Set Covers in Finite VC-Dimension.
Almost Tight Bounds for e-Nets.
Almost Tight Upper Bounds for Lower Envelopes in Higher Dimensions.
An Algorithm for a Simple Construction of Suboptimal Digital Convex Polygons