Representing polyhedra: Faces are better than vertices

DOI10.1016/0925-7721(93)90006-RMaRDI QIDQ1314534zbMATH OpenFDO

Authors Lenwood S. Heath, Praveen K. Paripati, John W. Roach

Publication date 17 February 1994

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0925-7721(93)90006-R

zbMATH Keywords

CADcomputer visiongeometric dualpolyhedrasolid modeling

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computer science aspects of computer-aided design (68U07)

Recommendations

• Resolvable representation of polyhedra
• scientific article; zbMATH DE number 20626
• scientific article; zbMATH DE number 2084489
• Modélisation et optimisation numérique pour la reconstruction d'un polyèdre à partir de son image gaussienne généralisée

Cites work

• A note on the modeling space of Euler operators
• Depth-First Search and Linear Graph Algorithms
• Dividing a Graph into Triconnected Components
• scientific article; zbMATH DE number 4006288 (Why is no real title available?)
• scientific article; zbMATH DE number 4032498 (Why is no real title available?)
• scientific article; zbMATH DE number 3261280 (Why is no real title available?)
• scientific article; zbMATH DE number 3074559 (Why is no real title available?)

Cited in

(2)

• Resolvable representation of polyhedra
• scientific article; zbMATH DE number 20626 (Why is no real title available?)

This page was built for publication: Representing polyhedra: Faces are better than vertices

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