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
关键词
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 条
  • [1] An improved approximation algorithm for computing geometric shortest paths
    Aleksandrov, L
    Maheshwari, A
    Sack, JR
    [J]. FUNDAMENTALS OF COMPUTATION THEORY, PROCEEDINGS, 2003, 2751 : 246 - 257
  • [2] ON SHORTEST PATHS AMIDST CONVEX POLYHEDRA
    SHARIR, M
    [J]. SIAM JOURNAL ON COMPUTING, 1987, 16 (03) : 561 - 572
  • [3] Lower bounds for computing geometric spanners and approximate shortest paths
    Chen, DZ
    Das, G
    Smid, H
    [J]. DISCRETE APPLIED MATHEMATICS, 2001, 110 (2-3) : 151 - 167
  • [4] Approximate Shortest Paths in Simple Polyhedra
    Li, Fajie
    Klette, Reinhard
    [J]. DISCRETE GEOMETRY FOR COMPUTER IMAGERY, 2011, 6607 : 513 - +
  • [5] ON THE SHORTEST PATHS BETWEEN 2 CONVEX POLYHEDRA
    BALTSAN, A
    SHARIR, M
    [J]. JOURNAL OF THE ACM, 1988, 35 (02) : 267 - 287
  • [6] Shortest paths on a polyhedron .1. Computing shortest paths
    Chen, JD
    Han, YJ
    [J]. INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 1996, 6 (02) : 127 - 144
  • [7] Computing shortest paths with uncertainty
    Feder, Tomas
    Motwani, Rajeev
    O' Callaghan, Liadan
    Olston, Chris
    Panigrahy, Rina
    [J]. JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 2007, 62 (01): : 1 - 18
  • [8] Computing Almost Shortest Paths
    Elkin, Michael
    [J]. ACM TRANSACTIONS ON ALGORITHMS, 2005, 1 (02) : 283 - 323
  • [9] Computing shortest paths with uncertainty
    Feder, T
    Motwani, R
    O'Callaghan, L
    Olston, C
    Panigrahy, R
    [J]. STACS 2003, PROCEEDINGS, 2003, 2607 : 367 - 378
  • [10] Research on Theories and Applications of Visualization in Scientific Computing
    Niu, Xiaotai
    Jing, Lixia
    [J]. 2010 INTERNATIONAL CONFERENCE ON MANAGEMENT SCIENCE AND ENGINEERING (MSE 2010), VOL 2, 2010, : 298 - 301