Dynamic hierarchical subdivision algorithm for computing Delaunay triangulations and other closest-point problems

被引：0

|

作者：

Palacios-Velez, Oscar ^{[1
]}

Renaud, Baltasar Cuevas ^{[1
]}

机构：

[1] Colegio de Postgraduados, Mexico

来源：

| 1600年 / 16期

关键词：

Closest Point Problems - Computational Geometry - Delaunay Traingulation - Hierarchical Search - Mathematical Software - Search Methods;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

收藏

相关论文

共 33 条

[31] An improved invasive weed optimization algorithm for solving dynamic economic dispatch problems with valve-point effects
Zheng, Zhi-xin
Li, Jun-qing
Han, Yu-yan
JOURNAL OF EXPERIMENTAL & THEORETICAL ARTIFICIAL INTELLIGENCE, 2020, 32 (05) : 805 - 829
[32] A multi-strategy genetic algorithm for solving multi-point dynamic aggregation problems with priority relationships of tasks
Shen, Yu
Li, Hecheng
ELECTRONIC RESEARCH ARCHIVE, 2024, 32 (01): : 445 - 472
[33] Lq\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${L_q}$$\end{document}-Closest-Point to Affine Subspaces Using the Generalized Weiszfeld Algorithm
Khurrum Aftab
Richard Hartley
Jochen Trumpf
International Journal of Computer Vision, 2015, 114 (1) : 1 - 15

← 1 2 3 4 →