Blending Polyhedra with Overlays

Year: 2001 Authors: Douglas Zongker; George W. Hart

Core claim

Overlaying dual spherical networks and dualizing the result produces blend polyhedra that combine source faces while preserving normals and edge weights.

Topics

polyhedron blending, spherical networks, overlay dualization, animation

Domains

convex polyhedra, Minkowski sum, topological duality, graph embedding, generative geometry, mathematical visualization, kinetic animation, geometric form

Methods

dualization, network overlay, edge labeling, gather operation

Media

unit sphere, polyhedra, great-circle arcs, vertex coordinates

Source status

This page publishes metadata and extracted analytical signals only. Raw PDF and full OCR text are kept local for now.