Guarding scenes against invasive hypercubes.
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 431986 (Why is no real title available?)
- Guard Files: Stabbing and Intersection Queries on Fat Spatial Objects
- Linear size binary space partitions for uncluttered scenes
- Models and motion planning
- Models and motion planning
- Range Searching and Point Location among Fat Objects
- Realistic input models for geometric algorithms
- The complexity of the free space for motion planning amidst fat obstacles
- \(\epsilon\)-nets and simplex range queries
Cited in
(11)- Preprocessing imprecise points for Delaunay triangulation: simplified and extended
- Approximate range searching in external memory
- Approximate range searching using binary space partitions
- Decompositions and boundary coverings of non-convex fat polyhedra
- Delaunay Triangulation of Imprecise Points Simplified and Extended
- Kinetic collision detection for convex fat objects
- Approximate Range Searching in External Memory
- Realistic input models for geometric algorithms
- Triangulating and guarding realistic polygons
- Models and motion planning
- Binary plane partitions for disjoint line segments
This page was built for publication: Guarding scenes against invasive hypercubes.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1405005)