AN OPTIMAL ALGORITHM FOR COMPUTING THE MINIMUM VERTEX DISTANCE BETWEEN 2 CROSSING CONVEX POLYGONS

被引：12
|
作者：
TOUSSAINT, GT
机构：
来源：
COMPUTING | 1984年 / 32卷 / 04期
关键词：
D O I：
10.1007/BF02243778
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
引用
收藏
页码：357 / 364
页数：8
相关论文
共 50 条
  • [21] Algorithm for computing minimum distance
    Garcia-Villalba, LJ
    Rodriguez-Palánquex, MC
    Montoya-Vitini, F
    ELECTRONICS LETTERS, 1999, 35 (18) : 1534 - 1535
  • [22] COMPUTING SOME DISTANCE FUNCTIONS BETWEEN POLYGONS
    ATALLAH, MJ
    RIBEIRO, CC
    LIFSCHITZ, S
    PATTERN RECOGNITION, 1991, 24 (08) : 775 - 781
  • [23] Computing the Frechet distance between folded polygons
    Cook, Atlas F.
    Driemel, Anne
    Sherette, Jessica
    Wenk, Carola
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2015, 50 : 1 - 16
  • [24] Computing the Frechet Distance between Folded Polygons
    Cook, Atlas F.
    Driemel, Anne
    Har-Peled, Sariel
    Sherette, Jessica
    Wenk, Carola
    ALGORITHMS AND DATA STRUCTURES, 2011, 6844 : 267 - +
  • [25] Computing the Frechet distance between simple polygons
    Buchin, Kevin
    Buchin, Maike
    Wenk, Carola
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2008, 41 (1-2): : 2 - 20
  • [26] Computing the Frechet Distance Between Polygons with Holes
    Nayyeri, Amir
    Sidiropoulos, Anastasios
    AUTOMATA, LANGUAGES, AND PROGRAMMING, PT I, 2015, 9134 : 997 - 1009
  • [27] An optimal algorithm for the intersection radius of a set of convex polygons
    Jadhav, S
    Mukhopadhyay, A
    Bhattacharya, B
    JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 1996, 20 (02): : 244 - 267
  • [28] AN OPTIMAL ALGORITHM FOR THE INTERSECTION RADIUS OF A SET OF CONVEX POLYGONS
    JADHAV, S
    MUKHOPADHYAY, A
    BHATTACHARYA, B
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 652 : 92 - 103
  • [29] A New Algorithm for computing Minimum Distance
    Sundaraj, K
    d'Aulignac, D
    Mazer, E
    2000 IEEE/RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS (IROS 2000), VOLS 1-3, PROCEEDINGS, 2000, : 2115 - 2120
  • [30] A near-optimal heuristic for minimum weight triangulation of convex polygons
    Levcopoulos, C
    Krznaric, D
    PROCEEDINGS OF THE EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 1997, : 518 - 527
12345