Subdivision algorithms and the kernel of a polyhedron

DOI10.1007/BF02293056zbMath0764.52004OpenAlexW2073048911MaRDI QIDQ1196202

Michael Kallay, Richard J. Gardner

Publication date: 17 December 1992

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

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

zbMATH Keywords

CADsmoothing algorithm3-polytopesFejes-Tóth kernel

Mathematics Subject Classification ID

Computer science aspects of computer-aided design (68U07) Three-dimensional polytopes (52B10)

Related Items (1)

Mixed honeycomb pushing refinement

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sur les courbes limités de polygones obtenus par trisection
• Nearly all convex bodies are smooth and strictly convex
• L'itération de Fejes Toth sur un polygone
• On Hammer's X-Ray Problem
• Conditions for tangent plane continuity over recursively generated B-spline surfaces
• Sequences of Polyhedra

This page was built for publication: Subdivision algorithms and the kernel of a polyhedron