Linear size binary space partitions for uncluttered scenes
From MaRDI portal
Publication:1587784
DOI10.1007/s004530010047zbMath0960.68160OpenAlexW2120039945MaRDI QIDQ1587784
Publication date: 3 December 2000
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://dspace.library.uu.nl/handle/1874/18741
Related Items (24)
Models and motion planning ⋮ OPTIMAL BINARY SPACE PARTITIONS FOR SEGMENTS IN THE PLANE ⋮ An optimal-time algorithm for shortest paths on realistic polyhedra ⋮ Connect the Dot: Computing Feed-Links with Minimum Dilation ⋮ Delaunay Triangulation of Imprecise Points Simplified and Extended ⋮ Characterizing regions of attraction for piecewise affine systems by continuity of discrete transition functions ⋮ Guarding scenes against invasive hypercubes. ⋮ Eliminating depth cycles among triangles in three dimensions ⋮ Approximating the Fréchet distance for realistic curves in near linear time ⋮ Preprocessing imprecise points for Delaunay triangulation: simplified and extended ⋮ Spanning trees crossing few barriers ⋮ Constructive Polynomial Partitioning for Algebraic Curves in $\mathbb{R}^3$ with Applications ⋮ I/O-Efficient Map Overlay and Point Location in Low-Density Subdivisions ⋮ Removing depth-order cycles among triangles: an algorithm generating triangular fragments ⋮ On realistic terrains ⋮ Ray shooting and intersection searching amidst fat convex polyhedra in 3-space ⋮ Approximating the Packedness of Polygonal Curves ⋮ Binary plane partitions for disjoint line segments ⋮ Approximate range searching using binary space partitions ⋮ Local polyhedra and geometric graphs ⋮ Kinetic collision detection for convex fat objects ⋮ Smoothed analysis of probabilistic roadmaps ⋮ Approximating the packedness of polygonal curves ⋮ Walking around fat obstacles.
This page was built for publication: Linear size binary space partitions for uncluttered scenes
