COMPUTING SHORTEST PATHS ON POLYHEDRA: APPLICATIONS IN GEOMETRIC MODELING AND SCIENTIFIC VISUALIZATION

被引：2

作者：

Opitz, Karsten ^{[1
]}

Pottmann, Helmut ^{[2
]}

机构：

[1] Hewlett Packard GmbH, Mech Design Div, D-71034 Boblingen, Germany

[2] Tech Univ Vienna, Inst Geomet, A-1040 Vienna, Austria

来源：

INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS | 1994年 / 4卷 / 02期

关键词：

Shortest paths; scattered data interpolation; surface approximation; exponential map;

D O I：

10.1142/S0218195994000112

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

The application of shortest path calculations on polyhedra in different problem domains is discussed. A technique is introduced which allows to transfer problems defined on a curved domain surface into a plane. The technique is based on an approximation to the inverse exponential map. It is applied to gradient estimation for scattered data on surfaces and for the construction of local surface approximations from unorganized points.

引用

页码：165 / 178

页数：14

共 50 条

[41] 3D scientific visualization and geometric modeling in digital biomedicine
Turlapov, V.E.
Gavrilov, N.I.
[J]. Scientific Visualization, 2015, 7 (04):
[42] Computing the n x m shortest paths efficiently
Shibuya, T
[J]. ALGORITHM ENGINEERING AND EXPERIMENTATION, 1999, 1619 : 210 - 225
[43] Computing Shortest Paths among Curved Obstacles in the Plane
Chen, Danny Z.
Wang, Haitao
[J]. PROCEEDINGS OF THE TWENTY-NINETH ANNUAL SYMPOSIUM ON COMPUTATIONAL GEOMETRY (SOCG'13), 2013, : 369 - 378
[44] DISTRIBUTED ALGORITHMS FOR COMPUTING SHORTEST PAIRS OF DISJOINT PATHS
OGIER, RG
RUTENBURG, V
SCHACHAM, N
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1993, 39 (02) : 443 - 455
[45] SHORTEST PATHS, SINGLE ORIGIN-DESTINATION NETWORK DESIGN, AND ASSOCIATED POLYHEDRA
MAGNANTI, TL
MIRCHANDANI, P
[J]. NETWORKS, 1993, 23 (02) : 103 - 121
[46] Computing Shortest Paths among Curved Obstacles in the Plane
Chen, Danny Z.
Wang, Haitao
[J]. ACM TRANSACTIONS ON ALGORITHMS, 2015, 11 (04)
[47] New Reversible Computing Algorithms for Shortest Paths Problem
Guo, Lanying
Peng, Chao
He, Cheng
[J]. PROCEEDINGS OF THE 6TH INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY: IOT AND SMART CITY (ICIT 2018), 2018, : 82 - 87
[48] Distributed Visualization in Scientific Computing
石教英
蔡文立
潘志庚
张爱东
[J]. Progress in Natural Science:Materials International, 1994, (06) : 60 - 69
[49] Visualization in scientific computing in geology
Huang, Zhi
Yu, Xianchuan
Wang, Guian
Yang, Meng
[J]. PROCEEDINGS OF THE IAMG '07: GEOMATHEMATICS AND GIS ANALYSIS OF RESOURCES, ENVIRONMENT AND HAZARDS, 2007, : 730 - +
[50] ALL-PAIRS SHORTEST PATHS IN GEOMETRIC INTERSECTION GRAPHS
Chan, Timothy M.
Skrepetos, Dimitrios
[J]. JOURNAL OF COMPUTATIONAL GEOMETRY, 2019, 10 (01) : 27 - 41

← 1 2 3 4 5 →