Placements of euclidean trees
We define a Euclidean tree T = $(V,E)$ to be a weighted tree such that each edge $e in E$ has been assigned a positive integer weight l(e) called the length of e. A placement of T = $(V,E)$ is an assignment $f: V to { bf R} sp2$ (or R$ sp3$) of vertices to points in space satisfying the following: f...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | en |
| Published: |
McGill University
1989
|
| Subjects: | |
| Online Access: | http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=74356 |