Computing depth orders for fat objects and related problems
From MaRDI portal
Recommendations
Cites work
- -nets and simplex range queries
- Algorithms for bichromatic line-segment problems and polyhedral terrains
- An optimal algorithm for the boundary of a cell in a union of rays
- Applications of Parametric Searching in Geometric Optimization
- Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
- Circle Shooting in a Simple Polygon
- Computing and Verifying Depth Orders
- Efficient hidden surface removal for objects with small union size
- Efficient ray shooting and hidden surface removal
- Euclidean minimum spanning trees and bichromatic closest pairs
- Fat Triangles Determine Linearly Many Holes
- Finding the upper envelope of n line segments in O(n log n) time
- scientific article; zbMATH DE number 437529 (Why is no real title available?)
- scientific article; zbMATH DE number 437554 (Why is no real title available?)
- scientific article; zbMATH DE number 3887061 (Why is no real title available?)
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- scientific article; zbMATH DE number 732977 (Why is no real title available?)
- Intersection queries in sets of disks
- Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
- On fat partitioning, fat covering and the union size of polygons
- On range searching with semialgebraic sets
- 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
- Range searching with efficient hierarchical cuttings
- Ray shooting in polygons using geodesic triangulations
- Ray shooting, depth orders and hidden surface removal
- Red-Blue Intersection Detection Algorithms, with Applications to Motion Planning and Collision Detection
- Visibility and intersection problems in plane geometry
Cited in
(20)- Smoothed analysis of probabilistic roadmaps
- 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects
- Models and motion planning
- On the flatness of Minkowski sums
- Removing depth-order cycles among triangles: an algorithm generating triangular fragments
- Fair and square: cake-cutting in two dimensions
- Envy-Free Division of Land
- Vertical Ray Shooting and Computing Depth Orders for Fat Objects
- Computing and Verifying Depth Orders
- Models and motion planning
- Computing depth orders and related problems
- Dynamic data structures for fat objects and their applications
- Keep your distance: land division with separation
- Piercing pairwise intersecting convex shapes in the plane
- Piercing unit geodesic disks
- An O(n n) algorithm for single-source shortest paths in disk graphs
- Generalized disk graphs
- An optimal-time algorithm for shortest paths on realistic polyhedra
- Improved bounds on the union complexity of fat objects
- A research note on design of fair surfaces over irregular domains using data-dependent triangulation
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)
