Topologically sweeping an arrangement
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Primitives for the manipulation of general subdivisions and the computation of Voronoi
ACM Transactions on Graphics (TOG)
Plane-sweep algorithms for intersecting geometric figures
Communications of the ACM
Worst-case optimal hidden-surface removal
ACM Transactions on Graphics (TOG)
Compliant motion planning with geometric models
SCG '87 Proceedings of the third annual symposium on Computational geometry
Simultaneous containment of several polygons
SCG '87 Proceedings of the third annual symposium on Computational geometry
IEEE Transactions on Pattern Analysis and Machine Intelligence
Arrangements of lines in 3-space: a data structure with applications
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
A simple output-sensitive algorithm for hidden surface removal
ACM Transactions on Graphics (TOG)
An optimal algorithm for intersecting line segments in the plane
Journal of the ACM (JACM)
Assembly sequencing with toleranced parts
SMA '95 Proceedings of the third ACM symposium on Solid modeling and applications
Overlaying simply connected planar subdivisions in linear time
Proceedings of the eleventh annual symposium on Computational geometry
Computing integer points in Minkowski sums
Proceedings of the sixteenth annual symposium on Computational geometry
Incremental Penetration Depth Estimation between Convex Polytopes Using Dual-Space Expansion
IEEE Transactions on Visualization and Computer Graphics
Exact and efficient construction of Minkowski sums of convex polyhedra with applications
Computer-Aided Design
Assessing methods for the evaluation of the configuration space for planar revolute manipulators
Journal of Computational Methods in Sciences and Engineering - Computational and Mathematical Methods for Science and Engineering Conference 2002 - CMMSE-2002
A GPU-based voxelization approach to 3D Minkowski sum computation
Proceedings of the 14th ACM Symposium on Solid and Physical Modeling
Enumerating a subset of the integer points inside a Minkowski sum
Computational Geometry: Theory and Applications
Voxelized Minkowski sum computation on the GPU with robust culling
Computer-Aided Design
A sweep and translate algorithm for computing voxelized 3D Minkowski sums on the GPU
Computer-Aided Design
| Hi-index | 0.00 |
In this paper we show how certain geometric convolution operations can be computed efficiently. Here “efficiently” means that our algorithms have running time proportional to the input size plus the output size. Our convolution algorithms rely on new optimal solutions for certain reciprocal search problems, such as finding intersections between “blue” and “green” intervals, and overlaying convex planar subdivisions.