An object centered hierarchical representation for 3D objects: the prism tree
Computer Vision, Graphics, and Image Processing
Approximating the diameter of a set of points in the Euclidean space
Information Processing Letters
Applications of random sampling in computational geometry, II
Discrete & Computational Geometry - Selected papers from the fourth ACM symposium on computational geometry, Univ. of Illinois, Urbana-Champaign, June 6 8, 1988
The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Inner and outer j-radii of convex bodies in finite-dimensional normed spaces
Discrete & Computational Geometry
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
OBBTree: a hierarchical structure for rapid interference detection
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Approximate shortest paths and geodesic diameters on convex polytopes in three dimensions
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Approximating shortest paths on a convex polytope in three dimensions
Journal of the ACM (JACM)
Direct spatial search on pictorial databases using packed R-trees
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
Collision Detection for Interactive Graphics Applications
IEEE Transactions on Visualization and Computer Graphics
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
A lower bound for Hellbronn's triangle problem in d dimensions
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus
Proceedings of the sixteenth annual symposium on Computational geometry
Algorithms for minimum volume enclosing simplex in R3
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Exact and approximation algorithms for minimum-width cylindrical shells
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Maintaining approximate extent measures of moving points
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
A practical approach for computing the diameter of a point set
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Facility Location and the Geometric Minimum-Diameter Spanning Tree
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Approximation Algorithms for k-Line Center
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Facility location and the geometric minimum-diameter spanning tree
Computational Geometry: Theory and Applications - Special issue on computational geometry - EWCG'02
Significant facet retrieval for real-time 3D sound rendering in complex virtual environments
Proceedings of the ACM symposium on Virtual reality software and technology
Antipole Tree Indexing to Support Range Search and K-Nearest Neighbor Search in Metric Spaces
IEEE Transactions on Knowledge and Data Engineering
Evolutionary form-finding of tensegrity structures
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
New upper bounds on the quality of the PCA bounding boxes in r2 and r3
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Processing a large number of continuous preference top-k queries
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Minimum bounding boxes for regular cross-polytopes
Proceedings of the 27th Annual ACM Symposium on Applied Computing
| Hi-index | 0.00 |