Sciweavers

CCCG
2008
13 years 5 months ago
Computational Balloon Twisting: The Theory of Balloon Polyhedra
This paper builds a general mathematical and algorithmic theory for balloon-twisting structures, from balloon animals to balloon polyhedra, by modeling their underlying graphs (ed...
Erik D. Demaine, Martin L. Demaine, Vi Hart
ASPDAC
2001
ACM
103views Hardware» more  ASPDAC 2001»
13 years 8 months ago
Efficient minimum spanning tree construction without Delaunay triangulation
Given n points in a plane, a minimum spanning tree is a set of edges which connects all the points and has a minimum total length. A naive approach enumerates edges on all pairs o...
Hai Zhou, Narendra V. Shenoy, William Nicholls