Related papers: Straight Skeletons of Three-Dimensional Polyhedra
In this paper, we explore the task of robot sculpting. We propose a search based planning algorithm to solve the problem of sculpting by material removal with a multi-axis manipulator. We generate collision free trajectories for a…
We introduce additively-weighted straight skeletons as a new generalization of straight skeletons. An additively-weighted straight skeleton is the result of a wavefront-propagation process where, unlike in previous variants of straight…
Inferring 3D locations and shapes of multiple objects from a single 2D image is a long-standing objective of computer vision. Most of the existing works either predict one of these 3D properties or focus on solving both for a single object.…
A new algorithm for the determination of the relative convex hull in the plane of a simple polygon A with respect to another simple polygon B which contains A, is proposed. The relative convex hull is also known as geodesic convex hull, and…
It has been a long-standing challenge to find a geometric object underlying the cosmological wavefunction for Tr($\phi^3$) theory, generalizing associahedra and surfacehedra for scattering amplitudes. In this note we describe a new class of…
Contemporary approaches to solving various problems that require analyzing three-dimensional (3D) meshes and point clouds have adopted the use of deep learning algorithms that directly process 3D data such as point coordinates, normal…
We present new examples of topologically convex edge-ununfoldable polyhedra, i.e., polyhedra that are combinatorially equivalent to convex polyhedra, yet cannot be cut along their edges and unfolded into one planar piece without overlap.…
In this work, we show the geometric properties of a family of polyhedra obtained by folding a regular tetrahedron along regular triangular grids. Each polyhedron is identified by a pair of nonnegative integers. The polyhedron can be cut…
We construct a sphere-homeomorphic flexible self-intersection free polyhedron in Euclidean 3-space such that all its dihedral angles change during some flex of this polyhedron. The constructed polyhedron has 26 vertices, 72 edges and 48…
This paper considers Platonic solids/polytopes in the real Euclidean space R^n of dimension 3 <= n < infinity. The Platonic solids/polytopes are described together with their faces of dimensions 0 <= d <= n-1. Dual pairs of Platonic…
In this paper, we study movements of simple polygonal chains in 3D. We say that an open, simple polygonal chain can be straightened if it can be continuously reconfigured to a straight sequence of segments in such a manner that both the…
The visibility graph of a simple polygon represents visibility relations between its vertices. Knowing the correct order of the vertices around the boundary of a polygon and its visibility graph, it is an open problem to locate the vertices…
This paper addresses the computation of normalized solid angle measure of polyhedral cones. This is well understood in dimensions two and three. For higher dimensions, assuming that a positive-definite criterion is met, the measure can be…
In this paper we first describe the geometry of the Newton polyhedra of polynomials invariant under certain linear Hamiltonian circle actions. From the geometry of the polyhedra, various Poisson structures on the orbit spaces of the actions…
This article describes a method to compute successive convex approximations of the convex hull of a set of points in R^n that are the solutions to a system of polynomial equations over the reals. The method relies on sums of squares of…
Geometrical Volume-of-Fluid (VoF) methods mainly support structured meshes, and only a small number of contributions in the scientific literature report results with unstructured meshes and three spatial dimensions. Unstructured meshes are…
We describe a polynomial time algorithm that takes as input a polygon with axis-parallel sides but irrational vertex coordinates, and outputs a set of as few rectangles as possible into which it can be dissected by axis-parallel cuts and…
We study the maximum weight convex polytope problem, in which the goal is to find a convex polytope maximizing the total weight of enclosed points. Prior to this work, the only known result for this problem was an $O(n^3)$ algorithm for the…
The skeleton is an essential shape characteristic providing a compact representation of the studied shape. Its computation on the image grid raises many issues. Due to the effects of discretization, the required properties of the skeleton -…
We construct a sequence of convex polyhedra on n vertices with the property that, as n -> infinity, the fraction of its edge unfoldings that avoid overlap approaches 0, and so the fraction that overlap approaches 1. Nevertheless, each does…