Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Convex hulls of finite sets of points in two and three dimensions
Communications of the ACM
From Images to Surfaces: A Computational Study of the Human Early Visual System
From Images to Surfaces: A Computational Study of the Human Early Visual System
Determining object attitude from extended Gaussian images
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2
An optimal O(n log n) algorithm for contour reconstruction from rays
SCG '87 Proceedings of the third annual symposium on Computational geometry
Minkowski-type theorems and least-squares partitioning
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
A polynomial time algorithm for Minkowski reconstruction
Proceedings of the eleventh annual symposium on Computational geometry
3D polar-radius invariant moments and structure moment invariants
ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part II
Polyhedral gauss maps and curvature characterisation of triangle meshes
IMA'05 Proceedings of the 11th IMA international conference on Mathematics of Surfaces
| Hi-index | 0.00 |
The Extended Gaussian Image (EGI) of an object records the variation of surface area with surface orientation. The EGI is a unique representation for convex objects. For a polyhedron, each face is represented by its normal and its area. The inversion problem (from an EGI to a description in terms of vertices and faces) is solved for convex polyhedra, by providing an algorithm giving an iterative solution by a minimization[Little,1983]. The algorithm employs a geometric construction, the mixed volume, which was used in Minkowski's proof [1897] of the existence and uniqueness of an inverse. The mixed volume measures similarity of shape for convex objects.