Industrial Geometry aims at unifying existing and developing new methods and algorithms for a variety of application areas with a strong geometric component. These include CAD, CA...
Helmut Pottmann, Stefan Leopoldseder, Michael Hofe...
In this paper we tackle the problem of tetrahedralization by breaking non-convex polyhedra into convex subpolyhedra, tetrahedralizing these convex subpolyhedra and merging them to...
Unstructured mesh adaptation has already revealed very efficient for computing an accurate solution in a reasonnable amount of time on current PC architectures. Two features are s...
We prove that the union complexity of a set of n constantcomplexity locally fat objects (which can be curved and/or non-convex) in the plane is O(λt+2(n) log n), where t is the m...
Visual forms come in countless varieties, from the simplicity of a sphere, to the geometric complexity of a face, to the fractal complexity of a rugged coast. These varieties have ...