AAAAAA

   
Results: 1-14 |
Results: 14
A CONSTANT-FACTOR APPROXIMATION ALGORITHM FOR THE GEOMETRIC K-MST PROBLEM IN THE PLANE
Authors: MITCHELL JSB BLUM A CHALASANI P VEMPALA S
Citation: Jsb. Mitchell et al., A CONSTANT-FACTOR APPROXIMATION ALGORITHM FOR THE GEOMETRIC K-MST PROBLEM IN THE PLANE, SIAM journal on computing (Print), 28(3), 1999, pp. 771-781
EFFICIENT COLLISION DETECTION USING BOUNDING VOLUME HIERARCHIES OF K-DOPS
Authors: KLOSOWSKI JT HELD M MITCHELL JSB SOWIZRAL H ZIKAN K
Citation: Jt. Klosowski et al., EFFICIENT COLLISION DETECTION USING BOUNDING VOLUME HIERARCHIES OF K-DOPS, IEEE transactions on visualization and computer graphics, 4(1), 1998, pp. 21-36
DECISION TREES FOR GEOMETRIC-MODELS
Authors: ARKIN EM MEIJER H MITCHELL JSB RAPPAPORT D SKIENA SS
Citation: Em. Arkin et al., DECISION TREES FOR GEOMETRIC-MODELS, International journal of Computational geometry and applications, 8(3), 1998, pp. 343-363
VORONOI DIAGRAMS OF MOVING POINTS
Authors: ALBERS G GUIBAS LJ MITCHELL JSB ROOS T
Citation: G. Albers et al., VORONOI DIAGRAMS OF MOVING POINTS, International journal of Computational geometry and applications, 8(3), 1998, pp. 365-379
ON MINIMUM-AREA HULLS
Authors: ARKIN EM CHIANG YJ HELD M MITCHELL JSB SACRISTAN V SKIENA SS YANG TC
Citation: Em. Arkin et al., ON MINIMUM-AREA HULLS, Algorithmica, 21(1), 1998, pp. 119-136
A MAXIMUM B-MATCHING PROBLEM ARISING FROM MEDIAN LOCATION MODELS WITHAPPLICATIONS TO THE ROOMMATES PROBLEM
Authors: TAMIR A MITCHELL JSB
Citation: A. Tamir et Jsb. Mitchell, A MAXIMUM B-MATCHING PROBLEM ARISING FROM MEDIAN LOCATION MODELS WITHAPPLICATIONS TO THE ROOMMATES PROBLEM, Mathematical programming, 80(2), 1998, pp. 171-194
THE LAZY-SWEEP-RAY-CASTING-ALGORITHM FOR RENDERING IRREGULAR GRIDS
Authors: SILVA CT MITCHELL JSB
Citation: Ct. Silva et Jsb. Mitchell, THE LAZY-SWEEP-RAY-CASTING-ALGORITHM FOR RENDERING IRREGULAR GRIDS, IEEE transactions on visualization and computer graphics, 3(2), 1997, pp. 142-157
AN EFFICIENT ALGORITHM FOR EUCLIDEAN SHORTEST PATHS AMONG POLYGONAL OBSTACLES IN THE PLANE
Authors: KAPOOR S MAHESHWARI SN MITCHELL JSB
Citation: S. Kapoor et al., AN EFFICIENT ALGORITHM FOR EUCLIDEAN SHORTEST PATHS AMONG POLYGONAL OBSTACLES IN THE PLANE, Discrete & computational geometry, 18(4), 1997, pp. 377-383
GUEST EDITORS INTRODUCTION
Authors: MITCHELL JSB
Citation: Jsb. Mitchell, GUEST EDITORS INTRODUCTION, Algorithmica, 19(1-2), 1997, pp. 1-3
HAMILTONIAN TRIANGULATIONS FOR FAST RENDERING
Authors: ARKIN EM HELD M MITCHELL JSB SKIENA SS
Citation: Em. Arkin et al., HAMILTONIAN TRIANGULATIONS FOR FAST RENDERING, The visual computer, 12(9), 1996, pp. 429-444
ARRANGEMENTS OF SEGMENTS THAT SHARE END-POINTS - SINGLE FACE RESULTS
Authors: ARKIN EM HALPERIN D KEDEM K MITCHELL JSB NAOR N
Citation: Em. Arkin et al., ARRANGEMENTS OF SEGMENTS THAT SHARE END-POINTS - SINGLE FACE RESULTS, Discrete & computational geometry, 13(3-4), 1995, pp. 257-270
AN OPTIMAL ALGORITHM FOR COMPUTING VISIBILITY IN THE PLANE
Authors: HEFFERNAN PJ MITCHELL JSB
Citation: Pj. Heffernan et Jsb. Mitchell, AN OPTIMAL ALGORITHM FOR COMPUTING VISIBILITY IN THE PLANE, SIAM journal on computing, 24(1), 1995, pp. 184-201
COUNTING CONVEX POLYGONS IN PLANAR POINT SETS
Authors: MITCHELL JSB ROTE G SUNDARAM G WOEGINGER G
Citation: Jsb. Mitchell et al., COUNTING CONVEX POLYGONS IN PLANAR POINT SETS, Information processing letters, 56(1), 1995, pp. 45-49
GEOMETRIC KNAPSACK-PROBLEMS
Authors: ARKIN EM KHULLER S MITCHELL JSB
Citation: Em. Arkin et al., GEOMETRIC KNAPSACK-PROBLEMS, Algorithmica, 10(5), 1993, pp. 399-427
Risultati: 1-14 |