Ruled Laguerre minimal surfaces

A Laguerre minimal surface is an immersed surface in the Euclidean space being an extremal of the functional \int (H^2/K - 1) dA. In the present paper, we prove that the only ruled Laguerre minimal surfaces are up to isometry the surfaces R(u,v) = (Au, Bu, Cu + D cos 2u) + v (sin u, cos u, 0), where A, B, C, D are fixed real numbers. To achieve invariance under Laguerre transformations, we also derive all Laguerre minimal surfaces that are enveloped by a family of cones. The methodology is based on the isotropic model of Laguerre geometry. In this model a Laguerre minimal surface enveloped by a family of cones corresponds to a graph of a biharmonic function carrying a family of isotropic circles. We classify such functions by showing that the top view of the family of circles is a pencil.Comment: 28 pages, 9 figures. Minor correction: missed assumption (*) added to Propositions 1-2 and Theorem 2, missed case (nested circles having nonempty envelope) added in the proof of Pencil Theorem 4, missed proof that the arcs cut off by the envelope are disjoint added in the proof of Lemma

Darboux cyclides and webs from circles

Motivated by potential applications in architecture, we study Darboux cyclides. These algebraic surfaces of order a most 4 are a superset of Dupin cyclides and quadrics, and they carry up to six real families of circles. Revisiting the classical approach to these surfaces based on the spherical model of 3D Moebius geometry, we provide computational tools for the identification of circle families on a given cyclide and for the direct design of those. In particular, we show that certain triples of circle families may be arranged as so-called hexagonal webs, and we provide a complete classification of all possible hexagonal webs of circles on Darboux cyclides.Comment: 34 pages, 20 figure

Stability of Curvature Measures

We address the problem of curvature estimation from sampled compact sets. The main contribution is a stability result: we show that the gaussian, mean or anisotropic curvature measures of the offset of a compact set K with positive $\mu$-reach can be estimated by the same curvature measures of the offset of a compact set K' close to K in the Hausdorff sense. We show how these curvature measures can be computed for finite unions of balls. The curvature measures of the offset of a compact set with positive $\mu$-reach can thus be approximated by the curvature measures of the offset of a point-cloud sample. These results can also be interpreted as a framework for an effective and robust notion of curvature

Geometric computing for freeform architecture

Geometric computing has recently found a new field of applications, namely the various geometric problems which lie at the heart of rationalization and construction-aware design processes of freeform architecture. We report on our work in this area, dealing with meshes with planar faces and meshes which allow multilayer constructions (which is related to discrete surfaces and their curvatures), triangles meshes with circle-packing properties (which is related to conformal uniformization), and with the paneling problem. We emphasize the combination of numerical optimization and geometric knowledge.

anamorphic projection analogical digital algorithms

The study presents the first results of a wider research project dealing with the theme of "anamorphosis", a specific technique of geometric projection of a shape on a surface. Here we investigate how new digital techniques make it possible to simplify the anamorphic applications even in cases of projections on complex surfaces. After a short excursus of the most famous historical and contemporary applications, we propose several possible approaches for managing the geometry of anamorphic curves both in the field of descriptive geometry (by using interactive tools such as Cabri and GeoGebra) and during the complex surfaces realization process, from concept design to manufacture, through CNC systems (by adopting generative procedural algorithms elaborated in Grasshopper)

Automatic fitting of conical envelopes to free-form surfaces for flank CNC machining

We propose a new algorithm to detect patches of free-form surfaces that can be well approximated by envelopes of a rotational cone under a rigid body motion. These conical envelopes are a preferable choice from the manufacturing point of view as they are, by-definition, manufacturable by computer numerically controlled (CNC) machining using the efficient flank (peripheral) method with standard conical tools. Our geometric approach exploits multi-valued vector fields that consist of vectors in which the point-surface distance changes linearly. Integrating such vector fields gives rise to a family of integral curves, and, among them, linear segments that further serve as conical axes are quickly extracted. The lines that additionally admit tangential motion of the associated cone along the reference geometry form a set of candidate lines that are sequentially clustered and ordered to initialize motions of a rigid truncated cone. We validate our method by applying it on synthetic examples with exact envelopes, recovering correctly the exact solutions, and by testing it on several benchmark industrial datasets, detecting manufacturable conical envelope patches within fine tolerances