An efficient algorithm to determine the image of a parallelepiped under a linear transformation
SCG '86 Proceedings of the second annual symposium on Computational geometry
A probabilistic algorithm for the post office problem
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Primitives for the manipulation of three-dimensional subdivisions
SCG '87 Proceedings of the third annual symposium on Computational geometry
A Bibliography on Digital and Computational Convexity (1961-1988)
IEEE Transactions on Pattern Analysis and Machine Intelligence
Higher-dimensional Voronoi diagrams in linear expected time
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Linear programming and convex hulls made easy
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
In-place techniques for parallel convex hull algorithms (preliminary version)
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Degenerate convex hulls in high dimensions without extra storage
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Robust gift wrapping for the three-dimensional convex hull
Journal of Computer and System Sciences
Output-sensitive results on convex hulls, extreme points, and related problems
Proceedings of the eleventh annual symposium on Computational geometry
How good are convex hull algorithms?
Proceedings of the eleventh annual symposium on Computational geometry
The quickhull algorithm for convex hulls
ACM Transactions on Mathematical Software (TOMS)
New lower bounds for convex hull problems in odd dimensions
Proceedings of the twelfth annual symposium on Computational geometry
Variable independence and aggregation closure
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Primal-dual methods for vertex and facet enumeration (preliminary version)
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Degenerate convex hulls on-line in any fixed dimension
Proceedings of the fourteenth annual symposium on Computational geometry
On degeneracy in geometric computations
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Progress in Picture Processing: 1969--71
ACM Computing Surveys (CSUR)
Convex hulls of finite sets of points in two and three dimensions
Communications of the ACM
On the autocorrelation structure of TCP traffic
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Advances in modeling and engineering of Longe-Range dependent traffic
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Generating all vertices of a polyhedron is hard
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Contributing vertices-based Minkowski sum computation of convex polyhedra
Computer-Aided Design
Medial axis lookup table and test neighborhood computation for 3D chamfer norms
Pattern Recognition
A new clustering algorithm for coordinate-free data
Pattern Recognition
Bounds on the complexity of halfspace intersections when the bounded faces have small dimension
Proceedings of the twenty-seventh annual symposium on Computational geometry
Convex hulls of spheres and convex hulls of convex polytopes lying on parallel hyperplanes
Proceedings of the twenty-seventh annual symposium on Computational geometry
Computer Science Review
Parallel Blue-noise Sampling by Constrained Farthest Point Optimization
Computer Graphics Forum
Convex hulls of spheres and convex hulls of disjoint convex polytopes
Computational Geometry: Theory and Applications
| Hi-index | 0.02 |