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