Discrete location problem on arbitrary surface in \(\mathbb R^3\) (Q2853250)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Discrete location problem on arbitrary surface in R^3 |
scientific article; zbMATH DE number 6217199
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Discrete location problem on arbitrary surface in \(\mathbb R^3\) |
scientific article; zbMATH DE number 6217199 |
Statements
18 October 2013
0 references
first fundamental form
0 references
Mathematica
0 references
Discrete location problem on arbitrary surface in \(\mathbb R^3\) (English)
0 references
A discrete location problem in which locations of suppliers as well as locations of existing customers belong to arbitrary surface \(\mathcal S\) in \(R^3\) is considered. The distance between locations is defined as the length of the shortest arc between all arcs connecting them. The lengths of trajectories that connect certain locations are calculated using coefficients of the first fundamental form of the surface \(\mathcal S\). Required computations and visualizations are implemented in the programming package Mathematica. Two examples are presented useful for pedagogical purposes.
0 references
0.7339178919792175
0 references
0.7339178919792175
0 references
0.7202459573745728
0 references
0.7181090116500854
0 references
0.717640221118927
0 references
