Polyhedra of Minimal Area as 3D Object Models
نویسنده
چکیده
Polyhedra of minimal surface area are suggested as natural candidates for object models. The problem of computing such a polyhedron from a set of 3D points that are its vertices is explored. An approximate algorithm is suggested, and results of a preliminary implementation are discussed.
منابع مشابه
3D Models Recognition in Fourier Domain Using Compression of the Spherical Mesh up to the Models Surface
Representing 3D models in diverse fields have automatically paved the way of storing, indexing, classifying, and retrieving 3D objects. Classification and retrieval of 3D models demand that the 3D models represent in a way to capture the local and global shape specifications of the object. This requires establishing a 3D descriptor or signature that summarizes the pivotal shape properties of th...
متن کاملModelling Decision Problems Via Birkhoff Polyhedra
A compact formulation of the set of tours neither in a graph nor its complement is presented and illustrates a general methodology proposed for constructing polyhedral models of decision problems based upon permutations, projection and lifting techniques. Directed Hamilton tours on n vertex graphs are interpreted as (n-1)- permutations. Sets of extrema of Birkhoff polyhedra are mapped to tours ...
متن کاملSynthesis of Solid Models of Polyhedra from their Orthogonal Views using Logical Representations
In this paper a representational language of a logical kind which is expressive enough to model concepts of descriptive geometry is presented. The language is employed to produce solid models of polyhedra from representations of their orthogonal projections. The synthetic process has as its input well-formed expressions representing the geometrical entities and relations of bidimensional orthog...
متن کاملFolding Arbitrary 3D Shapes with Space-Filling Chain Robots: Folded Configuration Design as 3D Hamiltonian Path through Target Solid
We propose a method for arbitrary 3D shape formation by folding chains of hinged polyhedra. This paper presents an incremental algorithm for finding a space filling curve, a Hamiltonian path, within a 3D solid. The algorithm is a bottom up approach that starts with minimal local paths connecting small clusters of neighboring constituent polyhedra and incrementally merges neighboring paths along...
متن کاملContact Representations of Graphs in 3D
We study contact representations of non-planar graphs in which vertices are represented by axis-aligned polyhedra in 3D and edges are realized by non-zero area common boundaries between corresponding polyhedra. We present a liner-time algorithm constructing a representation of a 3-connected planar graph, its dual, and the vertex-face incidence graph with 3D boxes. We then investigate contact re...
متن کامل