Computing depth orders for fat objects and related problems
From MaRDI portal
Publication:1917032
DOI10.1016/0925-7721(95)00005-8zbMATH Open0851.68102OpenAlexW2026200800MaRDI QIDQ1917032FDOQ1917032
Authors: Matthew J. Katz, Pankaj K. Agarwal, Micha Sharir 
Publication date: 10 November 1996
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0925-7721(95)00005-8
Recommendations
Cites Work
- \(\epsilon\)-nets and simplex range queries
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the union of fat wedges and separating a collection of segments by a line
- Quasi-optimal upper bounds for simplex range searching and new zone theorems
- Visibility and intersection problems in plane geometry
- Finding the upper envelope of n line segments in O(n log n) time
- Applications of Parametric Searching in Geometric Optimization
- Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
- Ray shooting, depth orders and hidden surface removal
- On range searching with semialgebraic sets
- Fat Triangles Determine Linearly Many Holes
- Computing and Verifying Depth Orders
- Range searching with efficient hierarchical cuttings
- Ray shooting in polygons using geodesic triangulations
- On fat partitioning, fat covering and the union size of polygons
- Euclidean minimum spanning trees and bichromatic closest pairs
- Title not available (Why is that?)
- Efficient hidden surface removal for objects with small union size
- Intersection queries in sets of disks
- Algorithms for bichromatic line-segment problems and polyhedral terrains
- Red-Blue Intersection Detection Algorithms, with Applications to Motion Planning and Collision Detection
- Efficient ray shooting and hidden surface removal
- Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
- An optimal algorithm for the boundary of a cell in a union of rays
- Title not available (Why is that?)
- Circle Shooting in a Simple Polygon
Cited In (18)
- Vertical Ray Shooting and Computing Depth Orders for Fat Objects
- Generalized disk graphs
- An optimal-time algorithm for shortest paths on realistic polyhedra
- Fair and square: cake-cutting in two dimensions
- Dynamic data structures for fat objects and their applications
- Models and motion planning
- Improved bounds on the union complexity of fat objects
- Computing depth orders and related problems
- 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects
- Envy-Free Division of Land
- Keep your distance: land division with separation
- Smoothed analysis of probabilistic roadmaps
- Piercing pairwise intersecting convex shapes in the plane
- A research note on design of fair surfaces over irregular domains using data-dependent triangulation
- Removing depth-order cycles among triangles: an algorithm generating triangular fragments
- Computing and Verifying Depth Orders
- On the flatness of Minkowski sums
- Models and motion planning
This page was built for publication: Computing depth orders for fat objects and related problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1917032)
