|
| Keyword : computational geometry
| |
|
Simple Proof of the Lower Bound on the Average Distance from the Fermat-Weber Center of a Convex Body
Xuehou TAN | Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2022/05/01
Vol. E105-A
No. 5 ;
pp. 853-857
Type of Manuscript:
PAPER
Category: Numerical Analysis and Optimization
Keyword:
computational geometry, Fermat-Weber center, average distance, | | | Summary | Full Text:PDF | |
| |
| |
| |
| |
| |
| |
| |
|
Adaptive Algorithms for Planar Convex Hull Problems
Hee-Kap AHN Yoshio OKAMOTO | Publication: IEICE TRANSACTIONS on Information and Systems
Publication Date: 2011/02/01
Vol. E94-D
No. 2 ;
pp. 182-189
Type of Manuscript:
Special Section PAPER (Special Section on Foundations of Computer Science -- Mathematical Foundations and Applications of Algorithms and Computer Science --)
Category:
Keyword:
adaptive algorithms, convex hulls, computational geometry, | | | Summary | Full Text:PDF | |
| |
| |
| |
| |
| |
| |
|
Constructing Voronoi Diagrams in the L1 Metric Using the Geographic Nearest Neighbors
Youngcheul WEE | Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2001/07/01
Vol. E84-A
No. 7 ;
pp. 1755-1760
Type of Manuscript:
PAPER
Category: Algorithms and Data Structures
Keyword:
computational geometry, Voronoi diagram, parallel algorithm, L1 metric, | | | Summary | Full Text:PDF | |
| |
| |
| |
|
Effective Use of Geometric Information for Clustering and Related Topics
Tetsuo ASANO | Publication: IEICE TRANSACTIONS on Information and Systems
Publication Date: 2000/03/25
Vol. E83-D
No. 3 ;
pp. 418-427
Type of Manuscript:
INVITED SURVEY PAPER
Category: Algorithms for Geometric Problems
Keyword:
bipartite graph, coloring, computational geometry, diameter, duality transform, geometric clustering, intercluster distance, maximum spanning tree, separability, Voronoi dia-gram, | | | Summary | Full Text:PDF | |
|
Combinatorics on Arrangements and Parametric Matroids: A Bridge between Computational Geometry and Combinatorial Optimization
Takeshi TOKUYAMA | Publication: IEICE TRANSACTIONS on Information and Systems
Publication Date: 2000/03/25
Vol. E83-D
No. 3 ;
pp. 362-371
Type of Manuscript:
INVITED SURVEY PAPER
Category: Algorithms for Matroids and Related Discrete Systems
Keyword:
parametric optimization, computational geometry, combinatorics, matroids, | | | Summary | Full Text:PDF | |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
|
Geometric Algorithms for Linear Programming
Hiroshi IMAI | Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1993/03/25
Vol. E76-A
No. 3 ;
pp. 259-264
Type of Manuscript:
INVITED PAPER (Special Section on the 5th Karuizawa Workshop on Circuits and Systems)
Category:
Keyword:
computational geometry, linear programming, prune-and-search, randomization, | | | Summary | Full Text:PDF | |
| |
| |
|
|