Related papers: Generating Cycloidal Gears for 3D Printing
We propose a novel method to generate a small set of ruled surfaces that do not collide with the input shape for linear hot-wire rough machining. Central to our technique is a new observation: the ruled surfaces constructed by vertical…
Ruled surface is widely used in engineering design such as parting surface design of injection mold and checking surface design of checking fixture, which are usually generated by offsetting 3D curves. However, in 3D curve offset, there…
Given a set of $n$ points on a plane, in the Minimum Weight Triangulation problem, we wish to find a triangulation that minimizes the sum of Euclidean length of its edges. This incredibly challenging problem has been studied for more than…
Geometric rounding of a mesh is the task of approximating its vertex coordinates by floating point numbers while preserving mesh structure. Geometric rounding allows algorithms of computational geometry to interface with numerical…
The creation of a volumetric mesh representing the interior of an input polygonal mesh is a common requirement in graphics and computational mechanics applications. Most mesh creation techniques assume that the input surface is not…
We propose a new two-dimensional meshing algorithm called PINW able to generate meshes that accurately approximate the distance between any two domain points by paths composed only of cell edges. This technique is based on an extension of…
Discrete orthogonal matrices have several applications in information technology, such as in coding and cryptography. It is often challenging to generate discrete orthogonal matrices. A common approach widely in use is to discretize…
In this article, we provide a detailed survey of techniques for hexahedral mesh generation. We cover the whole spectrum of alternative approaches to mesh generation, as well as post processing algorithms for connectivity editing and mesh…
We have derived long series expansions for the perimeter generating functions of the radius of gyration of various polygons with a convexity constraint. Using the series we numerically find simple (algebraic) exact solutions for the…
Folding is emerging as a promising manufacturing process to transform flat materials into functional structures, offering efficiency by reducing the need for welding, gluing, and molding, while minimizing waste and enabling automation.…
Orthogonal graph drawings are used in applications such as UML diagrams, VLSI layout, cable plans, and metro maps. We focus on drawing planar graphs and assume that we are given an \emph{orthogonal representation} that describes the desired…
We consider the problem of cutting a set of edges on a polyhedral manifold surface, possibly with boundary, to obtain a single topological disk, minimizing either the total number of cut edges or their total length. We show that this…
The EditLens is an interactive lens technique that supports the editing of graphs. The user can insert, update, or delete nodes and edges while maintaining an already existing layout of the graph. For the nodes and edges that are affected…
Usual mathematical method for creating trochoids is based on a solid rule that requires a pure rolling motion of a circle along another one. In this vision a trochoid defined as a traced path by an attached point (a non-conceptive issue) to…
We define a simple orthogonal polyhedron to be a three-dimensional polyhedron with the topology of a sphere in which three mutually-perpendicular edges meet at each vertex. By analogy to Steinitz's theorem characterizing the graphs of…
This paper presents a GPU parallel algorithm to generate a new kind of polygonal meshes obtained from Delaunay triangulations. To generate the polygonal mesh, the algorithm first uses a classification system to label each edge of an input…
Computational mathematics plays an increasingly important role in computational fluid dynamics (CFD). The aeronautics and aerospace re- search community is working on next generation of CFD capacity that is accurate, automatic, and fast. A…
We present a new method for performing Boolean operations on volumes represented as triangle meshes. In contrast to existing methods which treat meshes as 3D polyhedra and try to partition the faces at their exact intersection curves, we…
This paper presents a novel algorithmic framework for the computational design, simulation, and fabrication of a hexagonal grid-based double-curvature structure with planar hexagonal panels. The journey begins with constructing a robust…
Orthogonal drawings, i.e., embeddings of graphs into grids, are a classic topic in Graph Drawing. Often the goal is to find a drawing that minimizes the number of bends on the edges. A key ingredient for bend minimization algorithms is the…