Related papers: Algebraic 3D Graphic Statics: Constrained Areas
We present Deformable Voxel Grids (DVGs) for 3D shapes comparison and processing. It consists of a voxel grid which is deformed to approximate the silhouette of a shape, via energy-minimization. By interpreting the DVG as a local…
We present a computational framework for solving the equations of inviscid gas dynamics using structured grids with embedded geometries. The novelty of the proposed approach is the use of high-order discontinuous Galerkin (dG) schemes and a…
We investigate dimensional constraints arising from representation theory when abstract graph edges possess internal degrees of freedom but lack geometric properties. We prove that such internal degrees of freedom can only encode…
In this paper, we perform a detailed investigation on the various geometrical properties of trapped surfaces and the boundaries of trapped region in general relativity. This treatment extends earlier work on LRS II spacetimes to a general 4…
Meshing complex engineering domains is a challenging task. Arbitrary polyhedral meshes can provide the much needed flexibility in automated discretization of such domains. The geometric property of the polyhedral meshes such as the…
The Art Gallery Problem (AGP) asks for placing a minimum number of stationary guards in a polygonal region P, such that all points in P are guarded. The problem is known to be NP-hard, and its inherent continuous structure (with both the…
Inverse design aims to design the input variables of a physical system to optimize a specified objective function, typically formulated as a search or optimization problem. However, in 3D domains, the design space grows exponentially,…
A face image contains geometric cues in the form of configurational information and contours that can be used to estimate 3D face shape. While it is clear that 3D reconstruction from 2D points is highly ambiguous if no further constraints…
We study geometric consistency relations between angles of 3-dimensional (3D) circular quadrilateral lattices -- lattices whose faces are planar quadrilaterals inscribable into a circle. We show that these relations generate canonical…
We introduce a force-directed algorithm, called Sync-and-Burst, which falls into the category of classical force-directed graph drawing algorithms. A distinct feature in Sync-and-Burst is the use of simplified forces of attraction and…
When a pair of non-incident edges of a tetrahedron is chosen, the midpoints of the remaining 4 edges are the vertices of a planar parallelogram. A formula is given in terms of the six edge lengths for the area of this parallelogram. It is…
Graph matching is an important and persistent problem in computer vision and pattern recognition for finding node-to-node correspondence between graph-structured data. However, as widely used, graph matching that incorporates pairwise…
3D Gaussian Splatting (3DGS) has emerged as a powerful approach for 3D scene reconstruction using 3D Gaussians. However, neither the centers nor surfaces of the Gaussians are accurately aligned to the object surface, complicating their…
This work considers the distance constrained formation control problem with an additional constraint requiring that the formation exhibits a specified spatial symmetry. We employ recent results from the theory of symmetry-forced rigidity to…
A comprehensive framework for detection and characterization of overlapping intrinsic symmetry over 3D shapes is proposed. To identify prominent symmetric regions which overlap in space and vary in form, the proposed framework is decoupled…
We consider self-avoiding lattice polygons, in the hypercubic lattice, as a model of a ring polymer adsorbed at a surface and either being desorbed by the action of a force, or pushed towards the surface. We show that, when there is no…
This paper studies the integrated position and attitude control problem for multi-agent systems of 3D rigid bodies. While the state-of-the-art method in [Olfati-Saber and Murray, 2004] established the theoretical foundation for rigid-body…
Real-world robotic grasping can be done robustly if a complete 3D Point Cloud Data (PCD) of an object is available. However, in practice, PCDs are often incomplete when objects are viewed from few and sparse viewpoints before the grasping…
We study the Art Gallery Problem for face guards in polyhedral environments. The problem can be informally stated as: how many (not necessarily convex) windows should we place on the external walls of a dark building, in order to completely…
Deciding realizability of a given polyhedral map on a (compact, connected) surface belongs to the hard problems in discrete geometry, from the theoretical, the algorithmic, and the practical point of view. In this paper, we present a…