Guarding scenes against invasive hypercubes.

DOI10.1016/S0925-7721(03)00016-6zbMath1048.65025OpenAlexW2142728440MaRDI QIDQ1405005

Mark H. Overmars, Haggai David, Jules Vleugels, Matthew J. Katz, A. Frank van der Stappen, Mark T. de Berg

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

zbMATH Keywords

Geometric algorithmsEpsilon-netsGuarding setsInput models

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (9)

Models and motion planning ⋮ Delaunay Triangulation of Imprecise Points Simplified and Extended ⋮ Approximate range searching in external memory ⋮ Preprocessing imprecise points for Delaunay triangulation: simplified and extended ⋮ Approximate Range Searching in External Memory ⋮ Binary plane partitions for disjoint line segments ⋮ Approximate range searching using binary space partitions ⋮ Kinetic collision detection for convex fat objects ⋮ Decompositions and boundary coverings of non-convex fat polyhedra

Cites Work

• Unnamed Item
• \(\epsilon\)-nets and simplex range queries
• Linear size binary space partitions for uncluttered scenes
• Models and motion planning
• The complexity of the free space for motion planning amidst fat obstacles
• Realistic input models for geometric algorithms
• Range Searching and Point Location among Fat Objects
• Models and motion planning
• Guard Files: Stabbing and Intersection Queries on Fat Spatial Objects

This page was built for publication: Guarding scenes against invasive hypercubes.