On surface-minimizing polyhedral decompositions

DOI10.1007/BF02574060MaRDI QIDQ1892427zbMATH OpenOpenAlexFDO

Authors A. Heppes

Publication date 2 July 1995

Published in Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/131378

zbMATH Keywords

minimal surfaceoptimal decompositionpolyhedron

Mathematics Subject Classification ID

Isoperimetric problems for polytopes (52B60)

Review text

The author shows under certain conditions that the minimal surface, decomposing a given polyhedron into parts of given volumes, is not polyhedral and lists some characteristic local properties of the optimal polyhedral decomposition, assuming such decomposition exists, of a given polyhedron with a given volume. A cell system defined by the shortest net is called optimal decomposition. He gives conditions that hold for the inner faces of an optimal dividing surface and presents some corollaries derived from the conditions concerning the structure of an optimal polyhedral decomposition of a polyhedron in \(E^3\). In the first two of these corollaries it is stated that the optimal polyhedral decomposition of a polyhedron into parts of given volumes contains respectively no inner cell and no face with merely inner vertices. In the third one it is stated that when the optimal solution of a slab decomposition problem is polyhedral then it has no inner nodes. In corollaries 4 and 5 the polyhedron that will be decomposed into parts of given volumes is considered to be convex, and in an optimal polyhedral decomposition it is respectively expressed that an inner face has at most two inner vertices and an inner node of the dividing surface has at most one inner neighbor. Finally a detailed classification is given when the polyhedron to be decomposed is taken convex.

Recommendations

• Solving minimal surface problems on surfaces and point clouds
• Minimal surfaces in simplicial complexes
• scientific article; zbMATH DE number 5052286
• Minimum vertex hulls for polyhedral domains
• scientific article; zbMATH DE number 4206037
• Approximate convex decomposition of polyhedra and its applications
• A Lipschitz decomposition of minimal surfaces
• Computing Discrete Minimal Surfaces and Their Conjugates

Cites work

• scientific article; zbMATH DE number 3129821 (Why is no real title available?)
• scientific article; zbMATH DE number 3162495 (Why is no real title available?)
• scientific article; zbMATH DE number 3560295 (Why is no real title available?)
• scientific article; zbMATH DE number 3207773 (Why is no real title available?)
• scientific article; zbMATH DE number 3209747 (Why is no real title available?)
• scientific article; zbMATH DE number 3197685 (Why is no real title available?)
• scientific article; zbMATH DE number 3102071 (Why is no real title available?)
• Isoperimetric problems for tilings
• Isoperimetric problems for tilings, corrigendum
• The structure of singularities in soap-bubble-like and soap-film-like minimal surfaces
• Two-Dimensional Honeycombs

Cited in

(5)

• Instability of the wet X soap film
• Minimum polyhedron with \(n\) vertices
• Strategies for polyhedral surface decomposition: an experimental study.
• Graph Drawing
• The least-perimeter partition of a sphere into four equal areas

This page was built for publication: On surface-minimizing polyhedral decompositions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1892427)