Linear size binary space partitions for uncluttered scenes
From MaRDI portal
Recommendations
Cited in
(28)- Models and motion planning
- Constructive polynomial partitioning for algebraic curves in \(\mathbb{R}^3\) with applications
- An optimal-time algorithm for shortest paths on realistic polyhedra
- On realistic terrains
- Multi-way space partitioning trees.
- Binary plane partitions for disjoint line segments
- Approximating the packedness of polygonal curves
- Delaunay Triangulation of Imprecise Points Simplified and Extended
- Guarding scenes against invasive hypercubes.
- Spanning trees crossing few barriers
- Conflict neutralization on binary space partitioning
- Ray shooting and intersection searching amidst fat convex polyhedra in 3-space
- Walking around fat obstacles.
- Binary space partitions for axis-parallel line segments: Size-height tradeoffs.
- Approximating the Fréchet distance for realistic curves in near linear time
- Local polyhedra and geometric graphs
- Kinetic collision detection for convex fat objects
- Linear size binary space partitions for fat objects
- Approximate range searching using binary space partitions
- Smoothed analysis of probabilistic roadmaps
- Preprocessing imprecise points for Delaunay triangulation: simplified and extended
- Connect the Dot: Computing Feed-Links with Minimum Dilation
- Characterizing regions of attraction for piecewise affine systems by continuity of discrete transition functions
- Approximating the Packedness of Polygonal Curves
- I/O-Efficient Map Overlay and Point Location in Low-Density Subdivisions
- Optimal binary space partitions for segments in the plane
- Eliminating depth cycles among triangles in three dimensions
- Removing depth-order cycles among triangles: an algorithm generating triangular fragments
This page was built for publication: Linear size binary space partitions for uncluttered scenes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1587784)
