Related papers: On the CAD-compatible conversion of S-patches
The problem of polycube construction or deformation is an essential problem in computer graphics. In this paper, we present a robust, simple, efficient and automatic algorithm to deform the meshes of arbitrary shapes into their polycube…
We present a light and fast, public available, ray-tracer {\tt Splotch} software tool which supports the effective visualization of cosmological simulations data. We describe the algorithm it relies on, which is designed in order to deal…
In the realm of computer-aided design (CAD) software, the intersection of B-spline surfaces stands as a fundamental operation. Despite the extensive history of surface intersection algorithms, the challenge of handling complex intersection…
We introduce Patchwork, a new general-purpose shape representation capable of modeling 2D and 3D geometry with a small number of parameters. Patchwork is grounded in a rigorous mathematical framework, providing provable complexity bounds…
This paper introduces a watertight technique to deal with the boundary representation of surface-surface intersection in CAD. Surfaces play an important role in today's geometric design. The mathematical model of non-uniform rational…
To produce cartographic maps, simplification is typically used to reduce complexity of the map to a legible level. With schematic maps, however, this simplification is pushed far beyond the legibility threshold and is instead constrained by…
Normal multi-scale transform [4] is a nonlinear multi-scale transform for representing geometric objects that has been recently investigated [1, 7, 10]. The restrictive role of the exact order of polynomial reproduction $P_e$ of the…
We construct an explicit bijection between bipartite pointed maps of an arbitrary surface $\mathbb{S}$, and specific unicellular blossoming maps of the same surface. Our bijection gives access to the degrees of all the faces, and distances…
In this paper we describe an algorithm for implicitizing rational hypersurfaces in case there exists at most a finite number of base points. It is based on a technique exposed in math.AG/0210096, where implicit equations are obtained as…
In this paper we address the issue of designing developable surfaces with Bezier patches. We show that developable surfaces with a polynomial edge of regression are the set of developable surfaces which can be constructed with Aumann's…
B\'ezier curves provide the basic building blocks of graphic design in 2D. In this paper, we port B\'ezier curves to manifolds. We support the interactive drawing and editing of B\'ezier splines on manifold meshes with millions of…
We discuss how Dokken's methods of approximate implicitization can be applied to triangular B\'ezier surfaces in both the original and weak forms. The matrices $\mathbf{D}$ and $\mathbf{M}$ that are fundamental to the respective forms of…
Some skew-symmetrizable integer exchange matrices are associated to ideal (tagged) triangulations of marked bordered surfaces. These exchange matrices admits unfoldings to skew-symmetric matrices. We develop an combinatorial algorithm that…
A new algorithm for computing a point on a polynomial or rational curve in B\'{e}zier form is proposed. The method has a geometric interpretation and uses only convex combinations of control points. The new algorithm's computational…
We produce implicit equations for general biquadratic (order 2x2) B\'ezier triangle and quadrilateral surface patches and provide function evaluation code, using modern computing resources to exploit old algebraic construction techniques.
We present a matrix-based algorithm for deciding if the parametrization of a curve or a surface is invertible or not, and for computing the inverse of the parametrization if it exists.
We present an algorithm that covers any given rational ruled surface with two rational parametrizations. In addition, we present an algorithm that transforms any rational surface parametrization into a new rational surface parametrization…
Cylindrical algebraic decomposition (CAD) is a core algorithm within Symbolic Computation, particularly for quantifier elimination over the reals and polynomial systems solving more generally. It is now finding increased application as a…
Parametric boundary representation models (B-Reps) are the de facto standard in CAD, graphics, and robotics, yet converting them into valid meshes remains fragile. The difficulty originates from the unavoidable approximation of high-order…
We give a short survey on computational techniques which can be used to solve the representation conversion problem for polyhedra up to symmetries. We in particular discuss decomposition methods, which reduce the problem to a number of…