Principles of interactive computer graphics (2nd ed.)
Principles of interactive computer graphics (2nd ed.)
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Plane-sweep algorithms for intersecting geometric figures
Communications of the ACM
Algorithms and Complexity: New Directions and Recent Results
Algorithms and Complexity: New Directions and Recent Results
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
Computational geometry.
A Bibliography on Digital and Computational Convexity (1961-1988)
IEEE Transactions on Pattern Analysis and Machine Intelligence
The complexity of many faces in arrangements of lines of segments
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
An efficient output-sensitive hidden surface removal algorithm and its parallelization
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Optimal parallel algorithm for visibility of a simple polygon from a point
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Approximation hierarchies and S-bounds
SMA '91 Proceedings of the first ACM symposium on Solid modeling foundations and CAD/CAM applications
The n-dimensional extended convex differences tree (ECDT) for representing polyhedra
SMA '91 Proceedings of the first ACM symposium on Solid modeling foundations and CAD/CAM applications
An optimal parallel algorithm for the visibility of a simple polygon from a point
Journal of the ACM (JACM)
Intersection detection and separators for simple polygons
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Incremental algorithms for collision detection between solid models
SMA '95 Proceedings of the third ACM symposium on Solid modeling and applications
Incremental collision detection for polygonal models
Proceedings of the eleventh annual symposium on Computational geometry
OBBTree: a hierarchical structure for rapid interference detection
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Splitting a complex of convex polytopes in any dimension
Proceedings of the twelfth annual symposium on Computational geometry
Proceedings of the twelfth annual symposium on Computational geometry
On the sectional area of convex polytopes
Proceedings of the twelfth annual symposium on Computational geometry
Interactive Boolean operations for conceptual design of 3-D solids
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
Hardware-assisted virtual collisions
VRST '98 Proceedings of the ACM symposium on Virtual reality software and technology
Deterministic algorithms for 2-d convex programming and 3-d online linear programming
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Incremental Algorithms for Collision Detection Between Polygonal Models
IEEE Transactions on Visualization and Computer Graphics
A Solid Modelling System for Robot Action Planning
IEEE Computer Graphics and Applications
Optimal Parallel Hypercube Algorithms for Polygon Problems
IEEE Transactions on Computers
Separation Sensitive Kinetic Separation Structures for Convex Polygons
JCDCG '00 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
In-Place Planar Convex Hull Algorithms
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Image-Based Techniques in a Hybrid Collision Detector
IEEE Transactions on Visualization and Computer Graphics
Sublinear geometric algorithms
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Image-based collision detection
Integrated image and graphics technologies
Space-efficient planar convex hull algorithms
Theoretical Computer Science - Latin American theorotical informatics
Online piece-wise linear approximation of numerical streams with precision guarantees
Proceedings of the VLDB Endowment
Algorithms and theory of computation handbook
Property testing
Property testing
| Hi-index | 0.01 |
One of the basic geometric operations involves determining whether a pair of convex objects intersect. This problem is well understood in a model of computation in which the objects are given as input and their intersection is returned as output. For many applications, however, it may be assumed that the objects already exist within the computer and that the only output desired is a single piece of data giving a common point if the objects intersect or reporting no intersection if they are disjoint. For this problem, none of the previous lower bounds are valid and algorithms are proposed requiring sublinear time for their solution in two and three dimensions.