Guarding scenes against invasive hypercubes.
From MaRDI portal
Publication:1405005
DOI10.1016/S0925-7721(03)00016-6zbMATH Open1048.65025OpenAlexW2142728440MaRDI QIDQ1405005FDOQ1405005
Mark H. Overmars, Haggai David, Jules Vleugels, Mark de Berg, Matthew J. Katz, A. Frank van der Stappen
Publication date: 25 August 2003
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0925-7721(03)00016-6
Recommendations
Cites Work
- \(\epsilon\)-nets and simplex range queries
- Range Searching and Point Location among Fat Objects
- Realistic input models for geometric algorithms
- Linear size binary space partitions for uncluttered scenes
- The complexity of the free space for motion planning amidst fat obstacles
- Title not available (Why is that?)
- Models and motion planning
- Models and motion planning
- Guard Files: Stabbing and Intersection Queries on Fat Spatial Objects
Cited In (10)
- Binary plane partitions for disjoint line segments
- Approximate Range Searching in External Memory
- Delaunay Triangulation of Imprecise Points Simplified and Extended
- Realistic input models for geometric algorithms
- Kinetic collision detection for convex fat objects
- Approximate range searching in external memory
- Decompositions and boundary coverings of non-convex fat polyhedra
- Approximate range searching using binary space partitions
- Preprocessing imprecise points for Delaunay triangulation: simplified and extended
- Models and motion planning
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)
