3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects
Author:
- Matthew J. KatzMKMatthew J. Katz
- 1 November 1997
- journal article
- Published by Elsevier in Computational Geometry
- Vol. 8 (6) , 299-316
Abstract
No abstract availableKeywords
This publication has 33 references indexed in Scilit:
- Algorithms for generalized halfspace range searching and other intersection searching problemsComputational Geometry, 1996
- Computing depth orders for fat objects and related problemsComputational Geometry, 1995
- Ray shooting in polygons using geodesic triangulationsAlgorithmica, 1994
- The complexity of the free space for motion planning amidst fat obstaclesJournal of Intelligent & Robotic Systems, 1994
- The complexity of the free space for a robot moving amidst fat obstaclesComputational Geometry, 1993
- On the union of fat wedges and separating a collection of segments by a lineComputational Geometry, 1993
- Circle Shooting in a Simple PolygonJournal of Algorithms, 1993
- Quasi-optimal upper bounds for simplex range searching and new zone theoremsAlgorithmica, 1992
- Approximate motion planning and the complexity of the boundary of the union of simple geometric figuresAlgorithmica, 1992
- Efficient hidden surface removal for objects with small union sizeComputational Geometry, 1992