minimum total length

CCCG
2008

151views Computational Geometry» more CCCG 2008»

Computational Balloon Twisting: The Theory of Balloon Polyhedra

14 years 29 days ago

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

claim paper

Read More »

click to vote

ASPDAC
2001
ACM

103views Hardware» more ASPDAC 2001»

Efficient minimum spanning tree construction without Delaunay triangulation

14 years 3 months ago

Download www.eecs.northwestern.edu

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

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers