AN O(N) ALGORITHM TO FIND A NEAR-OPTIMUM PARTITION OF A CONVEX POLYGON

被引：9

|

作者：

HU, TC

SHING, MT

机构：

来源：

JOURNAL OF ALGORITHMS | 1981年 / 2卷 / 02期

关键词：

D O I：

10.1016/0196-6774(81)90014-6

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

收藏

页码：122 / 138

页数：17

相关论文

共 50 条

[11] Low-complexity algorithm for near-optimum detection of V-BLAST systems
Li, Jindong
Cao, Fei F.
Yang, Hawei
IEEE SIGNAL PROCESSING LETTERS, 2007, 14 (09) : 593 - 596
[12] AN ALGORITHM FOR DEFINING A SINGLE NEAR-OPTIMUM MESH FOR MULTIPLE-LOAD-CASE PROBLEMS
SHEPHARD, MS
INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, 1980, 15 (04) : 617 - 625
[13] A new fully projective O(log N) point-in-convex polygon algorithm: a new strategy
Skala, Vaclav
VISUAL COMPUTER, 2024, : 4839 - 4850
[14] Composing hybrid wavelets for optimum and near-optimum representation and accelerated evaluation of N-way data sets
Luttrell, Robert D.
Gilbert, Michael K.
Vogt, Frank
JOURNAL OF CHEMOMETRICS, 2007, 21 (1-2) : 65 - 75
[15] DETERMINATION OF NEAR-OPTIMUM USE OF HOSPITAL DIAGNOSTIC RESOURCES USING THE GENES GENETIC ALGORITHM SHELL
BICKEL, AS
BICKEL, RW
COMPUTERS IN BIOLOGY AND MEDICINE, 1990, 20 (01) : 1 - 13
[16] Reduced-complexity near-optimum genetic algorithm assisted multiuser detection for synchronous multicarrier
Wei, H
Hanzo, L
VTC2004-SPRING: 2004 IEEE 59TH VEHICULAR TECHNOLOGY CONFERENCE, VOLS 1-5, PROCEEDINGS, 2004, : 1717 - 1721
[17] A Markov Chain Monte Carlo Algorithm for Near-Optimum Detection of MIMO-GFDM Signals
Zhang, Dan
Matthe, Maximilian
Mendes, Luciano Leonel
Fettweis, Gerhard
2015 IEEE 26TH ANNUAL INTERNATIONAL SYMPOSIUM ON PERSONAL, INDOOR, AND MOBILE RADIO COMMUNICATIONS (PIMRC), 2015, : 281 - 286
[18] A near-optimum parallel algorithm for bipartite subgraph problem using the Hopfield neural network learning
Wang, RL
Tang, Z
Cao, QP
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2002, E85A (02): : 497 - 504
[19] An algorithm to find maximum area polygons circumscribed about a convex polygon (vol 255, pg 98, 2019)
Ausserhofer, Markus
Dann, Susanna
Langi, Zsolt
Toth, Geza
DISCRETE APPLIED MATHEMATICS, 2024, 353 : 222 - 226
[20] A new fully projective O(lg N) line convex polygon intersection algorithmA new fully projective O(lg N) line convex polygon intersection algorithmV. Skala
Vaclav Skala
The Visual Computer, 2025, 41 (2) : 1241 - 1249

← 1 2 3 4 5 →