Discrete geodesic graph (DGG) for computing geodesic distances on polyhedral surfaces (Q2357709)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6730770
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Discrete geodesic graph (DGG) for computing geodesic distances on polyhedral surfaces |
scientific article; zbMATH DE number 6730770 |
Statements
Discrete geodesic graph (DGG) for computing geodesic distances on polyhedral surfaces (English)
0 references
14 June 2017
0 references
geodesic distances
0 references
polyhedral surfaces
0 references
discrete geodesic graph
0 references
saddle vertex graph
0 references
numerical examples
0 references
manifold triangle mesh
0 references
0 references
0 references
0.7912456393241882
0 references
0.7526279091835022
0 references
0.7512104511260986
0 references
0.7392370700836182
0 references
0.7371942400932312
0 references
