3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects
type: Item
instance of: scholarly article
title: 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects
zbMATH Open document ID: 0888.68115
DOI: 10.1016/S0925-7721(96)00027-2
author: Matthew J. Katz
published in: Computational Geometry
publication date: 1998-06-11T00:00:00Z
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 1080142
zbMATH Keywords: point enclosure
zbMATH Keywords: range searching
zbMATH Keywords: vertical ray shooting
MaRDI profile type: Publication
cites work: Computing depth orders for fat objects and related problems
cites work: Applications of a new space-partitioning technique
cites work: Circle Shooting in a Simple Polygon
cites work: Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
cites work: Improved algorithms for discs and balls using power diagrams
cites work: New results on binary space partitions in the plane (extended abstract)
cites work: Computing and Verifying Depth Orders
cites work: Two-Dimensional and Three-Dimensional Point Location in Rectangular Subdivisions
cites work: Ray shooting in polygons using geodesic triangulations
cites work: Visibility and intersection problems in plane geometry
cites work: Quasi-optimal upper bounds for simplex range searching and new zone theorems
cites work: On the union of fat wedges and separating a collection of segments by a line
cites work: Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization
cites work: Algorithms for generalized halfspace range searching and other intersection searching problems
cites work: On intersection searching problems involving curved objects
cites work: Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
cites work: A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk
cites work: GENERALIZED INTERSECTION SEARCHING PROBLEMS
cites work: Efficient hidden surface removal for objects with small union size
cites work: On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
cites work: Special issue: Algorithms for geographic data handling
cites work: On fat partitioning, fat covering and the union size of polygons
cites work: Efficient partition trees
cites work: Range searching with efficient hierarchical cuttings
cites work: Fat Triangles Determine Linearly Many Holes
cites work: Q3219753
cites work: Point location in fat subdivisions
cites work: Range Searching and Point Location among Fat Objects
cites work: Q3992847
cites work: Range searching in low-density environments
cites work: On \(k\)-sets in arrangements of curves and surfaces
cites work: Q4325546
cites work: The complexity of the free space for motion planning amidst fat obstacles
cites work: The complexity of the free space for a robot moving amidst fat obstacles
full work available at URL: s0925-7721(96)00027-2
OpenAlex ID: W2136863760
Recommended article: Ray shooting and intersection searching amidst fat convex polyhedra in 3-space
Recommended article: Ray Shooting Amidst Convex Polyhedra and Polyhedral Terrains in Three Dimensions
Recommended article: Vertical Ray Shooting and Computing Depth Orders for Fat Objects
Recommended article: Q3140428
Recommended article: On Ray Shooting for Triangles in 3-Space and Related Problems
Recommended article: Ray Shooting Amidst Spheres in Three Dimensions and Related Problems
Recommended article: Vertical ray shooting for fat objects
Recommended article: On ray shooting in convex polytopes
Recommended article: Ray Shooting Amidst Convex Polygons in 2D
Recommended article: Ray shooting on triangles in 3-space
description: scientific article; zbMATH DE number 1080142