Intersection removal for simple polygons

被引：0
|
作者：
Lahorani, S
Krithivasan, K
机构：
[1] Dept. of Comp. Sci. and Engineering, Indian Institute of Technology
来源：
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS | 1997年 / 64卷 / 3-4期
关键词：
computational geometry; simple polygons; intensity of collision;
D O I：
10.1080/00207169708804585
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
Given two intersecting simple polygons A and B and a direction, theta, we have to find the minimum distance by which B should be translated along direction theta so that A and B no longer intersect. We present two algorithms for this problem for the case that A and B are in 2 dimensions and one algorithm for the case that they are in 3 dimensions. The 2 dimensional algorithms run in O(N-4) and O(N-3 log N) time respectively where N is the total number of vertices in both the polygons while the 3 dimensional algorithm runs in O(N-4) time.
引用
收藏
页码：211 / 223
页数：13
相关论文
共 50 条
  • [21] Algorithms for triangulating simple polygons
    Lamot, M
    Zalik, B
    ITI 2000: PROCEEDINGS OF THE 22ND INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY INTERFACES, 2000, : 429 - 436
  • [22] ON COMPATIBLE TRIANGULATIONS OF SIMPLE POLYGONS
    ARONOV, B
    SEIDEL, R
    SOUVAINE, D
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 1993, 3 (01): : 27 - 35
  • [23] Efficient triangulation of simple polygons
    Toussaint, Godfried
    Visual Computer, 1991, 7 (5-6): : 280 - 295
  • [24] Weak visibility polygons of NURBS curves inside simple polygons
    Yang, Cheng-Lei
    Wang, Wei-Zhen
    Yang, Yi-Jun
    Lu, Lin
    Zhu, Zhi-Jie
    Zhu, Binhai
    Zeng, Wei
    JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2014, 256 : 1 - 15
  • [25] CONVEX DECOMPOSITION OF SIMPLE POLYGONS
    TOR, SB
    MIDDLEDITCH, AE
    ACM TRANSACTIONS ON GRAPHICS, 1984, 3 (04): : 244 - 265
  • [26] Recognizing Weakly Simple Polygons
    Hugo A. Akitaya
    Greg Aloupis
    Jeff Erickson
    Csaba D. Tóth
    Discrete & Computational Geometry, 2017, 58 : 785 - 821
  • [27] FAST TRIANGULATION OF SIMPLE POLYGONS
    HERTEL, S
    MEHLHORN, K
    LECTURE NOTES IN COMPUTER SCIENCE, 1983, 158 : 207 - 218
  • [28] Intersection of Nonconvex Polygons Using the Alternate Hierarchical Decomposition
    Bulbul, Rizwan
    Frank, Andrew U.
    GEOSPATIAL THINKING, 2010, : 1 - 23
  • [29] Homothetic polygons and beyond: Maximal cliques in intersection graphs
    Brimkov, Valentin E.
    Junosza-Szaniawski, Konstanty
    Kafer, Sean
    Kratochvil, Jan
    Pergel, Martin
    Rzazewski, Pawel
    Szczepankiewicz, Matthew
    Terhaar, Joshua
    DISCRETE APPLIED MATHEMATICS, 2018, 247 : 263 - 277
  • [30] 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
12345