2 search results - page 1 / 1 » Efficient minimum spanning tree construction without Delauna... |
ASPDAC
2001
ACM
13 years 8 months ago
2001
ACM
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...
VIS
2004
IEEE
14 years 5 months ago
2004
IEEE
We present an efficient algorithm to mesh the macromolecules surface model represented by the skin surface defined by Edelsbrunner. Our algorithm overcomes several challenges resi...