Polyhedra of minimal area as 3D object models

Authors:
Joseph O'Rourke
Affiliations:
Electrical Engineering Department, Johns Hopkins University, Baltimore, MD
Venue:
IJCAI'81 Proceedings of the 7th international joint conference on Artificial intelligence - Volume 2
Year:
1981

Citing 5
Cited 2

Representations for Rigid Solids: Theory, Methods, and Systems

ACM Computing Surveys (CSUR)
Convex hulls of finite sets of points in two and three dimensions

Communications of the ACM
Optimal surface reconstruction from planar contours

Communications of the ACM
Some NP-complete geometric problems

STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Approximate algorithms for the traveling salesperson problem

SWAT '74 Proceedings of the 15th Annual Symposium on Switching and Automata Theory (swat 1974)

Reconstruction of solids

SCG '85 Proceedings of the first annual symposium on Computational geometry
SMI 2011: Full Paper: Localized Cocone surface reconstruction

Computers and Graphics

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.