|
|
|
| MavicaNet - Classic |
Discrete Geometry | |
 | Catalog / Culture / Science / Mathematical Sciences / Geometry and Geometric Analysis / Discrete Geometry |
| Catalog / Culture / Science / Mathematical Sciences / Discrete Mathematics / Discrete Geometry |
 | Packing Problems [7] |
| |||
| |||||
| See also | |||||
| |||
| |||
|
The Steiner Tree Page
The Steiner tree problem, succintly, is a minimum interconnection problem. The most basic version is in a graph: given a weighted graph in which a subset of vertices are identified as terminals, find a minimum-weight connected subgraph that includes all the terminals. If the edge weights are all positive, then the resulting subgraph is obviously a tree. [eng] |
||
| |||
|
|
Steiner Surfaces
Clip gallery and mathematical discription of Steiner's images of the real projective plane. [eng] |
||
| |||
|
|
The Geometry Junkyard
Contains usenet clippings, web pointers, lecture notes, research excerpts, papers, abstracts, programs, problems, and other stuff related to discrete and computational geometry. [eng] |
||
| |||
|
|
Dearing Aviation - describes methods of determining the radii of circles tangent to three given circles, and the radii of spheres tangent to four given spheres. The solutions thus shown to Apollonius' Problem, in two and three dimensions, are both simple and unique.
new methods for finding all circles tangent to three given circles, and all spheres tangent to four given spheres. [eng] |
||
| |||
| |||
Copyright © 2000 MavicaNET. All Rights Reserved. MavicaNET ® is a registered trademark of NNT Telecom. Designed by Digital Art Design, 2000. Hosted by NNT. |
|
