Computing depth orders for fat objects and related problems
type: Item
instance of: scholarly article
title: Computing depth orders for fat objects and related problems
zbMATH Open document ID: 0851.68102
DOI: 10.1016/0925-7721(95)00005-8
author: Matthew J. Katz
author: Pankaj K. Agarwal
author: Micha Sharir
published in: Computational Geometry
publication date: 1996-11-10T00:00:00Z
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 902865
MaRDI profile type: Publication
full work available at URL: 0925-7721(95)00005-8
OpenAlex ID: W2026200800
cites work: Euclidean minimum spanning trees and bichromatic closest pairs
cites work: On range searching with semialgebraic sets
cites work: Red-Blue Intersection Detection Algorithms, with Applications to Motion Planning and Collision Detection
cites work: Circle Shooting in a Simple Polygon
cites work: Applications of Parametric Searching in Geometric Optimization
cites work: An optimal algorithm for the boundary of a cell in a union of rays
cites work: Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
cites work: Q3140432
cites work: Ray shooting in polygons using geodesic triangulations
cites work: Algorithms for bichromatic line-segment problems and polyhedral terrains
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: Ray shooting, depth orders and hidden surface removal
cites work: Efficient ray shooting and hidden surface removal
cites work: Computing and Verifying Depth Orders
cites work: On the union of fat wedges and separating a collection of segments by a line
cites work: Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
cites work: \(\epsilon\)-nets and simplex range queries
cites work: Finding the upper envelope of n line segments in O(n log n) time
cites work: Q3140401
cites work: Efficient hidden surface removal for objects with small union size
cites work: Range searching with efficient hierarchical cuttings
cites work: Fat Triangles Determine Linearly Many Holes
cites work: Q3219753
cites work: Q3992847
cites work: Q4325546
cites work: On fat partitioning, fat covering and the union size of polygons
cites work: Intersection queries in sets of disks
description: scientific article; zbMATH DE number 902865