A course in spatial visualisation.
Page 1 Next
Displaying 1 – 20 of 211
A general class of nonlinear univariate subdivision algorithms and their -smoothness.
Nava-Yazdani, Esfandiar (2008)
Acta Universitatis Apulensis. Mathematics - Informatics
A Generalized Vertex Truncation Scheme to Construct Intriguing Polyhedral Shapes
Ergun Akleman, Paul Edmundson, Ozan Ozener (2005)
Visual Mathematics
A limit theorem for one-parameter alteration of two knots of B-spline curves.
Hoffmann, Miklós, Juhász, Imre (2005)
Annales Mathematicae et Informaticae
A Linear Algorithm for Construction of Optimal Digital Convex 2k-gons
Dragan M. Acketa, Snežana Matić - Kekić, Joviša D. Žunić (1993)
The Yugoslav Journal of Operations Research
A linear time algorithm for the computation of some distance functions between convex polygons
M. J. Atallah, C. C. Ribeiro, S. Lifschitz (1991)
RAIRO - Operations Research - Recherche Opérationnelle
A method of changing a color scheme with Kansei scales.
Yamazaki, Hideki, Kondo, Kunio (1999)
Journal for Geometry and Graphics
A new algorithm for recognizing the unknot.
Birman, Joan S., Hirsch, Michael D. (1998)
Geometry & Topology
A New Technique To Compute Polygonal Schema for 2-Manifolds with Application to Null-Homotopy Detection.
T.K. Dey, H. Schipper (1995)
Discrete & computational geometry
A Non-Recursive Algorithm for Polygon Triangulation
Predrag S. Stanimirović, Predrag V. Krtolica, Rade Stanojević (2003)
The Yugoslav Journal of Operations Research
A note on rectilinearity and angular resolution.
Bodlaender, Hans L., Tel, Gerard (2004)
Journal of Graph Algorithms and Applications
A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra.
S. Suri, C. Monma (1992)
Discrete & computational geometry
A Software for the Visualisationof Differential Geometry
Eberhard Malkowsky Vesna Veličković (2002)
Visual Mathematics
About the geometry of milling paths.
Szilvási-Nagy, Márta, Béla, Szilvia, Mátyási, Gyula (2008)
Annales Mathematicae et Informaticae
Algebraic representation formulas for null curves in Sl(2,ℂ)
Hubert Gollek (2005)
Banach Center Publications
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.
Papakostas, Achilleas, Tollis, Ioannis G. (1999)
Journal of Graph Algorithms and Applications
Almost Optimal Set Covers in Finite VC-Dimension.
M.T. Goodrich, H. Brönnimann (1995)
Discrete & computational geometry
Almost Tight Bounds for e-Nets.
G. Woeginger, J. Komlós, J Pach (1992)
Discrete & computational geometry
Almost Tight Upper Bounds for Lower Envelopes in Higher Dimensions.
M. Sharir (1994)
Discrete & computational geometry
An Algorithm for a Simple Construction of Suboptimal Digital Convex Polygons
Dragan M. Acketa, Snežana Matić-Kekić (1992)
The Yugoslav Journal of Operations Research
Currently displaying 1 – 20 of 211
Page 1 Next